Rate optimal adaptive FEM with inexact solver for nonlinear operators

Abstract

We prove convergence with optimal algebraic rates for an adaptive finite element method for nonlinear equations with strongly monotone operator. Unlike prior works, our analysis also includes the iterative and inexact solution of the arising nonlinear systems by means of the Picard iteration. Using nested iteration, we prove, in particular, that the number of of Picard iterations is uniformly bounded in generic cases, and the overall computational cost is (almost) optimal. Numerical experiments confirm the theoretical results.

References in corpus (1)

• Adaptive IGAFEM with optimal convergence rates: Hierarchical B-splines

Cited by in corpus (13)

• Dörfler marking with minimal cardinality is a linear complexity problem
• Rate optimality of adaptive finite element methods with respect to the overall computational costs
• Convergence and quasi-optimal cost of adaptive algorithms for nonlinear operators including iterative linearization and algebraic solver
• Adaptive BEM with inexact PCG solver yields almost optimal computational costs
• A short note on plain convergence of adaptive least-squares finite element methods
• Cost-optimal adaptive iterative linearized FEM for semilinear elliptic PDEs
• A linear Uzawa-type solver for nonlinear transmission problems
• Goal-oriented adaptive finite element methods with optimal computational complexity
• A link between the steepest descent method and fixed-point iterations
• On full linear convergence and optimal complexity of adaptive FEM with inexact solver
• Cost-optimal adaptive FEM with linearization and algebraic solver for semilinear elliptic PDEs
• Adaptive Morley FEM for the von Kármán equations with optimal convergence rates
• Optimal complexity of goal-oriented adaptive FEM for nonsymmetric linear elliptic PDEs