- Sparse grid
Sparse grids are a numerical technique to represent, integrate or interpolate high
dimension al functions. They were originally found by theRussia nmathematician Smolyak and are based on a sparse tensor product construction. Computer algorithms for efficient implementations of such grids were later developed byMichael Griebel andChristoph 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 , with points. The function has regularity , i.e. is times differentiable. The number of dimensions is .
Smolyak's quadrature rule
Smolyak found a computationally more efficient method of integrating multidimensional functions based on a univariate quadrature rule . The -dimensional Smolyak integral of a function can be written as a recursion formula with the tensor product.
The index to is the level of the discretization. A integration on level is computed by the evaluation of points. The error estimate for a function of regularity is:
References
* [http://wissrech.iam.uni-bonn.de/research/projects/zumbusch/fd.html Finite difference scheme on sparse grids]
* [http://www.vis.uni-stuttgart.de/ger/research/fields/recent/sparse/ Visualization on sparse grids]
* [http://citeseer.ist.psu.edu/hegland01adaptive.html CiteSeer: Adaptive Sparse Grids, M. Hegland]
* [http://wissrech.iam.uni-bonn.de/research/pub/garcke/kdd.pdf Datamining on sparse grids, J.Garcke, M.Griebel (pdf)]
* [http://www.math.tu-berlin.de/~garcke/paper/sparseGridTutorial.pdf Sparse Grid Tutorial, J.Garcke (pdf)]
Wikimedia Foundation. 2010.