Rate optimality of adaptive finite element methods with respect to overall computational costs
DOI10.1090/mcom/3654zbMath1468.65189arXiv2003.10785OpenAlexW3013489327MaRDI QIDQ4999467
Dirk Praetorius, Stefan Schimanko, Alexander Haberl, Gregor Gantner
Publication date: 7 July 2021
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.10785
adaptive mesh-refinementoptimal computational costsecond-order elliptic PDEconvergence of adaptive FEM
Numerical computation of solutions to systems of equations (65H10) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Rate of convergence, degree of approximation (41A25) Complexity and performance of numerical algorithms (65Y20) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Preconditioners for iterative methods (65F08)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Axioms of adaptivity
- On 2D newest vertex bisection: optimality of mesh-closure and \(H ^{1}\)-stability of \(L _{2}\)-projection
- A remark on newest vertex bisection in any space dimension
- Convergence of an adaptive Kačanov FEM for quasi-linear problems
- Guaranteed and robust a posteriori error estimates and balancing discretization and linearization errors for monotone nonlinear problems
- Optimal multilevel methods for graded bisection grids
- Adaptive BEM with inexact PCG solver yields almost optimal computational costs
- Iterative Galerkin discretizations for strongly monotone problems
- Uniform convergence of multigrid V-cycle on adaptively refined finite element meshes for second order elliptic problems
- Complexity of hierarchical refinement for a class of admissible mesh configurations
- Convergent adaptive finite elements for the nonlinear Laplacian
- Adaptive finite element methods with convergence rates
- A linear Uzawa-type FEM-BEM solver for nonlinear transmission problems
- Energy contraction and optimal convergence of adaptive iterative linearized finite element methods
- On the convergence of adaptive iterative linearized Galerkin methods
- Adaptive FEM with coarse initial mesh guarantees optimal convergence rates for compactly perturbed elliptic problems
- Analysis-suitable adaptive T-mesh refinement with linear complexity
- Optimality of a standard adaptive finite element method
- Stopping Criteria for Adaptive Finite Element Solvers
- Adaptive Inexact Newton Methods with A Posteriori Stopping Criteria for Nonlinear Diffusion PDEs
- Optimality of an adaptive finite element method for the p-Laplacian equation
- An Adaptive Finite Element Eigenvalue Solver of Asymptotic Quasi-Optimal Computational Complexity
- A Convergent Nonconforming Adaptive Finite Element Method with Quasi-Optimal Complexity
- Quasi-Optimal Convergence Rate of an Adaptive Discontinuous Galerkin Method
- Quasioptimal cardinality of AFEM driven by nonresidual estimators
- An $hp$-adaptive Newton-discontinuous-Galerkin finite element approach for semilinear elliptic boundary value problems
- Optimality of local multilevel methods on adaptively refined meshes for elliptic boundary value problems
- Linear Convergence of an Adaptive Finite Element Method for the p-Laplacian Equation
- Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
- Data Oscillation and Convergence of Adaptive FEM
- Rate optimal adaptive FEM with inexact solver for nonlinear operators
- Adaptive IGAFEM with optimal convergence rates: Hierarchical B-splines
- A Convergent Adaptive Algorithm for Poisson’s Equation
- Quasi-Optimal Convergence Rate of an AFEM for Quasi-Linear Problems of Monotone Type
- Adaptive iterative linearization Galerkin methods for nonlinear problems
- Dörfler marking with minimal cardinality is a linear complexity problem
- Fully Adaptive Newton--Galerkin Methods for Semilinear Elliptic Partial Differential Equations
- The completion of locally refined simplicial partitions created by bisection
- Additive Schwarz preconditioning for p-version triangular and tetrahedral finite elements
- Adaptive FEM with Optimal Convergence Rates for a Certain Class of Nonsymmetric and Possibly Nonlinear Problems