English

Sparse Grid Discretizations based on a Discontinuous Galerkin Method

Numerical Analysis 2017-10-26 v1 Computational Physics

Abstract

We examine and extend Sparse Grids as a discretization method for partial differential equations (PDEs). Solving a PDE in DD dimensions has a cost that grows as O(ND)O(N^D) with commonly used methods. Even for moderate DD (e.g. D=3D=3), this quickly becomes prohibitively expensive for increasing problem size NN. This effect is known as the Curse of Dimensionality. Sparse Grids offer an alternative discretization method with a much smaller cost of O(NlogD1N)O(N \log^{D-1}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+16+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.

Cite

@article{arxiv.1710.09356,
  title  = {Sparse Grid Discretizations based on a Discontinuous Galerkin Method},
  author = {Alexander B. Atanasov and Erik Schnetter},
  journal= {arXiv preprint arXiv:1710.09356},
  year   = {2017}
}
R2 v1 2026-06-22T22:25:40.545Z