Dilation (morphology)

Sparse grids are numerical techniques to represent, integrate or interpolate high dimensional functions. They were originally developed by the Russian mathematician Sergey A. Smolyak, a student of Lazar Lyusternik, and are based on a sparse tensor product construction. Computer algorithms for efficient implementations of such grids were later developed by Michael Griebel and Christoph Zenger.

Curse of dimensionality

The standard way of representing multidimensional functions are tensor or full grids. The number of basis functions or nodes (grid points) that have to be stored and processed depend exponentially on the number of dimensions. Even with today's computational power it is not possible to process functions with more than 4 or 5 dimensions.

The curse of dimension is expressed in the order of the integration error that is made by a quadrature of level $l$, with $N_l$ points. The function has regularity $r$, i.e. is $r$ times differentiable. The number of dimensions is $d$.

$\left|E_l\right|=O(N_l^{-\frac{r}{d}})$

Smolyak's quadrature rule

Smolyak found a computationally more efficient method of integrating multidimensional functions based on a univariate quadrature rule $Q^{(1)}$. The $d$-dimensional Smolyak integral $Q^{(d)}$of a function $f$ can be written as a recursion formula with the tensor product.

$Q_l^{(d)}f=(\sum _{i=1}^l(Q_i^{(1)}-Q_{i-1}^{(1)})\otimes Q_{l-i+1}^{(d-1)})f$

The index to $Q$ is the level of the discretization. A $1-d$ integration on level $i$ is computed by the evaluation of $O(2^i)$ points. The error estimate for a function of regularity $r$ is:

$\left|E_l\right|=O\left(N_l^{-r}{(\log N_l)}^{(d-1)(r+1)}\right)$

References

• A memory efficient data structure for regular sparse grids
• Code to generate (and pre-generated) nodes and weights for quadrature
• Finite difference scheme on sparse grids
• Visualization on sparse grids
• Datamining on sparse grids, J.Garcke, M.Griebel (pdf)
• Sparse Grid Tutorial, J.Garcke (pdf)