A parallel sparse algorithm targeting arterial fluid mechanics computations

Murat Manguoglu*, Kenji Takizawa, Ahmed H. Sameh, Tayfun E. Tezduyar

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

31 Citations (Scopus)

Abstract

Iterative solution of large sparse nonsymmetric linear equation systems is one of the numerical challenges in arterial fluid-structure interaction computations. This is because the fluid mechanics parts of the fluid + structure block of the equation system that needs to be solved at every nonlinear iteration of each time step corresponds to incompressible flow, the computational domains include slender parts, and accurate wall shear stress calculations require boundary layer mesh refinement near the arterial walls. We propose a hybrid parallel sparse algorithm, domain-decomposing parallel solver (DDPS), to address this challenge. As the test case, we use a fluid mechanics equation system generated by starting with an arterial shape and flow field coming from an FSI computation and performing two time steps of fluid mechanics computation with a prescribed arterial shape change, also coming from the FSI computation. We show how the DDPS algorithm performs in solving the equation system and demonstrate the scalability of the algorithm.

Original languageEnglish
Pages (from-to)377-384
Number of pages8
JournalComputational Mechanics
Volume48
Issue number3
DOIs
Publication statusPublished - 2011 Sept

Keywords

  • Arterial fluid mechanics
  • Boundary layer mesh refinement
  • Incompressible flow
  • Nested iterative methods
  • Parallel sparse algorithms
  • Preconditioning techniques

ASJC Scopus subject areas

  • Computational Mechanics
  • Ocean Engineering
  • Mechanical Engineering
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A parallel sparse algorithm targeting arterial fluid mechanics computations'. Together they form a unique fingerprint.

Cite this