Quasi-optimal complexity of iterative Galerkin methods driven by an elliptic reconstruction error estimator
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911706776600576 |
|---|---|
| author | Brunner, Maximilian Gantner, Gregor Lietz, Christoph Praetorius, Dirk |
| author_facet | Brunner, Maximilian Gantner, Gregor Lietz, Christoph Praetorius, Dirk |
| contents | 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 (damped) Zarantonello iteration. Unlike prior work, adaptive mesh refinement is driven by an elliptic reconstruction error estimator, which is natural in the sense that the a posteriori bounds for the linearization and discretization errors are well separated. For this setting, we present the first comprehensive convergence analysis of the corresponding algorithm. We prove unconditional full R-linear convergence of a suitable quasi-error that combines linearization and discretization errors. For sufficiently small adaptivity parameters, we further establish optimal convergence rates with respect to the number of degrees of freedom and quasi-optimal complexity, i.e., optimal convergence rates with respect to the overall computational cost. Numerical experiments underpin the theoretical findings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_20057 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Quasi-optimal complexity of iterative Galerkin methods driven by an elliptic reconstruction error estimator Brunner, Maximilian Gantner, Gregor Lietz, Christoph Praetorius, Dirk Numerical Analysis 65N30, 65N50, 65N15, 65Y20, 41A25 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 (damped) Zarantonello iteration. Unlike prior work, adaptive mesh refinement is driven by an elliptic reconstruction error estimator, which is natural in the sense that the a posteriori bounds for the linearization and discretization errors are well separated. For this setting, we present the first comprehensive convergence analysis of the corresponding algorithm. We prove unconditional full R-linear convergence of a suitable quasi-error that combines linearization and discretization errors. For sufficiently small adaptivity parameters, we further establish optimal convergence rates with respect to the number of degrees of freedom and quasi-optimal complexity, i.e., optimal convergence rates with respect to the overall computational cost. Numerical experiments underpin the theoretical findings. |
| title | Quasi-optimal complexity of iterative Galerkin methods driven by an elliptic reconstruction error estimator |
| topic | Numerical Analysis 65N30, 65N50, 65N15, 65Y20, 41A25 |
| url | https://arxiv.org/abs/2605.20057 |