Published in

Society for Industrial and Applied Mathematics, Multiscale Modeling and Simulation: A SIAM Interdisciplinary Journal, 2(11), p. 474-506

DOI: 10.1137/120867408

Links

Tools

Export citation

Search in Google Scholar

Implicit Coupling of One-Dimensional and Three-Dimensional Blood Flow Models with Compliant Vessels

This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Green circle
Published version: archiving allowed
Data provided by SHERPA/RoMEO

Abstract

The blood flow in arterial trees in the cardiovascular system can be simulated with the help of different models, depending on the outputs of interest and the desired degree of accuracy. In particular, one-dimensional fluid-structure interaction models for arteries are very effective in reproducing physiological pressure wave propagation and in providing quantities like pressure and velocity, averaged on the cross section of the arterial lumen. In locations where one-dimensional models cannot capture the complete flow dynamics, e.g., in the presence of stenoses and aneurysms or other strong geometric perturbations, three-dimensional coupled fluid-structure interaction models are necessary to evaluate more accurately, for instance, critical factors responsible for pathologies which are associated with hemodynamics, such as wall shear stress. In this work we formalize and investigate the geometrical multiscale problem, where heterogeneous fluid-structure interaction models for arteries are implicitly coupled. We introduce new coupling algorithms, describe their implementation, and investigate on simple geometries the numerical reflections that occur at the interface between the heterogeneous models. We also simulate on a supercomputer a three-dimensional abdominal aorta under physiological conditions, coupled with up to six one-dimensional models representing the surrounding arterial branches. Finally, we compare CPU times and number of coupling iterations for different algorithms and time discretizations.