Interpretation of a Discrete de Rham method as a Finite Element System
math.NA, cs.NA
Submitted: 2025-12-05
Updated: 2026-10-30
Comments: v1: 20 pages, v2: 27 pages, v3: 37 pages
License: http://creativecommons.org/licenses/by/4.0/
The gist: Within the framework of Finite Element Systems (FES) we define a numerical method for computing differential forms, inspired by the Discrete de Rham (DDR) method.
Terminology
Abstract
Within the framework of Finite Element Systems (FES) we define a numerical method for computing differential forms, inspired by the Discrete de Rham (DDR) method. The discrete L squared product of DDR is given a new interpretation, as a computable approximation of the true L squared product on local spaces of forms defined by partial differential equations. Without significantly modifying the numerical method itself, this point of view provides an alternative approach to the analysis. The conformity and consistency properties we obtain are stronger than those previously shown, even in low dimensions. We can also recover some of the other results that have been proved about DDR, from those that have already been proved, in principle, in the general context of FES. Parts of the analysis involve a conjectural hypothesis of stability of constants, with respect to small mesh perturbations, that we detail. We also bring VEM, the Virtual Element Method, into the discussion. For convenience, background material on the FES framework is reviewed.
Sources
- Finite element systems of differential forms
- An exterior calculus framework for polytopal methods
- Stability of Hodge decompositions in finite element spaces of differential forms in arbitrary dimension
- Constructions of some minimal finite element systems
- Second order gauge invariant discretizations to the Schr\"odinger and Pauli equations
- Stability of an upwind Petrov Galerkin discretization of convection diffusion equations
- On high order finite element spaces of differential forms
- Discrete Poincar'e inequalities: a review on proofs, equivalent formulations, and behavior of constants
- A Framework for Analysis of DEC Approximations to Hodge-Laplacian Problems using Generalized Whitney Forms
Related papers
- Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
- A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
- Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
- Operator learning meets inverse problems: A probabilistic perspective
- Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers