Optimal convergence rates for goal-oriented FEM with quadratic goal functional
arXiv:2003.13270 · doi:10.1515/cmam-2020-0044
Abstract
We consider a linear elliptic PDE and a quadratic goal functional. The goal-oriented adaptive FEM algorithm (GOAFEM) solves the primal as well as a dual problem, where the goal functional is always linearized around the discrete primal solution at hand. We show that the marking strategy proposed in [Feischl et al, SIAM J. Numer. Anal., 54 (2016)] for a linear goal functional is also optimal for quadratic goal functionals, i.e., GOAFEM leads to linear convergence with optimal convergence rates.
References in corpus (9)
- Axioms of Adaptivity
- Adaptive FEM with optimal convergence rates for a certain class of non-symmetric and possibly non-linear problems
- On 2D Newest Vertex Bisection: Optimality of Mesh-Closure and H1-Stability of L2-Projection
- Adaptive FEM with coarse initial mesh guarantees optimal convergence rates for compactly perturbed elliptic problems
- Analysis-suitable adaptive T-mesh refinement with linear complexity
- An abstract analysis of optimal goal-oriented adaptivity
- Adaptive IGAFEM with optimal convergence rates: Hierarchical B-splines
- Complexity of hierarchical refinement for a class of admissible mesh configurations
- Globally structured 3D Analysis-suitable T-splines: definition, linear independence and m-graded local refinement
Cited by in corpus (4)
- Goal-oriented adaptive finite element method for semilinear elliptic PDEs
- A Posteriori Single- and Multi-Goal Error Control and Adaptivity for Partial Differential Equations
- Optimal complexity of goal-oriented adaptive FEM for nonsymmetric linear elliptic PDEs
- Plain convergence of goal-oriented adaptive FEM