Convergence of Adaptive Least Squares Finite Element Methods
math.NA, cs.NA
Submitted: 2026-11-06
Updated: 2026-11-06
Comments: 26 pages
License: http://creativecommons.org/licenses/by/4.0/
The gist: We consider a general class of operator equations B u=f where B: U to L 2 is a linear isomorphis from a Hilbert space U onto an `` L 2-type'' space L 2 = L 2(Ω; R q).
Abstract
We consider a general class of operator equations B u=f where B: U to L 2 is a linear isomorphis from a Hilbert space U onto an `` L 2-type'' space L 2 = L 2(Ω; R q). This covers weak first order formulations of stationary elliptic boundary value problems, the Stokes system or systems for linear elasticity as well as space-time formulations of heat or wave equations. Since an L 2-residual is uniformly equivalent to the corresponding error in the trial space norm reliable and efficient computable a posteriori error bounds are for free. In contrast to a matured theory of classical adaptive finite element methods, estblishing linear convergence - and eventually optimal complexity - in a least squares setting seems to have remained open. To a large extent this is due to the fact that least squares error indicators do not exhibit any explicit dependence on local mesh-sizes. In this paper we propose a rather different approach to establish under which circumstances standard Dörfler-marking mesh refinement gives rise to linear convergence and rate optimality of adaptive least squares finite element methods as well. A central role is played by a new notion of data-visibility which is a structural property of the data rather than a smoothness condition.
Sources
- Well-posedness of first-order acoustic wave equations and space-time finite element approximation
- DPG loss functions for learning parameter-to-solution maps by neural networks
- Variationally correct operator learning: Reduced basis neural operator with a posteriori error estimation
Related papers
- Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
- A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
- Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
- Operator learning meets inverse problems: A probabilistic perspective
- Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers