Plain convergence of goal-oriented adaptive FEM

Abstract

We discuss goal-oriented adaptivity in the frame of conforming finite element methods and plain convergence of the related a posteriori error estimator for different general marking strategies. We present an abstract analysis for two different settings. First, we consider problems where a local discrete efficiency estimate holds. Second, we show plain convergence in a setting that relies only on structural properties of the error estimators, namely stability on non-refined elements as well as reduction on refined elements. In particular, the second setting does not require reliability and efficiency estimates. Numerical experiments underline our theoretical findings.

References in corpus (8)

• Rate optimality of adaptive finite element methods with respect to the overall computational costs
• Unified analysis of discontinuous Galerkin and $C^0$-interior penalty finite element methods for Hamilton--Jacobi--Bellman and Isaacs equations
• Goal-oriented adaptive finite element method for semilinear elliptic PDEs
• Convergence of adaptive discontinuous Galerkin and $C^0$-interior penalty finite element methods for Hamilton--Jacobi--Bellman and Isaacs equations
• A short note on plain convergence of adaptive least-squares finite element methods
• Goal-oriented adaptive finite element methods with optimal computational complexity
• Optimal convergence rates for goal-oriented FEM with quadratic goal functional
• Plain convergence of adaptive algorithms without exploiting reliability and efficiency