An Approach for Parallel Fluid-Structure Interaction on Unstructured Meshes

The simulation of fluid-structure interaction (FSI) problems is a challenge in contemporary science and engineering. This contribution presents an approach to FSI problems with incompressible Newtonian fluids and elastic structures and discusses its realization in a general purpose parallel finite element research code. The resulting algorithm is robust and efficient and scales well on parallel machines. Recent attempts on efficiency improvements are discussed and a numerical example is shown.

[1]  W. Wall,et al.  A Solution for the Incompressibility Dilemma in Partitioned Fluid–Structure Interaction with Pure Dirichlet Fluid Domains , 2006 .

[2]  Michael M. Resch,et al.  Computational Science and High Performance Computing III , 2005 .

[3]  D. Dinkler,et al.  A monolithic approach to fluid–structure interaction using space–time finite elements , 2004 .

[4]  Wolfgang A. Wall.  Fluid-Struktur-Interaktion mit stabilisierten Finiten Elementen , 1999 .

[5]  Ekkehard Ramm,et al.  Computational Efficiency of Parallel Unstructured Finite Element Simulations , 2006 .

[6]  Ekkehard Ramm,et al.  Robustness and efficiency aspects for computational fluid structure interaction , 2006 .

[7]  A. Quarteroni,et al.  Fluid–structure algorithms based on Steklov–Poincaré operators , 2006 .

[8]  M. Heil.  An efficient solver for the fully-coupled solution of large-displacement fluid-structure interaction problems , 2004 .

[9]  Miguel Angel Fernández,et al.  A Newton method using exact jacobians for solving fluid-structure coupling , 2005 .

[10]  Tayfun E. Tezduyar,et al.  Finite Element Methods for Fluid Dynamics with Moving Boundaries and Interfaces , 2004 .

[11]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[12]  Michael M. Resch.  High Performance Computing on Vector Systems 2008 , 2006 .

[13]  Thomas J. R. Hughes,et al.  Encyclopedia of computational mechanics , 2004 .