Cost-optimal adaptive FEM with linearization and algebraic solver for semilinear elliptic PDEs

Abstract

We consider scalar semilinear elliptic PDEs, where the nonlinearity is strongly monotone, but only locally Lipschitz continuous. To linearize the arising discrete nonlinear problem, we employ a damped Zarantonello iteration, which leads to a linear Poisson-type equation that is symmetric and positive definite. The resulting system is solved by a contractive algebraic solver such as a multigrid method with local smoothing. We formulate a fully adaptive algorithm that equibalances the various error components coming from mesh refinement, iterative linearization, and algebraic solver. We prove that the proposed adaptive iteratively linearized finite element method (AILFEM) guarantees convergence with optimal complexity, where the rates are understood with respect to the overall computational cost (i.e., the computational time). Numerical experiments investigate the involved adaptivity parameters.

References in corpus (5)

• 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
• Cost-optimal adaptive iterative linearized FEM for semilinear elliptic PDEs
• Adaptive FEM with quasi-optimal overall cost for nonsymmetric linear elliptic PDEs
• $hp$-robust multigrid solver on locally refined meshes for FEM discretizations of symmetric elliptic PDEs