Papers › Sparse Grid Discretizations based on a Discontinuous Galerkin Method
Sparse Grid Discretizations based on a Discontinuous Galerkin Method
Alexander B. Atanasov, Erik Schnetter
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.
We examine and extend Sparse Grids as a discretization method for partial differential equations (PDEs). Solving a PDE in D dimensions has a cost that grows as O(Nᴰ) with commonly used methods. Even for moderate D (e.g. D=3), this quickly becomes prohibitively expensive for increasing problem size N. This effect is known as the Curse of Dimensionality. Sparse Grids offer an alternative discretization method with a much smaller cost of O(N logᴰ⁻¹N). In this paper, we introduce the reader to Sparse Grids, and extend the method via a Discontinuous Galerkin approach. We then solve the scalar wave equation in up to 6+1 dimensions, comparing cost and accuracy between full and sparse grids. Sparse Grids perform far superior, even in three dimensions. Our code is freely available as open source, and we encourage the reader to reproduce the results we show.
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