.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Immersed boundary method
Fluid-structure interaction
Fractional step method
Pseudo-compressibility method
Domain decomposition
Parallel algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
1.5W
被引数:
7.4W
机构
引用论文
7-Eleven Japan and Toyota will launch joint convenience store project in autumn 20197-Eleven日本和丰田将在2019秋季推出联合便利店项目
.png){kind=icon}
PREAI
分享收藏分享收藏Efficient solutions to robust, semi-implicit discretizations of the immersed boundary method浸入边界方法的鲁棒，半隐式离散化的有效解决方案OAAI
OAAI分享收藏
查看更多内容