no. 16 · Tuesday 17 November 2026
Sparse-grid discretizations of BGG sequences
Abstract
For Bernstein–Gelfand–Gelfand (BGG) complexes, we develop the first sparse-grid finite element discretizations, for dramatically reducing the number of degrees of freedom used in tensor-product finite elements. Alpert wavelets and their first and second primitives yield compatible hierarchies of discontinuous, continuous, and continuously differentiable piecewise polynomials, that serve as one-dimensional ingredients of BGG sparse-grid finite elements. For the three-dimensional Hessian, elasticity, and div-div complexes, we construct a bounded commuting sparse-grid projection that yields stable discrete potentials, exactness and uniform inf-sup stability of associated mixed methods. Under mixed Sobolev regularity, we also prove sparse-grid approximation estimates with dimension-independent algebraic convergence rates in the number of degrees of freedom. Experiments for a three-dimensional incompatibility problem and a two-dimensional biharmonic problem on an annulus illustrate the efficiency of sparse grids relative to tensor-product finite elements.
- comments
- 22 pages, 4 figures
- fields
- Numerical Analysis