Interface handling for three‐dimensional higher‐order XFEM‐computations in fluid–structure interaction

Three-dimensional higher-order eXtended finite element method (XFEM) - computations still pose challenging computational geometry problems especially for moving interfaces. This paper provides a method for the localization of a higher-order interface finite element (FE) mesh in an underlying three-dimensional higher-order FE mesh. Additionally, it demonstrates, how a subtetrahedralization of an intersected element can be obtained, which preserves the possibly curved interface and allows therefore exact numerical integration. The proposed interface algorithm collects initially a set of possibly intersecting elements by comparing their ?eXtended axis-aligned bounding boxes?. The intersection method is applied to a highly reduced number of intersection candidates. The resulting linearized interface is used as input for an elementwise constrained Delaunay tetrahedralization, which computes an appropriate subdivision for each intersected element. The curved interface is recovered from the linearized interface in the last step. The output comprises triangular integration cells representing the interface and tetrahedral integration cells for each intersected element. Application of the interface algorithm currently concentrates on fluid-structure interaction problems on low-order and higher-order FE meshes, which may be composed of any arbitrary element types such as hexahedra, tetrahedra, wedges, etc.. Nevertheless, other XFEM-problems with explicitly given interfaces or discontinuities may be tackled in addition. Multiple structures and interfaces per intersected element can be handled without any additional difficulties. Several parallelization strategies exist depending on the desired domain decomposition approach. Numerical test cases including various geometrical exceptions demonstrate the accuracy, robustness and efficiency of the interface handling.

[1]  Ted Belytschko,et al.  Arbitrary discontinuities in finite elements , 2001 .

[2]  Martin Reimers,et al.  Mean value coordinates in 3D , 2005, Comput. Aided Geom. Des..

[3]  T. Belytschko,et al.  An Extended Finite Element Method for Two-Phase Fluids , 2003 .

[4]  M. M. Rashid,et al.  A three‐dimensional finite element method with arbitrary polyhedral elements , 2006 .

[5]  David R. Noble,et al.  Quadrature rules for triangular and tetrahedral elements with generalized functions , 2008 .

[6]  Dinesh Manocha,et al.  Algebraic pruning: a fast technique for curve and surface intersection , 1997, Comput. Aided Geom. Des..

[7]  Chandrajit L. Bajaj,et al.  Tracing surface intersections , 1988, Comput. Aided Geom. Des..

[8]  W. Wall,et al.  Fluid–structure interaction approaches on fixed grids based on two different domain decomposition ideas , 2008 .

[9]  Dinesh Manocha,et al.  Algorithms for intersecting parametric and algebraic curves I: simple intersections , 1994, TOGS.

[10]  Klaus Gärtner,et al.  Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations , 2005, IMR.

[11]  Hang Si,et al.  On Refinement of Constrained Delaunay Tetrahedralizations , 2006, IMR.

[12]  Arnold Reusken,et al.  An extended pressure finite element space for two-phase incompressible flows with surface tension , 2007, J. Comput. Phys..

[13]  Juan Manuel Peña,et al.  A shape preserving representation with an evaluation algorithm of linear complexity , 2003, Comput. Aided Geom. Des..

[14]  Nicholas M. Patrikalakis,et al.  Computation of the solutions of nonlinear polynomial systems , 1993, Comput. Aided Geom. Des..

[15]  Ernst Huber.  Intersecting general parametric surfaces using bounding volumes , 1998, CCCG.

[16]  Tod A. Laursen,et al.  A contact searching algorithm including bounding volume trees applied to finite sliding mortar formulations , 2007 .

[17]  W. Wall,et al.  An eXtended Finite Element Method/Lagrange multiplier based approach for fluid-structure interaction , 2008 .

[18]  Marcelo Gattass,et al.  INTERSECTING AND TRIMMING PARAMETRIC MESHES ON FINITE-ELEMENT SHELLS , 2000 .

[19]  Dinesh Manocha,et al.  Algorithms for Intersecting Parametric and Algebraic Curves II: Multiple Intersections , 1995, CVGIP Graph. Model. Image Process..

[20]  Robert E. Barnhill,et al.  A marching method for parametric surface/surface intersection , 1990, Comput. Aided Geom. Des..

[21]  G. Ventura.  On the elimination of quadrature subcells for discontinuous functions in the eXtended Finite‐Element Method , 2006 .

[22]  Jonathan Richard Shewchuk,et al.  Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery , 2002, IMR.

[23]  Nicholas M. Patrikalakis,et al.  Surface-to-surface intersections , 1993, IEEE Computer Graphics and Applications.

[24]  Markus H. Gross,et al.  A Finite Element Method on Convex Polyhedra , 2007, Comput. Graph. Forum.

[25]  P. Milbradt,et al.  Polytope finite elements , 2008 .

[26]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[27]  Wolfgang A. Wall,et al.  Enhancement of fixed‐grid methods towards complex fluid–structure interaction applications , 2008 .

[28]  Dinesh Manocha,et al.  An efficient surface intersection algorithm based on lower-dimensional formulation , 1997, TOGS.

[29]  M. Floater.  Mean value coordinates , 2003, Computer Aided Geometric Design.

[30]  Jonathan Richard Shewchuk,et al.  A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations , 1998, SCG '98.

[31]  Ted Belytschko,et al.  A finite element method for crack growth without remeshing , 1999 .