Sparse grid

Sparse grid

Sparse grids are a numerical technique to represent, integrate or interpolate high dimensional functions. They were originally found by the Russian mathematician Smolyak 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.

|E_l| = 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 = left(sum_{i=0}^l left(Q_i^{(1)}-Q_{i-1}^{(1)} ight)otimes Q_{l-i}^{(d-1)} ight)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:

|E_l| = Oleft(N_l^{-r}left(log N_l ight)^{(d-1)(r+1)} ight)

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.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • Graph paper — Regular graphing paper (upper); Logarithmic graphing paper (lower). Graph paper, graphing paper, grid paper or millimeter paper is writing paper that is printed with fine lines making up a …   Wikipedia

  • Christoph Zenger — (born 10 August 1940) is a German mathematician. Contents 1 Career 2 Selected publications 3 References 4 External links …   Wikipedia

  • Christoph Zenger — (* 10. August 1940) ist ein deutscher Mathematiker und Informatiker. Inhaltsverzeichnis 1 Leben und Werk 2 Ehrungen 3 Werke 4 Weblinks …   Deutsch Wikipedia

  • редкая — — [http://slovarionline.ru/anglo russkiy slovar neftegazovoy promyishlennosti/] Тематики нефтегазовая промышленность EN sparse gridwidely spread grid …   Справочник технического переводчика

  • Analyse numérique — L’analyse numérique est une discipline des mathématiques. Elle s’intéresse tant aux fondements théoriques qu’à la mise en pratique des méthodes permettant de résoudre, par des calculs purement numériques, des problèmes d’analyse mathématique.… …   Wikipédia en Français

  • Multisample anti-aliasing — (MSAA) is a type of anti aliasing, a technique used in computer graphics to improve image quality. Contents 1 Definition 2 Description 3 Advantages 4 Disadvantages …   Wikipedia

  • Level set (data structures) — In computer science a level set data structure is designed to represent discretely sampled dynamic level sets functions.A common use of this form of data structure is in efficient image rendering.Chronological developmentsThe powerful level set… …   Wikipedia

  • Finite element method — The finite element method (FEM) (sometimes referred to as finite element analysis) is a numerical technique for finding approximate solutions of partial differential equations (PDE) as well as of integral equations. The solution approach is based …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”