pith. sign in

arxiv: 2604.24567 · v1 · submitted 2026-04-27 · 🧮 math.NA · cs.NA

A correction adaptive two-grid finite element method for nonselfadjoint or indefinite elliptic problems

Fei Li , Qingguo Hong , Ming Tang , Liuqiang Zhong This is my paper

Pith reviewed 2026-05-08 02:12 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords adaptive finite elementtwo-grid methodcorrection adaptivenonselfadjoint ellipticindefinite problemsconvergencequasi-errors
0
0 comments X

The pith

Adding a coarse-mesh correction solve allows the adaptive two-grid finite element method to converge for nonselfadjoint or indefinite elliptic problems.

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

The authors develop a correction adaptive two-grid finite element method for elliptic problems that may be nonselfadjoint or indefinite. Unlike previous versions limited to symmetric positive-definite cases, this method includes an extra step solving a small residual problem on the coarse grid. This correction ensures the L2-norm error of the discrete solution is of higher order than its energy-norm error. With that property, the method satisfies a contraction property for summed quasi-errors across successive adaptive meshes, proving convergence. Tests confirm the approach works robustly where the earlier method does not.

Core claim

The central claim is that by solving an additional small-scale discrete residual problem on the coarse mesh, the L2-norm error of the corrected discrete solution becomes a higher-order term compared to the energy-norm error, enabling the proof of a contraction property for the sum of quasi-errors on two successive adaptive meshes and thereby establishing convergence of the adaptive algorithm for nonselfadjoint or indefinite elliptic problems.

What carries the argument

The coarse-mesh correction step solving a small-scale discrete residual problem, which upgrades the L2 error order and supports the contraction argument.

If this is right

  • Convergence of the adaptive method is guaranteed even when the elliptic problem lacks symmetry or positive definiteness.
  • The additional correction incurs only negligible computational cost.
  • The method demonstrates improved effectiveness and robustness in numerical experiments over the prior ATGFEM.
  • The higher-order L2 error property holds after the correction.

Where Pith is reading between the lines

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

  • Similar correction techniques could be adapted for other finite element methods handling non-self-adjoint operators.
  • The approach may facilitate analysis of optimal convergence rates in terms of degrees of freedom.
  • Extensions to higher-dimensional or nonlinear problems might follow from the same error-order elevation.

Load-bearing premise

The additional correction step on the coarse mesh makes the L2-norm error of the corrected solution a higher order of the energy-norm error of the discrete solution.

What would settle it

Numerical computation on a nonselfadjoint problem where the quasi-error sum on two successive meshes does not contract, or where the L2 error after correction is not higher order than the energy error.

Figures

Figures reproduced from arXiv: 2604.24567 by Fei Li, Liuqiang Zhong, Ming Tang, Qingguo Hong.

Figure 1
Figure 1. Figure 1: Convergence history on the energy-norm errors of SAFEM, ATGFEM and CATGFEM with marking parameter view at source ↗
Figure 2
Figure 2. Figure 2: Convergence history on the energy-norm errors of ATGFEM and CATGFEM with di view at source ↗
Figure 3
Figure 3. Figure 3: Performances of the energy-norm errors of tested three adaptive algorithms in Example view at source ↗
Figure 4
Figure 4. Figure 4: Convergence history on the energy-norm errors of CATGFEM with di view at source ↗
Figure 5
Figure 5. Figure 5: Behaviors of the energy-norm errors of tested three adaptive algorithms in Example view at source ↗
Figure 6
Figure 6. Figure 6: Convergence history on the energy-norm errors of CATGFEM with di view at source ↗
read the original abstract

We propose, analyze, and numerically validate a correction adaptive two-grid finite element method (CAT-GFEM) for nonselfadjoint or indefinite elliptic problems. In contrast to the adaptive two-grid finite element method (ATGFEM) of Li and Zhang [SIAM J. Sci. Comput., 43 (2021), pp. A908-A928], which is restricted to symmetric positive-definite problems, the proposed method introduces an additional correction step that solves a small-scale discrete residual problem on the coarse mesh. This step entails negligible additional computational cost and allows us to show that the L2-norm error of the corrected discrete solution is a higher-order of the energy-norm error of the discrete solution. Using this result, we prove a contraction property for a suitable sum of quasi-errors on two successive adaptive meshes and establish convergence of the method. Numerical experiments illustrate the improved effectiveness and robustness of our method in comparison with ATGFEM.

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

2 major / 2 minor

Summary. The manuscript proposes and analyzes a correction adaptive two-grid finite element method (CAT-GFEM) for nonselfadjoint or indefinite elliptic problems. In contrast to prior ATGFEM work limited to symmetric positive-definite cases, the method adds a correction step that solves a small-scale discrete residual problem on the coarse mesh. This yields an L2-norm error for the corrected discrete solution that is higher-order relative to its energy-norm error. The higher-order relation is then used to establish a contraction property for a suitable sum of quasi-errors on successive adaptive meshes, from which convergence of the adaptive algorithm follows. Numerical experiments on model problems illustrate improved robustness and effectiveness over ATGFEM.

Significance. If the central analysis holds, the result meaningfully extends convergent adaptive two-grid methods to a practically important class of problems (nonselfadjoint and indefinite elliptic operators) at essentially no extra computational cost. The contraction argument supplies a theoretical foundation that was previously unavailable, and the numerical tests provide concrete evidence of improved performance. The approach is technically economical and could be adopted in existing adaptive FEM codes.

major comments (2)
  1. [§4.2, Lemma 4.3] §4.2 (Lemma 4.3 and the duality argument for the corrected residual equation): the higher-order L2 estimate is the load-bearing step for the subsequent contraction. For indefinite operators the duality argument requires discrete well-posedness of the coarse-mesh problem; the manuscript should state an explicit mesh-size condition on the initial coarse mesh (or prove that the correction step itself enforces it) rather than leaving it implicit.
  2. [§5, Theorem 5.1] §5 (Theorem 5.1 on the contraction of the quasi-error sum): the proof invokes the higher-order L2 relation uniformly across locally refined meshes. It is not clear whether the dual-problem regularity assumed in the duality argument remains uniform when refinement is concentrated in regions of low solution regularity; an additional remark or auxiliary estimate addressing this point is needed.
minor comments (2)
  1. [§2.2] §2.2: the definition of the quasi-error quantities could be collected in a single displayed equation or table for easier reference when reading the contraction proof.
  2. [Numerical experiments] Numerical section: the comparison tables would be strengthened by reporting the number of degrees of freedom on both coarse and fine meshes at each iteration, not only the final error values.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and the constructive comments, which help strengthen the presentation. We address each major comment point by point below.

read point-by-point responses

  1. Referee: [§4.2, Lemma 4.3] §4.2 (Lemma 4.3 and the duality argument for the corrected residual equation): the higher-order L2 estimate is the load-bearing step for the subsequent contraction. For indefinite operators the duality argument requires discrete well-posedness of the coarse-mesh problem; the manuscript should state an explicit mesh-size condition on the initial coarse mesh (or prove that the correction step itself enforces it) rather than leaving it implicit.

    Authors: We agree that an explicit mesh-size condition is needed to ensure discrete well-posedness for the indefinite case. In the revised manuscript we will add a clear statement in Section 4.2 that the initial coarse mesh is assumed sufficiently fine so that the discrete coarse problem is well-posed; this is a standard hypothesis for indefinite elliptic problems and is independent of the subsequent adaptive refinements. The correction step itself does not enforce the condition, but the assumption guarantees the duality argument applies. revision: yes

  2. Referee: [§5, Theorem 5.1] §5 (Theorem 5.1 on the contraction of the quasi-error sum): the proof invokes the higher-order L2 relation uniformly across locally refined meshes. It is not clear whether the dual-problem regularity assumed in the duality argument remains uniform when refinement is concentrated in regions of low solution regularity; an additional remark or auxiliary estimate addressing this point is needed.

    Authors: The higher-order L2 estimate is obtained via a duality argument applied exclusively to the fixed initial coarse mesh on which the correction step is performed. Because this coarse mesh does not change during the adaptive process, the regularity of the associated dual problem remains uniform regardless of where local refinement occurs on the fine mesh. We will insert a short remark immediately after the statement of Theorem 5.1 clarifying this fact and confirming that the contraction argument is unaffected. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on new correction step and independent analysis.

full rationale

The paper introduces an explicit correction step solving a small residual problem on the coarse mesh, derives a higher-order L2 error bound for the corrected solution relative to its energy-norm error, and then uses that bound to establish a contraction property for quasi-errors on successive adaptive meshes. This chain is self-contained within the new analysis for nonselfadjoint/indefinite operators and does not reduce any claimed prediction or uniqueness result to a fitted parameter, self-definition, or unverified self-citation. The cited prior ATGFEM work (Li-Zhang 2021) applies only to SPD problems and is used for contrast, not as a load-bearing premise for the indefinite-case contraction. No step equates a derived quantity to its own input by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard assumptions from finite element theory for elliptic problems and adaptive refinement; no free parameters or new entities are introduced in the abstract.

axioms (1)
  • domain assumption Elliptic problems admit suitable finite element discretizations and residual estimators that support quasi-error contraction after correction.
    Invoked implicitly to obtain the higher-order L2 relation and the contraction property on successive meshes.

pith-pipeline@v0.9.0 · 5466 in / 1317 out tokens · 62383 ms · 2026-05-08T02:12:13.321936+00:00 · methodology

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

27 extracted references · 27 canonical work pages

  1. [1]

    Abdulle and G

    A. Abdulle and G. Rosilho de Souza. A local adaptive discontinuous Galerkin method for convection- diffusion-reaction equations.J. Comput. Phys., 451:110894, 2022. 20 Figure 6: Convergence history on the energy-norm errors of CATGFEM with different marking parameters underh0 =1/64 in Example 5.3

    work page 2022

  2. [2]

    Ainsworth and J

    M. Ainsworth and J. T. Oden.A posteriori error estimation in finite element analysis. Wiley- Interscience, New York, 2000

    work page 2000

  3. [3]

    Bespalov, A

    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, 2017

    work page 2017

  4. [4]

    C. J. Bi, C. Wang, and Y . P. Lin. A posteriori error estimates of two-grid finite element methods for nonlinear elliptic problems.J. Sci. Comput., 74(1):23–48, 2018

    work page 2018

  5. [5]

    H. X. Chen and X. J. Xu. Local multilevel methods for adaptive finite element methods for nonsym- metric and indefinite elliptic boundary value problems.SIAM J. Numer. Anal., 47(6):4492–4516, 2010

    work page 2010

  6. [6]

    P. G. Ciarlet.The finite element method for elliptic problems. SIAM, Philadelphia, 2002

    work page 2002

  7. [7]

    W. Dörfler. A convergent adaptive algorithm for Poisson’s equation.SIAM J. Numer. Anal., 33(3):1106– 1124, 1996

    work page 1996

  8. [8]

    S. H. Du and X. P. Xie. Convergence of an adaptive mixed finite element method for convection- diffusion-reaction equations.Sci. China Math., 58(6):1327–1348, 2015

    work page 2015

  9. [9]

    Du and H

    Y . Du and H. J. Wu. Preasymptotic error analysis of higher order FEM and CIP-FEM for helmholtz equation with high wave number.SIAM J. Numer. Anal., 53(2):782–804, 2015. 21

    work page 2015

  10. [10]

    S. Y . Duan and H. J. Wu. Adaptive FEM for helmholtz equation with large wavenumber.J. Sci. Comput., 94(1):21, 2023

    work page 2023

  11. [11]

    Feischl, T

    M. Feischl, T. Führer, and D. Praetorius. Adaptive FEM with optimal convergence rates for a certain class of non-symmetric and possibly non-linear problems.SIAM J. Numer. Anal., 52(2):601–625, 2014

    work page 2014

  12. [12]

    Grisvard.Singularities in boundary value problems

    P. Grisvard.Singularities in boundary value problems. Springer-Verlag, Berlin, 1992

    work page 1992

  13. [13]

    Irimie and P

    S. Irimie and P. Bouillard. A residual a posteriori error estimator for the finite element solution of the helmholtz equation.Comput. Methods Appl. Mech. Engrg., 190(31):4027–4042, 2001

    work page 2001

  14. [14]

    Y . K. Li and Y . Zhang. Analysis of adaptive two-grid finite element algorithms for linear and nonlinear problems.SIAM J. Sci. Comput., 43(2):A908–A928, 2021

    work page 2021

  15. [15]

    S. F. McCormick.Multigrid methods. SIAM, Philadelphia, 1987

    work page 1987

  16. [16]

    Mekchay and R

    K. Mekchay and R. H. Nochetto. Convergence of adaptive finite element methods for general second order linear elliptic PDEs.SIAM J. Numer. Anal., 43(5):1803–1827, 2005

    work page 2005

  17. [17]

    W. F. Mitchell. A collection of 2D elliptic problems for testing adaptive grid refinement algorithms. Appl. Math. Comput., 220:350–364, 2013

    work page 2013

  18. [18]

    R. H. Nochetto, K. G. Siebert, and A. Veeser.Theory of adaptive finite element methods: an introduc- tion. Springer, Berlin, 2009

    work page 2009

  19. [19]

    A. H. Schatz. An observation concerning Ritz-Galerkin methods with indefinite bilinear forms.Math. Comp, 28(128):959–962, 1974

    work page 1974

  20. [20]

    A. H. Schatz and J. P. Wang. Some new error estimates for Ritz-Galerkin methods with minimal regu- larity assumptions.Math. Comp., 65(213):19–27, 1996

    work page 1996

  21. [21]

    L. R. Scott and S. Y . Zhang. Finite element interpolation of nonsmooth functions satisfying boundary conditions.Math. Comp., 54(190):483–493, 1990

    work page 1990

  22. [22]

    Stevenson

    R. Stevenson. The completion of locally refined simplicial partitions created by bisection.Math. Comp., 77(261):227–241, 2008

    work page 2008

  23. [23]

    Verfürth.A review of a posteriori error estimation and adaptive mesh-refinement techniques

    R. Verfürth.A review of a posteriori error estimation and adaptive mesh-refinement techniques. Wiley- Teubner, Chichester-Stuttgart, 1996

    work page 1996

  24. [24]

    Verfürth.A posteriori error estimation techniques for finite element methods

    R. Verfürth.A posteriori error estimation techniques for finite element methods. Oxford University Press, Oxford, 2013

    work page 2013

  25. [25]

    J. C. Xu. A new class of iterative methods for nonselfadjoint or indefinite problems.SIAM J. Numer. Anal., 29(2):303–319, 1992

    work page 1992

  26. [26]

    J. C. Xu. Two-grid discretization techniques for linear and nonlinear PDEs.SIAM J. Numer. Anal., 33(5):1759–1777, 1996. 22

    work page 1996

  27. [27]

    L. Q. Zhong, Y . Xuan, and J. T. Cui. Two-grid discontinuous Galerkin method for convection–diffusion– reaction equations.J. Comput. Appl. Math., 404:113903, 2022. 23

    work page 2022