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 Picard iterations is uniformly bounded in generic cases, and the overall computational cost is (almost) optimal. Numerical experiments confirm the theoretical results.
CITATION STYLE
Gantner, G., Haberl, A., Praetorius, D., & Stiftner, B. (2018). Rate optimal adaptive FEM with inexact solver for nonlinear operators. IMA Journal of Numerical Analysis, 38(4), 1797–1831. https://doi.org/10.1093/imanum/drx050
Mendeley helps you to discover research relevant for your work.