Adaptive Leja Sparse Grid Constructions for Stochastic Collocation and High-Dimensional Approximation
Top Cited Papers
- 1 January 2014
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 36 (6) , A2952-A2983
Abstract
We propose an adaptive sparse grid stochastic collocation approach based upon Leja interpolation sequences for approximation of parameterized functions with high-dimensional parameters. Leja sequences are arbitrarily granular (any number of nodes may be added to a current sequence, producing a new sequence) and thus are a good choice for the univariate composite rule used to construct adaptive sparse grids in high dimensions. When undertaking stochastic collocation one is often interested in constructing weighted approximation where the weights are determined by the probability densities of the random variables. This paper establishes that a certain weighted formulation of one-dimensional Leja sequences produces a sequence of nodes whose empirical distribution converges to the corresponding limiting distribution of the Gauss quadrature nodes associated with the weight function. This property is true even for unbounded domains. We apply the Leja sparse grid approach to several high-dimensional problems and demonstrate that Leja sequences are often superior to more standard sparse grid constructions (e.g., Clenshaw--Curtis), at least for interpolatory metrics.Keywords
All Related Versions
This publication has 39 references indexed in Scilit:
- STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATIONInternational Journal for Uncertainty Quantification, 2012
- Computation of connection coefficients and measure modifications for orthogonal polynomialsBIT Numerical Mathematics, 2011
- On the Lebesgue constant of Leja sequences for the unit disk and its applications to multivariate interpolationJournal of Approximation Theory, 2011
- Sparse gridsActa Numerica, 2004
- Dimension?Adaptive Tensor?Product QuadratureComputing, 2003
- Computation of Gauss-Kronrod quadrature rulesMathematics of Computation, 2000
- Weighted analogues of capacity, transfinite diameter, and Chebyshev constantConstructive Approximation, 1992
- Chebyshev domain truncation is inferior to fourier domain truncation for solving problems on an infinite intervalJournal of Scientific Computing, 1988
- Orthogonal polynomials associated with an infinite interval.The Michigan Mathematical Journal, 1980
- On Asymptotic Average Properties of Zeros of Orthogonal PolynomialsSIAM Journal on Mathematical Analysis, 1979