Papers › Sparse Grid Discontinuous Galerkin Methods for High-Dimensional Elliptic Equations

Sparse Grid Discontinuous Galerkin Methods for High-Dimensional Elliptic Equations

31 Aug 2015arXiv:1508.07781links table onlyarchive 2025-07-28

Zixuan Wang, Qi Tang, Wei Guo, Yingda Cheng

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

This paper constitutes our initial effort in developing sparse grid discontinuous Galerkin (DG) methods for high-dimensional partial differential equations (PDEs). Over the past few decades, DG methods have gained popularity in many applications due to their distinctive features. However, they are often deemed too costly because of the large number of degrees of freedom of the approximation space, which are the main bottleneck for simulations in high dimensions. In this paper, we develop sparse grid DG methods for elliptic equations with the aim of breaking the \emph{curse of dimensionality}. Using a hierarchical basis representation, we construct a sparse finite element approximation space, reducing the degrees of freedom from the standard {O(h⁻ᵈ) to O(h⁻¹|log₂ h|ᵈ⁻¹)} for d-dimensional problems, where h is the uniform mesh size in each dimension. Our method, based on the interior penalty (IP) DG framework, can achieve accuracy of O(hᵏ|log₂ h|ᵈ⁻¹) in the energy norm, where k is the degree of polynomials used. Error estimates are provided and confirmed by numerical tests in multi-dimensions.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections