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

From MaRDI portal
Publication:728825

DOI10.1016/J.JCP.2014.10.058zbMATH Open1351.76130arXiv1305.3976OpenAlexW2067154036MaRDI QIDQ728825FDOQ728825


Authors: Jeffrey K. Wiens, John M. Stockie Edit this on Wikidata


Publication date: 20 December 2016

Published in: Journal of Computational Physics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1305.3976




Recommendations




Cites Work


Cited In (13)

Uses Software





This page was built for publication: An efficient parallel immersed boundary algorithm using a pseudo-compressible fluid solver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q728825)