Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 23 min ago
PreprintCC BY 4.0arXiv

Running error bounds in finite element kernels

Abstract

Rounding errors in finite element computations can lead to a complete loss of accuracy, stalled convergence, and incorrect results. Moreover, the effects of rounding errors accumulated within automatically generated and compiled kernels are difficult to analyze a priori. We present the first software framework for automated rounding error estimation within finite element kernels. The proposed methodology is based on an a posteriori technique called Running Error Analysis (REA), where a forward error estimate is automatically computed concurrently with the value. An open-source implementation is provided for the FEniCS Form Compiler (FFCx), based on a C++ backend for generating type-generic templated kernels over a custom arithmetic type that tracks both the value and its error estimate. We demonstrate REA on two examples. First, we use it to detect catastrophic cancellation in the assembly of a Neo-Hooke hyperelastic model in the small deformation regime. A series expansion circumvents the cancellation problem and the computed error estimates show this. Second, we study the assembly of the Laplace operator on a near-degenerate mesh. We demonstrate that our REA implementation typically incurs only 2-4x performance overhead. Applications of this work include robust reduced-precision computations in embedded systems, numerical debugging of new, possibly ill-conditioned or unstable PDE formulations, and guiding the design of mixed-precision kernels.

Related

  1. Anisotropic error estimates for the L2-projection onto discontinuous finite element spaces
    Joaquín Valenzuela Díaz, Yuan Wang, Sander Rhebergen
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  2. Optimal error estimates of sequential finite element method for nonlinear thermo-poroelasticity problems
    Fan Chen, Changqing Lv, Chenguang Zhou
    arXivPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingarXiv
  3. Finite element error estimates for a bilinear optimal control problem with pointwise tracking governed by a semilinear elliptic PDE
    Enrique Otarola, Daniel Quero, Matias Sasso
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingOptimisation & controlarXiv
  4. Sharp Pointwise Error Estimates of Finite Element Methods for the Biharmonic Equation
    Buyang Li, Zhenglei Li, Qigang Liang +1
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. Sharp Error Estimates for a Fully Discrete Finite Element Method for Semilinear SPDEs with Multiplicative Noise and Nonsmooth Initial Data
    Jitendra Nath Naik, Lok Pati Tripathi
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingProbabilityarXiv
BibTeX
@misc{habera2026running,
  title = {{Running error bounds in finite element kernels}},
  author = {Michal Habera and Paul T. Kühner and Matteo Croci and Andreas Zilian},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.37844},
  eprint = {2609.37844},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.37844},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Running error bounds in finite element kernels
AU  - Michal Habera
AU  - Paul T. Kühner
AU  - Matteo Croci
AU  - Andreas Zilian
PY  - 2026
DA  - 2026/09/29
PB  - arXiv
DO  - 10.48550/arxiv.2609.37844
UR  - https://arxiv.org/abs/2609.37844
AB  - Rounding errors in finite element computations can lead to a complete loss of accuracy, stalled convergence, and incorrect results. Moreover, the effects of rounding errors accumulated within automatically generated and compiled kernels are difficult to analyze a priori. We present the first software framework for automated rounding error estimation within finite element kernels. The proposed methodology is based on an a posteriori technique called Running Error Analysis (REA), where a forward error estimate is automatically computed concurrently with the value. An open-source implementation is provided for the FEniCS Form Compiler (FFCx), based on a C++ backend for generating type-generic templated kernels over a custom arithmetic type that tracks both the value and its error estimate. We demonstrate REA on two examples. First, we use it to detect catastrophic cancellation in the assembly of a Neo-Hooke hyperelastic model in the small deformation regime. A series expansion circumvents the cancellation problem and the computed error estimates show this. Second, we study the assembly of the Laplace operator on a near-degenerate mesh. We demonstrate that our REA implementation typically incurs only 2-4x performance overhead. Applications of this work include robust reduced-precision computations in embedded systems, numerical debugging of new, possibly ill-conditioned or unstable PDE formulations, and guiding the design of mixed-precision kernels.
ER  -