arXiv Analytics

Sign in

arXiv:1210.8369 [math.NA]AbstractReferencesReviewsResources

Adaptive FEM with optimal convergence rates for a certain class of non-symmetric and possibly non-linear problems

Michael Feischl, Thomas Führer, Dirk Praetorius

Published 2012-10-31, updated 2013-02-11Version 2

We analyze adaptive mesh-refining algorithms for conforming finite element discretizations of certain non-linear second-order partial differential equations. We allow continuous polynomials of arbitrary, but fixed polynomial order. The adaptivity is driven by the residual error estimator. We prove convergence even with optimal algebraic convergence rates. In particular, our analysis covers general linear second-order elliptic operators. Unlike prior works for linear non-symmetric operators, our analysis avoids the interior node property for the refinement, and the differential operator has to satisfy a G\r{a}rding inequality only. If the differential operator is uniformly elliptic, no additional assumption on the initial mesh is posed.

Related articles: Most relevant | Search more
arXiv:1403.0895 [math.NA] (Published 2014-03-04, updated 2014-10-02)
On the convergence theory of adaptive mixed finite element methods for the Stokes problem
arXiv:1701.07764 [math.NA] (Published 2017-01-26)
Adaptive IGAFEM with optimal convergence rates: hierarchical B-splines
arXiv:2210.14063 [math.NA] (Published 2022-10-25)
On a mixed FEM and a FOSLS with $H^{-1}$ loads