2 papers
math.NA2026
Quasi-optimal complexity of iterative Galerkin methods driven by an elliptic reconstruction error estimator
Maximilian Brunner, Gregor Gantner, Christoph Lietz +1
We study an iterative Galerkin method for quasilinear elliptic problems in the Browder-Minty setting. The resulting discrete nonlinear systems are solved by linearization via a (da…
math.NA2026
Unconditional full linear convergence and quasi-optimal complexity of smoothed adaptive finite element methods
Philipp Bringmann, Christoph Lietz, Dirk Praetorius
We present the first rigorous convergence analysis of the smoothed adaptive finite element method (S-AFEM) proposed in [Mulita, Giani, Heltai: SIAM J. Sci. Comput. 43, 2021]. S-AFE…