Cost-optimal adaptive iterative linearized FEM for semilinear elliptic PDEs

Abstract

We consider scalar semilinear elliptic PDEs where the nonlinearity is strongly monotone, but only locally Lipschitz continuous. We formulate an adaptive iterative linearized finite element method (AILFEM) which steers the local mesh refinement as well as the iterative linearization of the arising nonlinear discrete equations. To this end, we employ a damped Zarantonello iteration so that, in each step of the algorithm, only a linear Poisson-type equation has to be solved. We prove that the proposed AILFEM strategy guarantees convergence with optimal rates, where rates are understood with respect to the overall computational complexity (i.e., the computational time). Moreover, we formulate and test an adaptive algorithm where also the damping parameter of the Zarantonello iteration is adaptively adjusted. Numerical experiments underline the theoretical findings.

References in corpus (9)

• Axioms of Adaptivity
• Adaptive FEM with optimal convergence rates for a certain class of non-symmetric and possibly non-linear problems
• Adaptive FEM with coarse initial mesh guarantees optimal convergence rates for compactly perturbed elliptic problems
• Dörfler marking with minimal cardinality is a linear complexity problem
• Rate optimal adaptive FEM with inexact solver for nonlinear operators
• 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
• MooAFEM: An object oriented Matlab code for higher-order adaptive FEM for (nonlinear) elliptic PDEs
• Goal-oriented adaptive finite element method for semilinear elliptic PDEs

Cited by in corpus (2)

• Cost-optimal adaptive FEM with linearization and algebraic solver for semilinear elliptic PDEs
• A short perspective on a posteriori error control and adaptive discretizations