An efficient parallel immersed boundary algorithm using a pseudo-compressible fluid solver

We propose an efficient algorithm for the immersed boundary method on distributed-memory architectures that has the computational complexity of a completely explicit method and also has excellent parallel scaling. The algorithm utilizes the pseudo-compressibility method recently proposed by Guermond and Minev that uses a directional splitting strategy to discretize the incompressible Navier-Stokes equations, thereby reducing the linear systems to a series of one-dimensional tridiagonal systems. We perform numerical simulations of several fluid-structure interaction problems in two and three dimensions and study the accuracy and convergence rates of the proposed algorithm. We also compare the proposed algorithm with other second-order projection-based fluid solvers. Lastly, the execution time and scaling properties of the proposed algorithm are investigated and compared to alternate approaches.