.png){kind=icon}
.png){kind=icon}
Return
An efficient parallel immersed boundary algorithm using a pseudo-compressible fluid solver
.png){kind=icon}
OA
AI
DOI：10.1016/j.jcp.2014.10.058.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2014 Elsevier Inc. All rights reserved.
Keywords:
Immersed boundary method
Fluid-structure interaction
Fractional step method
Pseudo-compressibility method
Domain decomposition
Parallel algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
1.5W
Citations:
7.4W