An efficient parallel immersed boundary algorithm using a pseudo-compressible fluid solver
arXiv:1305.3976 · doi:10.1016/j.jcp.2014.10.058
Abstract
We propose an efficient algorithm for the immersed boundary method on distributed-memory architectures, with the computational complexity of a completely explicit method and excellent parallel scaling. The algorithm utilizes the pseudo-compressibility method recently proposed by Guermond and Minev [Comptes Rendus Mathematique, 348:581-585, 2010] 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. For these problems, we compare the proposed algorithm against other second-order projection-based fluid solvers. Lastly, the strong and weak scaling properties of the proposed algorithm are investigated.
Cited by in corpus (5)
- An immersed boundary method for the fluid-structure interaction of slender flexible structures in viscous fluid
- Simulating flexible fiber suspensions using a scalable immersed boundary algorithm
- Simulating biofilm deformation and detachment with the immersed boundary method
- Fluid-structure interaction of multi-body systems: Methodology and applications
- Parametric resonance in spherical immersed elastic shells