Convergence and quasi-optimal cost of adaptive algorithms for nonlinear operators including iterative linearization and algebraic solver
From MaRDI portal
Publication:2662902
DOI10.1007/s00211-021-01176-wzbMath1468.65191arXiv2004.13137MaRDI QIDQ2662902
Martin Vohralík, Stefan Schimanko, Alexander Haberl, Dirk Praetorius
Publication date: 15 April 2021
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.13137
68Q25: Analysis of algorithms and problem complexity
65N15: Error bounds for boundary value problems involving PDEs
65N12: Stability and convergence of numerical methods for boundary value problems involving PDEs
65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
35J15: Second-order elliptic equations
65N50: Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
Related Items
A modified Kačanov iteration scheme with application to quasilinear diffusion models, Explicit and efficient error estimation for convex minimization problems, Goal-oriented error analysis of iterative Galerkin discretizations for nonlinear problems including linearization and algebraic errors, Energy contraction and optimal convergence of adaptive iterative linearized finite element methods, A link between the steepest descent method and fixed-point iterations
Cites Work
- 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
- Adaptive wavelet methods for linear and nonlinear least-squares problems
- 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
- Iterative Galerkin discretizations for strongly monotone problems
- Stabilized and inexact adaptive methods for capturing internal layers in quasilinear PDE
- A posteriori analysis of iterative algorithms for a nonlinear problem
- Convergent adaptive finite elements for the nonlinear Laplacian
- Adaptive finite element methods with convergence rates
- On the convergence of adaptive iterative linearized Galerkin methods
- Adaptive FEM with coarse initial mesh guarantees optimal convergence rates for compactly perturbed elliptic problems
- A posteriori estimation of the linearization error for strongly monotone nonlinear operators
- Optimality of a standard adaptive finite element method
- Adaptive Inexact Newton Methods with A Posteriori Stopping Criteria for Nonlinear Diffusion PDEs
- An a posteriori error estimate for vertex-centered finite volume discretizations of immiscible incompressible two-phase flow
- Optimality of an adaptive finite element method for the p-Laplacian equation
- An Adaptive Finite Element Eigenvalue Solver of Asymptotic Quasi-Optimal Computational Complexity
- Iterative Methods for Linear Systems
- Quasi-Optimal Convergence Rate of an Adaptive Discontinuous Galerkin Method
- An $hp$-adaptive Newton-discontinuous-Galerkin finite element approach for semilinear elliptic boundary value problems
- Linear Convergence of an Adaptive Finite Element Method for the p-Laplacian Equation
- An Optimal Adaptive Finite Element Method for the Stokes Problem
- Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
- Global inexact Newton methods for very large scale nonlinear problems
- Globally Convergent Inexact Newton Methods
- Adaptive Wavelet Schemes for Nonlinear Variational Problems
- Data Oscillation and Convergence of Adaptive FEM
- Rate optimal adaptive FEM with inexact solver for nonlinear operators
- A Convergent Adaptive Algorithm for Poisson’s Equation
- Quasi-Optimal Convergence Rate of an AFEM for Quasi-Linear Problems of Monotone Type
- Adaptive isogeometric boundary element methods with local smoothness control
- Adaptive iterative linearization Galerkin methods for nonlinear problems
- Adaptive Uzawa algorithm for the Stokes equation
- Stopping Criteria Based on Locally Reconstructed Fluxes
- The completion of locally refined simplicial partitions created by bisection
- Adaptive regularization, linearization, and discretization and a posteriori error control for the two-phase Stefan problem
