A short note on plain convergence of adaptive least-squares finite element methods

Abstract

We show that adaptive least-squares finite element methods driven by the canonical least-squares functional converge under weak conditions on PDE operator, mesh-refinement, and marking strategy. Contrary to prior works, our plain convergence does neither rely on sufficiently fine initial meshes nor on severe restrictions on marking parameters. Finally, we prove that convergence is still valid if a contractive iterative solver is used to obtain the approximate solutions (e.g., the preconditioned conjugate gradient method with optimal preconditioner). The results apply within a fairly abstract framework which covers a variety of model problems.

References in corpus (11)

• Axioms of Adaptivity
• On 2D Newest Vertex Bisection: Optimality of Mesh-Closure and H1-Stability of L2-Projection
• Approximating gradients with continuous piecewise polynomial functions
• Further results on a space-time FOSLS formulation of parabolic PDEs
• Dörfler marking with minimal cardinality is a linear complexity problem
• Each H^{1/2}-stable projection yields convergence and quasi-optimality of adaptive FEM with inhomogeneous Dirichlet data in R^d
• Rate optimal adaptive FEM with inexact solver for nonlinear operators
• Rate optimality of adaptive finite element methods with respect to the overall computational costs
• Adaptive BEM with inexact PCG solver yields almost optimal computational costs
• A linear Uzawa-type solver for nonlinear transmission problems
• Equivalence of local-and global-best approximations, a simple stable local commuting projector, and optimal $hp$ approximation estimates in $H(\mathrm{div})$

Cited by in corpus (3)

• Further results on a space-time FOSLS formulation of parabolic PDEs
• Plain convergence of adaptive algorithms without exploiting reliability and efficiency
• Plain convergence of goal-oriented adaptive FEM