pith. sign in

arxiv: 2606.03276 · v1 · pith:7NGBXWGOnew · submitted 2026-06-02 · 🧮 math.NA · cs.NA

Hessian-recovery-based C0 finite element methods for non-divergence form elliptic equations

Minqiang Xu , Boying Wu , Lei Zhang This is my paper

Pith reviewed 2026-06-28 09:23 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords Hessian recoveryfinite element methodnon-divergence formelliptic equationdiscrete maximum principleC0 elementnodal formulationalgebraic solvability
0
0 comments X

The pith

Replacing the true Hessian with a recovered version lets standard C0 finite elements handle non-divergence elliptic equations.

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

The paper constructs discretizations for second-order elliptic equations written in non-divergence form by substituting a recovered Hessian for the exact second derivatives inside the coefficient matrix operator. This produces nodal, Galerkin, and Petrov-Galerkin schemes on ordinary Lagrange elements. The analysis isolates algebraic conditions on the recovered nodal matrix that guarantee solvability, including a globally monotone regime that delivers a discrete maximum principle together with a uniform inverse bound. Residual consistency estimates derived from the Hessian recovery error then combine with that bound to produce a nodal L-infinity error estimate for the nodal formulation.

Core claim

The recovered Hessian Hhuh is inserted directly into the strong-form operator to approximate A : D2u by A : Hhuh; the resulting recovered nodal matrix admits two verifiable algebraic solvability mechanisms (global monotonicity for a discrete maximum principle, and a localized Schur-complement test for sign-violating rows), and residual consistency estimates from the recovery error combine with the uniform inverse bound to yield a nodal L-error estimate in the globally monotone regime.

What carries the argument

The recovered Hessian Hhuh, which replaces the exact Hessian D2u inside the non-divergence term A : Hhuh.

If this is right

  • Global monotonicity of the recovered nodal matrix produces a discrete maximum principle.
  • A uniform inverse bound holds and supplies a condition-number estimate.
  • Residual consistency estimates from the Hessian recovery error yield a nodal L-error bound for the nodal formulation.
  • The algebraic diagnostics remain usable for problems with nonsmooth or discontinuous coefficients.

Where Pith is reading between the lines

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

  • The localized Schur-complement test could support hybrid schemes that switch formulations only on rows that violate sign conditions.
  • The recovered-Hessian construction might be inserted into Newton iterations for fully nonlinear problems such as the Monge-Ampere equation without changing the underlying mesh or element space.
  • Recovery-error indicators already computed for consistency could serve as a posteriori markers for local mesh refinement.

Load-bearing premise

The recovered Hessian must approximate the true Hessian closely enough that the consistency error does not overcome the stability provided by the algebraic solvability conditions.

What would settle it

A numerical test on a problem with known smooth solution in which the recovered nodal matrix remains globally monotone yet the observed nodal L-error fails to converge at the predicted rate when the recovery accuracy is deliberately reduced.

read the original abstract

A Hessian-recovery-based C0 finite element framework is proposed for second-order elliptic equations in non-divergence form. The construction is based on a direct approximation of the strong non-divergence operator: the Hessian D2u is replaced by a recovered Hessian Hhuh, so that A : D2u is approximated by A : Hhuh. The resulting discretizations include a nodal formulation and a Galerkin-type formulation for general Lagrange finite element spaces, as well as a biorthogonal Petrov-Galerkin formulation for linear elements. The analysis focuses on the recovered nodal matrix and identifies two verifiable algebraic solvability mechanisms. The first is a globally monotone regime leading to a discrete maximum principle, and the second is a localized Schur-complement criterion for sign-violating rows. A uniform inverse bound and a condition-number estimate are derived in the globally monotone case. Residual consistency estimates are obtained from the Hessian recovery error. In the globally monotone regime, these estimates combine with the uniform inverse bound to give a nodal L-error estimate for the nodal formulation. Numerical experiments with nonsmooth and discontinuous coefficients support the predicted algebraic diagnostics and show the accuracy of the proposed recovered-residual discretizations. A Monge-Ampere type test further illustrates the use of the recovered Hessian in a Newton iteration for a fully nonlinear problem.

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 / 3 minor

Summary. The manuscript proposes a Hessian-recovery-based C0 finite element framework for second-order elliptic equations in non-divergence form. The strong operator A : D²u is discretized by replacing D²u with a recovered Hessian H_h u_h, yielding a nodal formulation, a Galerkin-type formulation, and a biorthogonal Petrov-Galerkin formulation. The analysis identifies two algebraic solvability mechanisms for the recovered nodal matrix (global monotonicity yielding a discrete maximum principle, and a localized Schur-complement criterion), derives a uniform inverse bound and condition-number estimate in the monotone regime, obtains residual consistency estimates from the Hessian recovery error, and combines these to prove a nodal L^∞ error estimate. Numerical experiments with nonsmooth/discontinuous coefficients and a Monge-Ampère test are presented to support the algebraic diagnostics and accuracy.

Significance. If the algebraic conditions and error estimates hold, the work supplies a practical C0-element approach to non-divergence problems that are otherwise difficult for standard Galerkin methods; the verifiable algebraic solvability criteria and the explicit linkage of recovery error to consistency are genuine strengths. The stress-test concern (recovered Hessian error destroying stability) does not manifest as an internal inconsistency in the stated logic.

minor comments (3)
  1. [Abstract] The abstract states that residual consistency estimates combine with the uniform inverse bound to give the nodal L^∞ error estimate, but the dependence of the final constant on the recovery error norm is not made explicit; a short remark clarifying this dependence would strengthen the claim.
  2. Notation for the recovered Hessian (denoted H_h u_h) and the precise definition of the recovery operator are introduced without a forward reference to the section containing the construction; adding such a pointer would improve readability.
  3. The numerical section claims support for the predicted algebraic diagnostics, yet the tables or figures reporting the monotonicity indicators or Schur-complement signs are not cross-referenced in the text; explicit pointers would aid verification.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary and recommendation of minor revision. No major comments were listed in the report, so we have no specific points to address point-by-point. We will incorporate any minor editorial suggestions in the revised version.

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper's central estimates combine Hessian recovery error bounds with algebraic stability (global monotonicity, uniform inverse bound, Schur complement) to obtain the nodal L-error estimate. These steps rely on standard approximation theory and matrix properties rather than self-definition, fitted inputs renamed as predictions, or load-bearing self-citations. The abstract and reader's assessment confirm the logic is self-contained against external benchmarks with no reduction of outputs to inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract-only review supplies no explicit free parameters, invented entities, or non-standard axioms; the framework relies on standard finite-element approximation properties and the existence of a recovery operator whose error is assumed controllable.

axioms (1)
  • domain assumption Existence of a Hessian recovery operator whose error can be bounded independently of the solution regularity in the regimes considered
    Invoked when residual consistency estimates are combined with the inverse bound to obtain the L-error estimate.

pith-pipeline@v0.9.1-grok · 5770 in / 1272 out tokens · 27670 ms · 2026-06-28T09:23:00.984159+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

25 extracted references

  1. [1]

    Barles and P

    G. Barles and P. E. Souganidis, Convergence of approximation schemes for fully nonlinear second order equations,Asymptotic Analysis, 4 (1991), 271–283

    1991

  2. [2]

    J. F. Bonnans and H. Zidani, Consistency of generalized finite difference schemes for the stochastic HJB equation,SIAM Journal on Numerical Analysis, 41 (2003), 1008–1021

    2003

  3. [3]

    L. A. Caffarelli and X. Cabr´ e,Fully Nonlinear Elliptic Equations, American Mathematical Society, Providence, RI, 1995

    1995

  4. [4]

    H. Chen, X. Feng, and Z. Zhang, A recovery-based linearC 0 finite element method for a fourth-order singularly perturbed Monge–Amp` ere equation,Advances in Computational Mathematics, 47 (2021), Article 21

    2021

  5. [5]

    T. Chu, H. Guo, and Z. Zhang, Recovery based linear finite element methods for Hamilton–Jacobi– Bellman equation with Cordes coefficients,SIAM Journal on Numerical Analysis, 63 (2025), 23–53

    2025

  6. [6]

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

    2017

  7. [7]

    B. D. Froese and A. M. Oberman, Convergent finite difference solvers for viscosity solutions of the elliptic Monge–Amp` ere equation in dimensions two and higher,SIAM Journal on Numerical Analysis, 49 (2011), 1692–1714

    2011

  8. [8]

    D. Gallistl, Variational formulation and numerical analysis of linear elliptic equations in nondivergence form with Cordes coefficients,SIAM Journal on Numerical Analysis, 55 (2017), 737–757

    2017

  9. [9]

    H. Guo, Z. Zhang, and Q. Zou, AC 0 linear finite element method for biharmonic problems,Journal of Scientific Computing, 74 (2018), 1397–1422

    2018

  10. [10]

    H. Guo, Z. Zhang, and R. Zhao, Hessian recovery for finite element methods,Mathematics of Compu- tation, 86 (2017), 1671–1692

    2017

  11. [11]

    E. L. Kawecki, A DGFEM for nondivergence form elliptic equations with Cordes coefficients on curved domains,Numerical Methods for Partial Differential Equations, 35 (2019), 1717–1744

    2019

  12. [12]

    Lakkis and A

    O. Lakkis and A. Mousavi, A least-squares Galerkin approach to gradient and Hessian recovery for nondivergence-form elliptic equations,IMA Journal of Numerical Analysis, 42 (2022), 2151–2189

    2022

  13. [13]

    Lakkis and T

    O. Lakkis and T. Pryer, A finite element method for second order nonvariational elliptic problems, SIAM Journal on Scientific Computing, 33 (2011), 786–801

    2011

  14. [14]

    Lakkis and T

    O. Lakkis and T. Pryer, A finite element method for nonlinear elliptic problems,SIAM Journal on Scientific Computing, 35 (2013), A2025–A2045

    2013

  15. [15]

    Naga and Z

    A. Naga and Z. Zhang, The polynomial-preserving recovery for higher order finite element methods in 2D and 3D,Discrete and Continuous Dynamical Systems–Series B, 5 (2005), 769–798. M. Xu, B. Wu, and L. Zhang 25

    2005

  16. [16]

    R. H. Nochetto and W. Zhang, Discrete ABP estimate and convergence rates for linear elliptic equations in non-divergence form,Foundations of Computational Mathematics, 18 (2018), 537–593

    2018

  17. [17]

    A. M. Oberman, Wide stencil finite difference schemes for the elliptic Monge–Amp` ere equation and functions of the eigenvalues of the Hessian,Discrete and Continuous Dynamical Systems–Series B, 10 (2008), 221–238

    2008

  18. [18]

    Smears and E

    I. Smears and E. S¨ uli, Discontinuous Galerkin finite element approximation of non-divergence form elliptic equations with Cordes coefficients,SIAM Journal on Numerical Analysis, 51 (2013), 2088–2106

    2013

  19. [19]

    Wang and J

    C. Wang and J. Wang, A primal-dual weak Galerkin finite element method for second order elliptic equations in non-divergence form,Mathematics of Computation, 87 (2018), 515–545

    2018

  20. [20]

    M. Xu, H. Guo, and Q. Zou, Hessian recovery based finite element methods for the Cahn–Hilliard equation,Journal of Computational Physics, 386 (2019), 524–540

    2019

  21. [21]

    M. Xu, R. Lin, and Q. Zou, AC 0 linear finite element method for a second-order elliptic equation in non-divergence form with Cordes coefficients,Numerical Methods for Partial Differential Equations, 39 (2023), 2244–2269

    2023

  22. [22]

    M. Xu, L. Zhang, B. Wu, and K. Liu, A novel class of Hessian recovery-based numerical methods for solving biharmonic equations and their applications in phase field modeling,Finite Elements in Analysis and Design, 251 (2025), 104405

    2025

  23. [23]

    Zhang and A

    Z. Zhang and A. Naga, A new finite element gradient recovery method: Superconvergence property, SIAM Journal on Scientific Computing, 26 (2005), 1192–1213

    2005

  24. [24]

    R. Zhao, W. Du, F. Shi, and Y. Cao, Recovery based finite difference scheme on unstructured mesh, Applied Mathematics Letters, 129 (2022), 107935

    2022

  25. [25]

    O. C. Zienkiewicz and J. Z. Zhu, The superconvergent patch recovery and a posteriori error estimates. Part 1: The recovery technique,International Journal for Numerical Methods in Engineering, 33 (1992), 1331–1364

    1992