pith. sign in

arxiv: 2605.20057 · v2 · pith:JTYUBOOZnew · submitted 2026-05-19 · 🧮 math.NA · cs.NA

Quasi-optimal complexity of iterative Galerkin methods driven by an elliptic reconstruction error estimator

Maximilian Brunner , Gregor Gantner , Christoph Lietz , Dirk Praetorius This is my paper

Pith reviewed 2026-05-25 06:11 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords adaptive finite element methodquasilinear elliptic problema posteriori error estimatorZarantonello iterationGalerkin methodconvergence analysiscomputational complexity
0
0 comments X

The pith

An elliptic reconstruction estimator separates linearization and discretization errors to prove unconditional R-linear convergence and quasi-optimal complexity for adaptive iterative Galerkin methods on quasilinear elliptic problems.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies iterative Galerkin methods for quasilinear elliptic problems where the discrete nonlinear systems are solved by damped Zarantonello iteration and mesh refinement is driven by an elliptic reconstruction error estimator. It proves that a combined quasi-error measuring both linearization and discretization errors converges unconditionally with full R-linear rate. For sufficiently small adaptivity parameters the analysis further yields optimal algebraic rates in the number of degrees of freedom together with quasi-optimal rates measured against total computational work.

Core claim

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.

What carries the argument

The elliptic reconstruction error estimator, which produces a posteriori bounds that keep linearization and discretization error contributions well separated.

If this is right

  • The full algorithm converges linearly for any initial mesh and any starting iterate.
  • Optimal algebraic rates hold simultaneously in the number of degrees of freedom once the adaptivity parameters are small enough.
  • The total computational cost grows at the same rate as the number of degrees of freedom.
  • The separation property of the elliptic reconstruction estimator is the sole ingredient needed for the unconditional linear convergence result.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same estimator-driven separation might be reused for other linearization schemes such as Newton-type iterations on the same class of problems.
  • Quasi-optimal complexity would imply that the method remains competitive with direct nonlinear solvers even when the number of degrees of freedom becomes large.
  • The analysis framework could be tested on three-dimensional problems or on problems with stronger nonlinearities to check whether the small-parameter restriction remains practical.

Load-bearing premise

The elliptic reconstruction estimator keeps the a posteriori bounds for linearization error and discretization error cleanly separated, and the adaptivity parameters can be chosen small enough without stopping the algorithm.

What would settle it

Numerical runs in which the combined quasi-error fails to decrease at a uniform linear rate independent of the initial mesh and iteration count, or in which the observed rate with respect to total work is strictly worse than the rate with respect to degrees of freedom.

Figures

Figures reproduced from arXiv: 2605.20057 by Christoph Lietz, Dirk Praetorius, Gregor Gantner, Maximilian Brunner.

Figure 1
Figure 1. Figure 1: Mesh-size functions hℓ , given by hℓ |T = |T| 1/2 for all T ∈ Tℓ , for the level ℓ = 15 mesh generated by Algorithm A for Benchmark 1. Refinement is steered either by the ζℓ(u k−1 ℓ ; z k ℓ ) from (16) (left) or by the standard estimator ηℓ(u k ℓ ) from (10) (right). The color bar applies to both plots. The parameters are set to u 0 0 = 0, θ = 0.5, Cmark = 1, λ = 0.1, δ = (1 − 2e −3/2 )/4, and p = 1. 101 1… view at source ↗
Figure 2
Figure 2. Figure 2: Convergence history (left) and number of linearization iterations (right) of Algorithm A over the number of degrees of freedom for Benchmark 1. The algorithm is steered by either the reconstruction estimator ζℓ(u k−1 ℓ ; z k ℓ ) from (16) (triangle) or by the standard estimator ηℓ(u k ℓ ) from (10) (circle). Solid markers correspond to the bulk parameter θ = 0.5 (adaptive mesh refinement), hol￾low markers … view at source ↗
Figure 3
Figure 3. Figure 3: Convergence history of the computable quasi-error Zek ℓ from (29) of Algorithm A for polynomial degrees p = 2 (square) and p = 4 (diamond) for Benchmark 1. Solid markers correspond to the bulk parameter θ = 0.5 (adaptive mesh refinement), hollow markers to θ = 1 (uniform mesh refinement). The parameters are set to u 0 0 = 0, Cmark = 1, λ = 0.1, and δ = (1 − 2e −3/2 )/4. Finally, although stability (A1) and… view at source ↗
Figure 4
Figure 4. Figure 4: Convergence history (left) of the error ∥∇( ⋆ u − u k ℓ )∥L2(Ω) and the number of linearization iterations (right) for the scalar products aH1 (· , ·) (circle), aµ(· , ·) (triangle), and a(ℓ,k) (· , ·) (square) for Benchmark 2. The parameters are set to u 0 0 = 0, θ = 0.5, Cmark = 1, λ = 0.1, δ = 1.5, and p = 1. convergence rates for aH1 (· , ·) with δ = 1.5 when a smaller value of λ is used. Overall, the … view at source ↗
read the original abstract

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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript analyzes an iterative Galerkin method for quasilinear elliptic problems in the Browder-Minty setting. Linearization is performed via a damped Zarantonello iteration, and adaptive mesh refinement is driven by an elliptic reconstruction error estimator that separates the a posteriori bounds for linearization and discretization errors. The central claims are unconditional R-linear convergence of a combined quasi-error and, for sufficiently small adaptivity parameters, optimal convergence rates with respect to the number of degrees of freedom together with quasi-optimal complexity with respect to overall computational cost. Numerical experiments are included to support the theory.

Significance. If the stated proofs hold, the work supplies the first comprehensive convergence analysis of this adaptive iterative Galerkin algorithm. The unconditional R-linear convergence of the quasi-error (without mesh-size restrictions or explicit smallness assumptions on the nonlinearity) and the subsequent quasi-optimal complexity result constitute a meaningful advance for adaptive methods applied to nonlinear elliptic problems. The separation property of the elliptic reconstruction estimator is a natural and technically useful feature of the approach.

minor comments (2)
  1. [§3] The definition of the quasi-error (presumably in §3 or §4) should be stated explicitly before the contraction argument is invoked, to improve readability for readers who skip the preliminaries.
  2. [§5] In the complexity analysis, the dependence of the hidden constants on the smallness parameter for the adaptivity thresholds could be made more explicit, even if the smallness itself is only required to be positive.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive report, the recognition of the separation property of the elliptic reconstruction estimator, and the recommendation to accept the manuscript. The comments confirm the novelty of the unconditional R-linear convergence of the quasi-error and the quasi-optimal complexity result.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper establishes unconditional R-linear convergence of a quasi-error combining linearization and discretization errors via a contraction argument for the iterative Galerkin method, followed by a standard marking strategy for optimal rates and quasi-optimal complexity when adaptivity parameters are small. These steps rely on a posteriori bounds separated by the elliptic reconstruction estimator and standard techniques in adaptive finite element analysis; no step reduces by construction to a fitted input, self-definition, or load-bearing self-citation chain. The central claims are independent of the target results and rest on external mathematical facts about Browder-Minty operators and elliptic reconstruction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The analysis rests on the Browder-Minty framework for quasilinear elliptic problems and standard assumptions from a posteriori error estimation theory; no free parameters or new entities are introduced in the abstract.

axioms (2)
  • domain assumption The problem satisfies the Browder-Minty conditions allowing monotone operator theory to apply.
    Stated in the abstract as the setting for the quasilinear elliptic problems.
  • domain assumption The elliptic reconstruction error estimator produces well-separated a posteriori bounds for linearization and discretization errors.
    Explicitly invoked to justify the separation used in the convergence analysis.

pith-pipeline@v0.9.0 · 5677 in / 1432 out tokens · 37685 ms · 2026-05-25T06:11:46.290642+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

8 extracted references · 8 canonical work pages

  1. [1]

    Preprint

    arXiv:2512.19357. Preprint. [BDD04] P. Binev, W. Dahmen, and R. DeVore. Adaptive finite element methods with convergence rates.Numer. Math., 97(2):219–268,

    work page arXiv

  2. [2]

    [BHP17] A

    Code Ocean capsule for the reproduction of the numerical results in this article, available under DOI: 10.24433/CO.5206599.v1. [BHP17] A. Bespalov, A. Haberl, and D. Praetorius. Adaptive FEM with coarse initial mesh guarantees optimal convergence rates for compactly perturbed elliptic problems. Comput. Methods Appl. Mech. Engrg., 317:318–340,

    work page doi:10.24433/co.5206599.v1

  3. [3]

    Preprint

    arXiv: 2601.20677. Preprint. [BPS25] M. Brunner, D. Praetorius, and J. Streitberger. Cost-optimal adaptive FEM with linearization and algebraic solver for semilinear elliptic PDEs. Numer. Math., 157(2):409–445,

    work page arXiv

  4. [4]

    Gantner, A

    [GHPS21] G. Gantner, A. Haberl, D. Praetorius, and S. Schimanko. Rate optimality of adaptive finite element methods with respect to overall computational costs.Math. Comp., 90(331):2011–2040,

    work page 2011

  5. [5]

    May 25, 2026 19 [Hei23] P. Heid. A short note on an adaptive damped Newton method for strongly monotone and Lipschitz continuous operator equations.Arch. Math. (Basel), 121(1):55–65,

    work page 2026

  6. [6]

    Mitra and M

    [MV23] K. Mitra and M. Vohralík. Guaranteed, locally efficient, and robust a posteriori estimates for nonlinear elliptic problems in iteration-dependent norms. An orthogonal decomposition result based on iterative linearization, 2023.url: https://inria. hal.science/hal-04156711. Preprint. [PP20] C.-M. Pfeiler and D. Praetorius. Dörfler marking with minima...

    work page 2023

  7. [7]

    (74) May 25, 2026 20 Then, F : Rd → Rd, F (ξ) := µ(|ξ|2)ξ satisfies eα |ξ − χ|2 ≤ F (ξ) − F (χ) · (ξ − χ) and |F (ξ) − F (χ)| ≤ eL |ξ − χ| for all ξ, χ ∈ Rd

    Let µ: [0, +∞) → [0, +∞) satisfy, for constants0 <eα ≤eL, the growth condition eα (t − s) ≤ µ(t2)t − µ(s2)s ≤eL (t − s) for all 0 ≤ s ≤ t. (74) May 25, 2026 20 Then, F : Rd → Rd, F (ξ) := µ(|ξ|2)ξ satisfies eα |ξ − χ|2 ≤ F (ξ) − F (χ) · (ξ − χ) and |F (ξ) − F (χ)| ≤ eL |ξ − χ| for all ξ, χ ∈ Rd. (75) Consequently, the induced PDE operatorA: H1 0(Ω) → H −1...

    work page 2026

  8. [8]

    Thus, F is Lipschitz continuous with constanteL

    Using the identity |σ − ρ|2 = 2 − 2σ · ρ (77) together with (76), it follows that |F (ξ) − F (χ)|2 = |g(s)σ − g(t)ρ|2 = g(s)2 − 2g(s)g(t)σ · ρ + g(t)2 (77) = |g(s) − g(t)|2 + g(s)g(t)|σ − ρ|2 (76) ≤ eL2 |s − t|2 + st|σ − ρ|2 (77) = eL2|sσ − tρ|2 =eL2|ξ − χ|2. Thus, F is Lipschitz continuous with constanteL. The estimates for A follow from (75) by integrat...

    work page 2026