Skip to content
Preprint

Higher-order finite element de Rham complexes on sparse grids

Aug 2026 · 1 citation · ⚡ 1 influential · 33 references
Mathematics Computer Science

Abstract

We construct, for the first time, a family of higher-order finite element differential forms on tensor-product sparse grids. The construction starts from compatible one-dimensional spaces of continuous piecewise polynomials and discontinuous piecewise polynomials of one degree lower, linked by differentiation in each coordinate direction. Their hierarchical decompositions combine Alpert multiwavelets with their integrated counterparts. We establish commuting canonical interpolation operators and corresponding approximation error bounds under mixed Sobolev regularity. For the sparse-grid de Rham complex of arbitrary polynomial degree on the unit cube in arbitrary dimension, we also prove exactness, polynomial-degree-robust stable discrete potentials, and an H(d)-bounded commuting projection by developing a novel stable homotopy operator. Numerical experiments for curl-curl source problems on a cube and a Maxwell eigenproblem on a square-annulus illustrate the effectiveness of the proposed higher-order sparse-grid method.

View source

Similar papers

Preprint Sep 2026

Anisotropic Kernel-based Multilevel Interpolation of High-Dimensional Functions on Sparse Grids

Using a recent nodal representation of the low-dimensional multilevel operators, an explicit, computable representation of the high-dimensional interpolant is derived, and the full range of anisotropy weights that attain the optimal rate against the number of degrees of freedom are characterised.

Rüdiger Kempf · 0 citations
Preprint Oct 2026

Sparse-grid discretizations of BGG sequences

We develop the first tensor-product sparse-grid finite element discretizations of Bernstein--Gelfand--Gelfand (BGG) complexes. Alpert wavelets and their first and second primitives yield compatible hierarchies of discontinuous, continuous, and continuously differentiable piecewise polynomials, that serve as one-dimensi...

Yihanqi Hu, Yuwen Li · 0 citations
Preprint Oct 2026

A Hybrid High-Order method for variable-exponent Leray-Lions problems with convergence under minimal regularity

We consider a homogeneous Dirichlet problem for nonlinear elliptic equations in divergence form with Leray--Lions fluxes of variable growth. The class includes the variable-exponent $p(\cdot)$-Laplacian and regularized Carreau--Yasuda-type laws. We propose and analyze a Hybrid High-Order (HHO) discretization on general...

André Harnist, Romain Mottier · 1 citation
Preprint Sep 2026

High-Order Discontinuous Cut Finite Element Methods for Scalar Hyperbolic Conservation Laws

In this paper, we present a family of high-order cut finite element methods based on the discontinuous Galerkin (DG) framework for scalar hyperbolic conservation laws on complex domains. Building on our previous work, we develop a multidimensional formulation that combines macro-element stabilization with flux limiting...

Pei Fu, G. Kreiss, Ze-Lin Xin et al. · 2 citations
Preprint Sep 2026

Low-Order Refined Preconditioning for Spectral/hp Element Method for Complex, 3D Geometries

Low-order refined (LOR) preconditioning replaces a high-order operator with a low-order discretisation on a refined nodal mesh. For tensor-product elements, the two operators are spectrally equivalent with bounds independent of the polynomial order $P$, but the construction does not extend directly to simplex and mixed...

P. Khurana, Henrik Wüstenberg, D. Moxey et al. · 1 citation
Open access Sep 2026

Nonparametric face based finite element methods on complex hybrid three-dimensional meshes

In this work, we propose and analyze low-order nonconforming face-based finite element methods for elliptic problems on complex hybrid three-dimensional meshes, composed of arbitrary polytopal cells. The focus is on scalar problems, but the approach can be extended in a tensor manner to design generalizations of the cl...

A. Brunel, J. Latché · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.