Quasi-optimal convergence of AFEM based on separate marking, Part II

Various applications in computational fluid dynamics and solid mechanics motivate the development of reliable and efficient adaptive algorithms for nonstandard finite element methods (FEMs). Standard adaptive finite element algorithms consist of the iterative loop of the basic steps Solve, Estimate,...

Full description

Saved in:
Bibliographic Details
Published inJournal of numerical mathematics Vol. 23; no. 2; pp. 157 - 174
Main Author Rabus, Hella
Format Journal Article
LanguageEnglish
Published Berlin De Gruyter 01.06.2015
Walter de Gruyter GmbH
Subjects
Online AccessGet full text
ISSN1570-2820
1569-3953
DOI10.1515/jnma-2015-0011

Cover

More Information
Summary:Various applications in computational fluid dynamics and solid mechanics motivate the development of reliable and efficient adaptive algorithms for nonstandard finite element methods (FEMs). Standard adaptive finite element algorithms consist of the iterative loop of the basic steps Solve, Estimate, Mark, and Refine. For separate marking strategies, this standard scheme may be universalised. The (total) error estimator is split into a volume term and an error estimator term. Since the volume term is independent of the discrete solution, an appropriate data approximation may be realised by a high degree of local mesh refinement. This observation results in a natural adaptive algorithm based on separate marking. Its quasi-optimal convergence is proven in this second part for the pure displacement problem in linear elasticity and the Stokes equations and nonconforming Crouzeix-Raviart FEM. The proofs follow the same general methodology as for the Poisson model problem in the first part of this series. The numerical experiments confirm the optimal convergence rates and reveal its flexibility.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1570-2820
1569-3953
DOI:10.1515/jnma-2015-0011