Journal Article10.1023/A:1019129717644
Numerical integration using sparse grids
Thomas Gerstner,Michael Griebel +1 more
1.1K
TL;DR: The usage of extended Gauss (Patterson) quadrature formulas as the one‐dimensional basis of the construction is suggested and their superiority in comparison to previously used sparse grid approaches based on the trapezoidal, Clenshaw–Curtis and Gauss rules is shown.
read more
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
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Cubature Kalman Filters
TL;DR: A third-degree spherical-radial cubature rule is derived that provides a set of cubature points scaling linearly with the state-vector dimension that may provide a systematic solution for high-dimensional nonlinear filtering problems.
A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
TL;DR: This work demonstrates algebraic convergence with respect to the total number of collocation points and quantifies the effect of the dimension of the problem (number of input random variables) in the final estimates, indicating for which problems the sparse grid stochastic collocation method is more efficient than Monte Carlo.
Polynomial chaos expansion for sensitivity analysis
TL;DR: It is shown that when the model output is smooth with regards to the inputs, a spectral convergence of the computed sensitivity indices is achieved, but even for smooth outputs the method is limited to a moderate number of inputs, as it becomes computationally too demanding to reach the convergence domain.
774
High dimensional polynomial interpolation on sparse grids
TL;DR: The error bounds show that the polynomial interpolation on a d-dimensional cube, where d is large, is universal, i.e., almost optimal for many different function spaces.
764
Tractability of Multivariate Problems
Henryk Woźniakowski
- 02 Sep 2008
TL;DR: The main purpose of this book is to study weighted spaces and to obtain conditions on the weights that are necessary and sufficient to achieve various notions of tractability, depending on how to measure the lack of exponential dependence.
692
References
•Book
Random number generation and quasi-Monte Carlo methods
Harald Niederreiter
- 01 Jan 1992
TL;DR: This chapter discusses Monte Carlo methods and Quasi-Monte Carlo methods for optimization, which are used for numerical integration, and their applications in random numbers and pseudorandom numbers.
4K
Methods of Numerical Integration
Luc Bauwens,Michel Lubrano,Jean-François Richard +2 more
- 06 Jan 2000
TL;DR: Methods of numerical integration will lead you to always think more and more, and this book will be always right for you.
1.1K
A method for numerical integration on an automatic computer
C. W. Clenshaw,A. R. Curtis +1 more
TL;DR: In this paper, a method for numerical integration of a well-behaved function over a finite range of argument is described, which consists essentially of expanding the integrand in a series of Chebyshev polynomials, and integrating this series term by term.
1K