A Sparse Grid {PDE} Solver

  • Zumbusch G
  • 7


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


Sparse grids are an efficient approximation method for functions, especially in higher dimensions d \ge 3. Compared to regular, uniform grids of a mesh parameter h, which contain h^{-d} points in d dimensions, sparse grids require only h^{-1}|\log h|^{d-1} points due to a truncated, tensor-product multi-scale basis representation. The purpose of this paper is to survey some activities for the solution of partial differential equations with methods based sparse grid. Furthermore some aspects of sparse grids are discussed such as adaptive grid refinement, parallel computing, a space-time discretization scheme and the structure of a code to implement these methods.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

There are no full text links


  • G. W. Zumbusch

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free