pith. sign in

arxiv: 1906.11436 · v1 · pith:PM5WVKIEnew · submitted 2019-06-27 · 🧮 math.NA · cs.NA

Adaptive First-Order System Least-Squares Finite Element Methods for Second Order Elliptic Equations in Non-Divergence Form

Pith reviewed 2026-05-25 14:58 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords least-squares finite element methodnon-divergence formadaptive finite elementa posteriori error estimateelliptic partial differential equationfirst-order systemC0 finite elementsweighted least-squares
0
0 comments X

The pith

First-order least-squares finite element methods solve second-order elliptic equations in non-divergence form with optimal a priori and a posteriori error estimates using standard C0 elements.

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

The paper recasts a second-order elliptic PDE in non-divergence form as a first-order system by treating the gradient of the unknown as an auxiliary variable. Two least-squares finite element discretizations are then constructed with continuous piecewise linear elements: a basic L2 version and a weighted version that incorporates a mesh-dependent weight. Under the sole assumption that the PDE admits a unique solution, both versions are shown to deliver optimal convergence rates together with reliable a posteriori error indicators that support adaptive mesh refinement. An additional but weaker regularity condition on the differential operator further guarantees convergence of the weighted method in standard norms, and L2 error bounds are derived for each formulation.

Core claim

By introducing the gradient as a new variable, the non-divergence equation becomes a first-order system whose least-squares weak form is stable without integration by parts. The resulting L2-LSFEM and weighted-LSFEM, both using simple C0 linear elements, admit optimal a priori and a posteriori error estimates whenever the original PDE has a unique solution. The weighted formulation additionally converges in standard norms under a regularity assumption weaker than the usual one, while L2-error estimates hold for both methods.

What carries the argument

First-order least-squares formulation of the non-divergence elliptic equation obtained by introducing the gradient of the solution as an auxiliary unknown, yielding a stable weak form discretized by C0 finite elements.

If this is right

  • Built-in a posteriori estimators drive reliable adaptive mesh refinement for both smooth and singular solutions.
  • Optimal convergence holds for problems whose coefficients may be non-smooth or even degenerate.
  • L2-error estimates are available for the solution and its gradient in both the L2-LSFEM and weighted-LSFEM.
  • The weighted method recovers standard-norm convergence rates once a mild operator-regularity condition is met.

Where Pith is reading between the lines

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

  • The same first-order reformulation may apply directly to other equations lacking divergence structure, such as certain linear transport or obstacle problems.
  • The weaker regularity hypothesis broadens the range of admissible coefficients beyond those required by classical variational approaches.
  • Adaptive refinement guided by the least-squares residuals could reduce degrees of freedom needed for high-dimensional or geometrically complex domains.
  • Avoidance of integration by parts removes the need for specialized nonconforming or discontinuous Galerkin spaces commonly used for non-divergence problems.

Load-bearing premise

The partial differential equation has a unique solution.

What would settle it

A concrete non-divergence elliptic problem that lacks a unique solution, for which the computed error indicators or observed convergence rates violate the stated optimal bounds.

read the original abstract

This paper studies adaptive first-order least-squares finite element methods for second-order elliptic partial differential equations in non-divergence form. Unlike the classical finite element method which uses weak formulations of PDEs not applicable for the non-divergence equation, the first-order least-squares formulations naturally have stable weak forms without using integration by parts, allow simple finite element approximation spaces, and have build-in a posteriori error estimators for adaptive mesh refinements. The non-divergence equation is first written as a system of first-order equations by introducing the gradient as a new variable. Then two versions of least-squares finite element methods using simple $C^0$ finite elements are developed in the paper, one is the $L^2$-LSFEM which uses linear elements, the other is the weighted-LSFEM with a mesh-dependent weight to ensure the optimal convergence. Under a very mild assumption that the PDE has a unique solution, optimal a priori and a posteriori error estimates are proved. With an extra assumption on the operator regularity which is weaker than traditionally assumed, convergences in standard norms for the weighted-LSFEM are also discussed. $L^2$-error estimates are derived for both formulations. We perform extensive numerical experiments for smooth, non-smooth, and even degenerate coefficients on smooth and singular solutions to test the accuracy and efficiency of the proposed methods.

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

1 major / 3 minor

Summary. The manuscript develops adaptive first-order system least-squares finite element methods for second-order elliptic PDEs in non-divergence form. The PDE is rewritten as a first-order system by introducing the gradient variable. Two methods are proposed: an L²-LSFEM using linear C⁰ elements and a weighted-LSFEM with mesh-dependent weighting. Under the assumption that the continuous problem has a unique solution, optimal a priori and a posteriori error estimates are proved for both; an additional (weaker-than-usual) regularity assumption on the operator is used to obtain convergence in standard norms for the weighted variant. L²-error estimates are also derived, and numerical experiments are reported for smooth/non-smooth/degenerate coefficients on smooth and singular solutions.

Significance. If the error estimates are rigorously established under only the uniqueness assumption, the work would be a useful contribution to the numerical treatment of non-divergence-form elliptic problems, for which standard weak formulations are unavailable. The built-in a posteriori estimators, use of simple C⁰ spaces, and reported performance on degenerate coefficients are practical strengths. The derivation of L² estimates for both formulations adds value if the analysis is complete.

major comments (1)
  1. [Sections 3–4] Sections 3–4 (proofs of a priori/a posteriori estimates): the central claim is that uniqueness of the continuous solution alone yields optimal estimates for both LSFEM variants. For first-order system least-squares methods the least-squares functional must be shown coercive and continuous in the chosen norm with constants independent of the mesh and of the coefficient A(x). It is not evident whether the uniqueness hypothesis supplies a positive lower bound on the discrete inf-sup constant without further control on the ellipticity of A or on the specific structure of the first-order system; if the proofs derive coercivity solely from uniqueness, an explicit lemma or counter-example check would be required to support the claim.
minor comments (3)
  1. [Abstract, §1] Abstract and §1: the first-order system obtained by introducing the gradient variable should be written explicitly with an equation number so that the subsequent least-squares functionals can be referenced directly.
  2. [Numerical experiments] Numerical experiments section: while the abstract states that extensive tests were performed, the manuscript summary provides no tables, convergence rates, or efficiency metrics; inclusion of representative data (e.g., observed orders for the weighted method on degenerate coefficients) would allow readers to assess the practical performance.
  3. [§2] Notation: the precise definition of the mesh-dependent weight in the weighted-LSFEM and its dependence on the local mesh size should be stated once, with a clear reference when the weighted norm is introduced.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. Below we address the major comment point by point.

read point-by-point responses
  1. Referee: [Sections 3–4] Sections 3–4 (proofs of a priori/a posteriori estimates): the central claim is that uniqueness of the continuous solution alone yields optimal estimates for both LSFEM variants. For first-order system least-squares methods the least-squares functional must be shown coercive and continuous in the chosen norm with constants independent of the mesh and of the coefficient A(x). It is not evident whether the uniqueness hypothesis supplies a positive lower bound on the discrete inf-sup constant without further control on the ellipticity of A or on the specific structure of the first-order system; if the proofs derive coercivity solely from uniqueness, an explicit lemma or counter-example check would be required to support the claim.

    Authors: We appreciate the referee drawing attention to the role of the uniqueness assumption. In Sections 3 and 4 the coercivity of the least-squares functional (both standard L2 and mesh-weighted) is established precisely by using uniqueness of the continuous first-order system: if the functional vanishes then the pair (u, gradient) satisfies the homogeneous problem and must therefore be zero. The mesh-independent lower bound then follows from a standard compactness argument (weak convergence plus uniqueness implies strong convergence to zero). The resulting constant is independent of the mesh size h but does depend on the fixed coefficient A through the uniqueness hypothesis; this is the natural setting for a given PDE. The discrete inf-sup stability follows directly from the continuous coercivity together with the approximation properties of the C0 linear elements. To make the argument fully transparent we will insert an explicit lemma (new Lemma 3.1 or equivalent) that isolates the passage from uniqueness to coercivity/continuity, including a brief remark on the dependence on A. This revision will also cover the a-posteriori estimator equivalence. We believe the added lemma fully addresses the concern while preserving the paper’s stated hypotheses. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained

full rationale

The paper derives a priori and a posteriori error estimates for L2-LSFEM and weighted-LSFEM formulations of the non-divergence elliptic problem by rewriting it as a first-order system and applying standard least-squares analysis. The central assumption (unique continuous solution) is used to establish coercivity and continuity of the least-squares functional with respect to the chosen norms; the proofs proceed via standard functional-analytic arguments rather than reducing any estimate to a fitted quantity or self-referential definition. No load-bearing step collapses by construction to its inputs, no self-citation chains are invoked to force uniqueness or coercivity, and the weighted-norm convergence discussion relies on an additional regularity assumption that is independent of the target result. The analysis is therefore self-contained against external benchmarks of FEM theory.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on the domain assumption of unique solvability plus standard background results from finite-element theory; no free parameters or invented entities are introduced in the abstract.

axioms (1)
  • domain assumption The PDE has a unique solution
    Invoked explicitly as the mild assumption under which all optimal error estimates hold.

pith-pipeline@v0.9.0 · 5778 in / 1255 out tokens · 44347 ms · 2026-05-25T14:58:55.089298+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Adaptive Flux-Only Least-Squares Finite Element Methods for Linear Transport Equations

    math.NA 2019-07 unverdicted novelty 6.0

    Two flux-only LSFEMs for linear transport equations are proposed, with existence/uniqueness proofs, a priori/a posteriori error estimates, and adaptive refinement for improved discontinuity handling.

Reference graph

Works this paper leans on

32 extracted references · 32 canonical work pages · cited by 1 Pith paper · 1 internal anchor

  1. [1]

    A. K. Aziz, R. B. Kellogg, and A. B. Stephens , Least squares methods for elliptic systems , Math. Comput., 44(169), 1985, 53–70

  2. [2]

    Berndt, T

    M. Berndt, T. Manteuffel, and S. McCormick , Local error estimates and adaptive refine- ment for first order system least squares , ETNA, 6 (1997), pp. 35–43

  3. [3]

    Bochev and M

    P. Bochev and M. Gunzburger , Least-Squares Finite Element Methods, Springer, 2009

  4. [4]

    Boffi, F

    D. Boffi, F. Brezzi, and M. Fortin , Mixed Finite Element Methods and Applications , Springer Series in Computational Mathematics, 44, Springer, 2013. 28 W. QIU AND S. ZHANG (a) H¨ older continuous coefficientA5 (b) Uniformly continuous coefficient A6 (c) Discontinuous coefficient A7 (d) A refined mesh when||∇(u− uh)||0≤ 0.01, N = 271, A5 Fig. 9 . Convergence hi...

  5. [5]

    J. H. Bramble, R. D. Lazarov, and J. E. Pasciak , A least-squares approach based on a discrete minus one inner product for first order system , Math. Comp., 66 (1997), pp. 935–955

  6. [6]

    S. C. Brenner, T. Gudi, and L. Sung , An a posteriori error estimator for a quadratic C0- interior penalty method for the biharmonic problem , IMA J. Numer. Anal. 30 (3) (2010) 777–798

  7. [7]

    He, and S

    Z Cai, C. He, and S. Zhang , Improved ZZ a posteriori error estimators for diffusion problems: conforming linear elements , Computer Methods in Applied Mechanics and Engineering 313, 433-449,2017

  8. [8]

    Z. Cai, R. F algout, and S. Zhang , Div first-order system LL*(FOSLL*) for second-order elliptic partial differential equations , SIAM J. Numer. Anal., 53 (1), 405–420, 2015

  9. [9]

    Z. Cai, R. Lazarov, T. A. Manteuffel, and S. F. McCormick , First-order system least squares for second-order partial differential equations: Part I , SIAM J. Numer. Anal., 31 (1994), pp. 1785–1799

  10. [10]

    Z. Cai, T. A. Manteuffel, and S. F. McCormick , First-order system least squares for second-order partial differential equations: Part II , SIAM J. Numer. Anal., 34 (1997), pp. 425–454

  11. [11]

    Cai and J

    Z. Cai and J. Ku , The L2 norm error estimates for the div least-squares method , SIAM J. Numer. Anal., 44 (2006), pp. 1721–1734

  12. [12]

    Cai and S

    Z. Cai and S. Zhang , Recovery-based error estimator for interface problems: Conforming linear elements, SIAM J. Numer. Anal 47 (3), 2132-2156, 2009

  13. [13]

    Cai and S

    Z. Cai and S. Zhang , Flux recovery and a posteriori error estimators: conforming elements for scalar elliptic equations , SIAM J. Numer. Anal 48 (2), 578–602, 2010

  14. [14]

    Chen and W

    H. Chen and W. Qiu , A first order system least squares method for the Helmholtz equation , Journal of Computational and Applied Mathematics, 309, 2017, 145-162

  15. [15]

    P. G. Ciarlet , The Finite Element Method for Elliptic Problems , North-Holland, Amsterdam, 1978. ADAPTIVE LSFEMS FOR ELLIPTIC EQUATIONS IN NON-DIVERGENCE FORM 29 (a) H¨ older continuous coefficientA5 (b) Uniformly continuous coefficient A6 (c) Discontinuous coefficient A7 (d) A refined mesh when||∇(u− uh)||0≤ 0.01, N = 50, A5 Fig. 10 . Convergence histories for...

  16. [16]

    Chiarenza, M

    F. Chiarenza, M. Frasca, and P. Longo , W p,2-solvability of the Dirichlet problem for non- divergence elliptic equations with VMO coefficients , Trans. Amer. Math. Soc., 336(2):841– 853, 1993

  17. [17]

    Dupont, P

    J.Douglas, Jr., T. Dupont, P. Percell, and R. Scott , A family of C1 finite element with optimal approximation properties for various Galerkin methods for 2nd and 4th order problems, RAIRO Anal. Numer. 13, 3 (1979), 227–255

  18. [18]

    X. Feng, L. Hennings, and M Neilan , Finite element methods for second order linear elliptic partial differential equations in non-divergence form , Math. Comp. 86 (307) (2017) 2025– 2051

  19. [19]

    X. Feng, M. Neilan, and S. Stephan , Interior penalty discontinuous Galerkin methods for second order linear non-divergence form elliptic PDEs , J. Sci. Comput. 74 (3) (2018) 1651–1676

  20. [20]

    Gallistl , Variational formulation and numerical analysis of linear elliptic equations in nondivergence form with Cordes coefficients , SIAM J

    D. Gallistl , Variational formulation and numerical analysis of linear elliptic equations in nondivergence form with Cordes coefficients , SIAM J. Numer. Anal. 55 (2) (2017) 737– 757

  21. [21]

    E. H. Georgoulis, P. Houston, and J. Virtanen , An a posteriori error indicator for discon- tinuous Galerkin approximations of fourth-order elliptic problems , IMA J. Numer. Anal. 31 (1) (2011) 281–298

  22. [22]

    Girault and P.-A

    V. Girault and P.-A. Raviart , Finite Element Methods for Navier-Stokes Equations. Theory and Algorithms, Springer, 1986

  23. [23]

    Gilbarg and N

    D. Gilbarg and N. S. Trudinger , Elliptic Partial Differential Equations of Second Order , in: Classics in Mathematics, Springer, 2001

  24. [24]

    Ku , A remark on the coercivity for a first-order least-squares method , Numer

    J. Ku , A remark on the coercivity for a first-order least-squares method , Numer. Method for PDE., 23:6(2007), 1577-1581

  25. [25]

    Adaptive Least-Squares Finite Element Methods for Linear Transport Equations Based on an H(div) Flux Reformulation

    Q. Liu and S. Zhang , Adaptive least-squares finite element methods for linear transport equa- tions based on an H(div) flux reformulation , Arxiv:1807.01524, 2018

  26. [26]

    Maugeri, D

    A. Maugeri, D. K. Palagachev, and L. G. Softova , Elliptic and Parabolic Equations with 30 W. QIU AND S. ZHANG Discontinuous Coefficients , volume 109 of Mathematical Research. Wiley-VCH Verlag, 2000

  27. [27]

    Mu and X

    L. Mu and X. Ye , A simple finite element method for non-divergence form elliptic equations , Int. J. Numer. Anal. Model. 14 (2) (2017) 306–311

  28. [28]

    Neilan , Convergence analysis of a finite element method for second order non-variational elliptic problems, J

    M. Neilan , Convergence analysis of a finite element method for second order non-variational elliptic problems, J. Numer. Math. 25 (3) (2017) 169–184

  29. [29]

    Neilan and M

    M. Neilan and M. Wu , Discrete Miranda–Talenti estimates and applications to linear and nonlinear PDEs, Journal of Computational and Applied Mathematics, 356 (2019) 358–376

  30. [30]

    R. H. Nochetto and W. Zhang , Discrete ABP estimate and convergence rates for linear elliptic equations in non-divergence form , Found. Comput. Math. 18 (3) (2018) 537-593

  31. [31]

    Smears and E

    I. Smears and E. S ¨uli, Discontinuous Galerkin finite element approximation of nondivergence form elliptic equations with Cordes coefficients , SIAM J. Numer. Anal. 51 (2013), no. 4, 2088–2106

  32. [32]

    W ang and J

    C. W ang and J. W ang, A primal-dual weak Galerkin finite element method for second order elliptic equations in non-divergence form , Math. Comp. 87 (2018) 515–545