Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sparse Grid Discretizations based on a Discontinuous Galerkin Method

Published 25 Oct 2017 in cs.NA and physics.comp-ph | (1710.09356v1)

Abstract: 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(ND)$ 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{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+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.

Citations (2)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.