We consider an adaptive algorithm from Congreve $\&$ Wihler (JCAM 311, 2017) for strongly monotone operators.
The algorithm steers the local refinement of the FEM triangulation as well as the stopping of the employed nonlinear solver. We prove that the algorithm guaranteesconvergence with optimal algebraic rates. Moreover, we prove that the computational cost is quasi-optimal.
The talk is based on joint work with Gregor Gantner, Alexander Haberl, and Bernhard Stiftner.
Within the CRC this talk is associated to the project(s): B3