Parametric finite elements with bijective mappings

Zulian, Patrick; Schneider, Teseo; Hormann, Kai; Krause, Rolf
The discretization of the computational domain plays a central role in the finite element method. In the standard discretization the domain is triangulated with a mesh and its boundary is approximated by a polygon. The boundary approximation induces a geometry-related error which influences the accuracy of the solution. To control this geometry-related error, iso-parametric finite elements and iso-geometric analysis allow for high order approximation of smooth boundary features. We present an alternative approach which combines parametric finite elements with smooth bijective mappings leaving the choice of approximation spaces free. Our approach allows to represent arbitrarily complex geometries on coarse meshes with curved edges, regardless of the domain boundary complexity. The main idea is to use a bijective mapping for automatically warping the volume of a simple parameterization domain to the complex computational domain, thus creating a curved mesh of the latter. Numerical examples provide evidence that our method has lower approximation error for domains with complex shapes than the standard finite element method, because we are able to solve the problem directly on the exact domain without having to approximate it.
Year:
2017
Type of Publication:
Article
Journal:
BIT Numerical Mathematics
Volume:
57
Number:
4
Pages:
1185-1203
Month:
December
ISSN:
1572-9125
DOI:
10.1007/s10543-017-0669-6
Hits: 61

cardio-centro-ticnic-logo

logo cscs

This website uses cookies to improve your experience. We'll assume you're ok with this, but you can opt-out if you wish. Read more