Hinweis
Dieser Eintrag wurde automatisch aus einem Altsystem migriert. Die Daten wurden nicht überprüft und entsprechen eventuell nicht den Qualitätskriterien des vorliegenden Systems.
Gantner, G., Praetorius, D., & Schimanko, S. (2019). Rate optimal adaptive FEM with inexact solver for nonlinear operators. BI.discrete - Numerical Analysis in Bielefeld, Bielefeld, Germany. http://hdl.handle.net/20.500.12708/122814
We present our recent work [Gantner et al., IMA J Numer Anal 38, 2018], where we prove convergence with optimal algebraic rates for an adaptive finite element method for nonlinear equations with strongly monotone operator. We consider an algorithm proposed by [Congreve et al., J Comp Appl Math 311, 2017]. Unlike prior works, e.g., [Carstensen et al., Comp Math Appl 67, 2014], our analysis also inc...
We present our recent work [Gantner et al., IMA J Numer Anal 38, 2018], where we prove convergence with optimal algebraic rates for an adaptive finite element method for nonlinear equations with strongly monotone operator. We consider an algorithm proposed by [Congreve et al., J Comp Appl Math 311, 2017]. Unlike prior works, e.g., [Carstensen et al., Comp Math Appl 67, 2014], 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. Finally, we aim to discuss that the overall computational cost is optimal. Numerical experiments confirm the theoretical results.
