Numerical Algorithms

, 18:209

Numerical integration using sparse grids

  • Thomas Gerstner
  • Michael Griebel
Article

DOI: 10.1023/A:1019129717644

Cite this article as:
Gerstner, T. & Griebel, M. Numerical Algorithms (1998) 18: 209. doi:10.1023/A:1019129717644

Abstract

We present new and review existing algorithms for the numerical integration of multivariate functions defined over d-dimensional cubes using several variants of the sparse grid method first introduced by Smolyak [49]. In this approach, multivariate quadrature formulas are constructed using combinations of tensor products of suitable one-dimensional formulas. The computing cost is almost independent of the dimension of the problem if the function under consideration has bounded mixed derivatives. We suggest the usage of extended Gauss (Patterson) quadrature formulas as the one‐dimensional basis of the construction and show their superiority in comparison to previously used sparse grid approaches based on the trapezoidal, Clenshaw–Curtis and Gauss rules in several numerical experiments and applications. For the computation of path integrals further improvements can be obtained by combining generalized Smolyak quadrature with the Brownian bridge construction.

multivariate numerical quadratureSmolyak’s constructionsparse gridscomplexitycurse of dimension65C2065D3065D3265M9965R2065U0565Y20

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Thomas Gerstner
  • Michael Griebel

There are no affiliations available