Convergence and quasi-optimal cost of adaptive algorithms for nonlinear operators including iterative linearization and algebraic solver
From MaRDI portal
Publication:2662902
Analysis of algorithms and problem complexity (68Q25) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Second-order elliptic equations (35J15)
Abstract: We consider a second-order elliptic boundary value problem with strongly monotone and Lipschitz-continuous nonlinearity. We design and study its adaptive numerical approximation interconnecting a finite element discretization, the Banach-Picard linearization, and a contractive linear algebraic solver. We in particular identify stopping criteria for the algebraic solver that on the one hand do not request an overly tight tolerance but on the other hand are sufficient for the inexact (perturbed) Banach-Picard linearization to remain contractive. Similarly, we identify suitable stopping criteria for the Banach-Picard iteration that leave an amount of linearization error that is not harmful for the residual a-posteriori error estimate to steer reliably the adaptive mesh-refinement. For the resulting algorithm, we prove a contraction of the (doubly) inexact iterates after some amount of steps of mesh-refinement / linerization / algebraic solver, leading to its linear convergence. Moreover, for usual mesh-refinement rules, we also prove that the overall error decays at the optimal rate with respect to the number of elements (degrees of freedom) added with respect to the initial mesh. Finally, we prove that our fully adaptive algorithm drives the overall error down with the same optimal rate also with respect to the overall algorithmic cost expressed as the cumulated sum of the number of mesh elements over all mesh-refinement, linearization, and algebraic solver steps. Numerical experiments support these theoretical findings and illustrate the optimal overall algorithmic cost of the fully adaptive algorithm on several test cases.
Recommendations
- Rate optimal adaptive FEM with inexact solver for nonlinear operators
- Cost-optimal adaptive iterative linearized FEM for semilinear elliptic PDEs
- Rate optimality of adaptive finite element methods with respect to overall computational costs
- Adaptive inexact Newton methods with a posteriori stopping criteria for nonlinear diffusion PDEs
- Adaptive FEM with optimal convergence rates for a certain class of nonsymmetric and possibly nonlinear problems
Cites work
- scientific article; zbMATH DE number 45061 (Why is no real title available?)
- A Convergent Adaptive Algorithm for Poisson’s Equation
- A posteriori analysis of iterative algorithms for a nonlinear problem
- A posteriori estimation of the linearization error for strongly monotone nonlinear operators
- A remark on newest vertex bisection in any space dimension
- Adaptive FEM with coarse initial mesh guarantees optimal convergence rates for compactly perturbed elliptic problems
- Adaptive Uzawa algorithm for the Stokes equation
- Adaptive Wavelet Schemes for Nonlinear Variational Problems
- Adaptive finite element methods with convergence rates
- Adaptive inexact Newton methods with a posteriori stopping criteria for nonlinear diffusion PDEs
- Adaptive isogeometric boundary element methods with local smoothness control
- Adaptive iterative linearization Galerkin methods for nonlinear problems
- Adaptive regularization, linearization, and discretization and a posteriori error control for the two-phase Stefan problem
- Adaptive wavelet methods for linear and nonlinear least-squares problems
- An Optimal Adaptive Finite Element Method for the Stokes Problem
- An \(hp\)-adaptive Newton-discontinuous-Galerkin finite element approach for semilinear elliptic boundary value problems
- An a posteriori error estimate for vertex-centered finite volume discretizations of immiscible incompressible two-phase flow
- An adaptive finite element eigenvalue solver of asymptotic quasi-optimal computational complexity
- Axioms of adaptivity
- Convergence of an adaptive Kačanov FEM for quasi-linear problems
- Convergent adaptive finite elements for the nonlinear Laplacian
- Data Oscillation and Convergence of Adaptive FEM
- Global inexact Newton methods for very large scale nonlinear problems
- Globally Convergent Inexact Newton Methods
- Guaranteed and robust a posteriori error estimates and balancing discretization and linearization errors for monotone nonlinear problems
- Iterative Galerkin discretizations for strongly monotone problems
- Iterative methods for linear systems. Theory and applications
- Linear Convergence of an Adaptive Finite Element Method for the p-Laplacian Equation
- On 2D newest vertex bisection: optimality of mesh-closure and \(H ^{1}\)-stability of \(L _{2}\)-projection
- On the convergence of adaptive iterative linearized Galerkin methods
- Optimality of a standard adaptive finite element method
- Optimality of an adaptive finite element method for the \(p\)-Laplacian equation
- Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
- Quasi-optimal convergence rate of an AFEM for quasi-linear problems of monotone type
- Quasi-optimal convergence rate of an adaptive discontinuous Galerkin method
- Rate optimal adaptive FEM with inexact solver for nonlinear operators
- Stabilized and inexact adaptive methods for capturing internal layers in quasilinear PDE
- Stopping Criteria Based on Locally Reconstructed Fluxes
- The completion of locally refined simplicial partitions created by bisection
Cited in
(12)- Rate optimality of adaptive finite element methods with respect to overall computational costs
- Adaptive inexact Newton methods with a posteriori stopping criteria for nonlinear diffusion PDEs
- Convergence of adaptive Crouzeix-Raviart and Morley FEM for distributed optimal control problems
- An Introductory Review on A Posteriori Error Estimation in Finite Element Computations
- Cost-optimal adaptive iterative linearized FEM for semilinear elliptic PDEs
- Explicit and efficient error estimation for convex minimization problems
- A modified Kačanov iteration scheme with application to quasilinear diffusion models
- Energy contraction and optimal convergence of adaptive iterative linearized finite element methods
- Goal-oriented error analysis of iterative Galerkin discretizations for nonlinear problems including linearization and algebraic errors
- Rate optimal adaptive FEM with inexact solver for nonlinear operators
- A link between the steepest descent method and fixed-point iterations
- Adaptive regularization, discretization, and linearization for nonsmooth problems based on primal-dual gap estimators
This page was built for publication: Convergence and quasi-optimal cost of adaptive algorithms for nonlinear operators including iterative linearization and algebraic solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2662902)
