We introduce a new finite element method, the composite mini element, for the mixed discretization of the Stokes equations on two- and three-dimensional domains that may contain a huge number of geometric details. In standard finite element discretizations of the Stokes problem, such as the classical mini element, the approximation quality is determined by the maximal mesh size of the underlying triangulation, while the computational effort is determined by its number of elements. If the physical domain is very complicated, then the minimal number of simplices, which are necessary to resolve the domain, can be very large and distributed in a nonoptimal way with respect to the approximation quality. In contrast to that, the minimal dimension of the composite mini element space is independent of the number of geometric details. Instead of a geometric resolution of the domain and the boundary condition by the finite element mesh the shape of the finite element functions is adapted to the geometric details. This approach allows low-dimensional approximations even for problems with complicated geometric details such as holes or rough boundaries. We prove its linear (optimal order) approximability and its inf-sup stability. Further, we will be able to control the nonconformity in the space without increasing the space dimension in such a way that the a priori error estimate $\|{\mathbf{u}-\mathbf{u}^{\mathrm{CME}}}\|_{1,\Omega}+\|{p-p^{\mathrm{CME}}} \|_{0,\Omega}\lesssim h\|{\mathbf{f}}\|_{0,\Omega}$ holds. Thereby, in contrast to the classical methods, the choice of the mesh size parameter $h$ is not constrained by the size of geometric details. In addition, it turns out that the method can be viewed as a coarse-scale generalization of the classical mini element approach; i.e., it reduces the computational effort, while the approximation quality depends on the (coarse) mesh size in the usual way.

Petersheim, D; Sauter, S (2008). *The composite mini element-coarse mesh computation of Stokes flows on complicated domains.* SIAM Journal on Numerical Analysis, 46(6):3181-3206.

## Abstract

We introduce a new finite element method, the composite mini element, for the mixed discretization of the Stokes equations on two- and three-dimensional domains that may contain a huge number of geometric details. In standard finite element discretizations of the Stokes problem, such as the classical mini element, the approximation quality is determined by the maximal mesh size of the underlying triangulation, while the computational effort is determined by its number of elements. If the physical domain is very complicated, then the minimal number of simplices, which are necessary to resolve the domain, can be very large and distributed in a nonoptimal way with respect to the approximation quality. In contrast to that, the minimal dimension of the composite mini element space is independent of the number of geometric details. Instead of a geometric resolution of the domain and the boundary condition by the finite element mesh the shape of the finite element functions is adapted to the geometric details. This approach allows low-dimensional approximations even for problems with complicated geometric details such as holes or rough boundaries. We prove its linear (optimal order) approximability and its inf-sup stability. Further, we will be able to control the nonconformity in the space without increasing the space dimension in such a way that the a priori error estimate $\|{\mathbf{u}-\mathbf{u}^{\mathrm{CME}}}\|_{1,\Omega}+\|{p-p^{\mathrm{CME}}} \|_{0,\Omega}\lesssim h\|{\mathbf{f}}\|_{0,\Omega}$ holds. Thereby, in contrast to the classical methods, the choice of the mesh size parameter $h$ is not constrained by the size of geometric details. In addition, it turns out that the method can be viewed as a coarse-scale generalization of the classical mini element approach; i.e., it reduces the computational effort, while the approximation quality depends on the (coarse) mesh size in the usual way.

## Citations

## Altmetrics

## Downloads

## Additional indexing

Item Type: | Journal Article, refereed, original work |
---|---|

Communities & Collections: | 07 Faculty of Science > Institute of Mathematics |

Dewey Decimal Classification: | 510 Mathematics |

Language: | English |

Date: | 2008 |

Deposited On: | 21 Jan 2009 13:22 |

Last Modified: | 05 Apr 2016 12:39 |

Publisher: | Society for Industrial and Applied Mathematics |

ISSN: | 0036-1429 |

Additional Information: | Copyright © 2009, Society for Industrial and Applied Mathematics |

Publisher DOI: | https://doi.org/10.1137/070704356 |

Related URLs: | http://www.ams.org/mathscinet-getitem?mr=2439507 |

## Download

TrendTerms displays relevant terms of the abstract of this publication and related documents on a map. The terms and their relations were extracted from ZORA using word statistics. Their timelines are taken from ZORA as well. The bubble size of a term is proportional to the number of documents where the term occurs. Red, orange, yellow and green colors are used for terms that occur in the current document; red indicates high interlinkedness of a term with other terms, orange, yellow and green decreasing interlinkedness. Blue is used for terms that have a relation with the terms in this document, but occur in other documents.

You can navigate and zoom the map. Mouse-hovering a term displays its timeline, clicking it yields the associated documents.