Adaptive Leja sparse grid constructions for stochastic collocation and high-dimensional approximation
arXiv:1404.5663 · doi:10.1137/140966368
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 and problems and demonstrate that Leja sequences are often superior to more standard sparse grid constructions (e.g. Clenshaw-Curtis), at least for interpolatory metrics.
29 pages, 11 figures
Cited by in corpus (27)
- 2022 Review of Data-Driven Plasma Science
- Polynomial chaos expansions for dependent random variables
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Multi-Index Stochastic Collocation for random PDEs
- Stochastic collocation on unstructured multivariate meshes
- Numerical Integration in Multiple Dimensions with Designed Quadrature
- Adaptive Multi-index Collocation for Uncertainty Quantification and Sensitivity Analysis
- The Numerical Approximation of Nonlinear Functionals and Functional Differential Equations
- Multifidelity uncertainty quantification with models based on dissimilar parameters
- Dynamically orthogonal tensor methods for high-dimensional nonlinear PDEs
- Uncertainty Quantification of geochemical and mechanical compaction in layered sedimentary basins
- Dynamic tensor approximation of high-dimensional nonlinear PDEs
- Generation and application of multivariate polynomial quadrature rules
- Data-driven low-fidelity models for multi-fidelity Monte Carlo sampling in plasma micro-turbulence analysis
- Boosted optimal weighted least-squares
- A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions
- IGA-based Multi-Index Stochastic Collocation for random PDEs on arbitrary domains
- Stability analysis of hierarchical tensor methods for time-dependent PDEs
- Non-intrusive uncertainty quantification using reduced cubature rules
- Adaptive sampling-based quadrature rules for efficient Bayesian prediction
- Multilevel adaptive sparse Leja approximations for Bayesian inverse problems
- Uncertainty Modeling and Analysis of the European X-ray Free Electron Laser Cavities Manufacturing Process
- An -adaptive multi-element stochastic collocation method for surrogate modeling with information re-use
- Turbulence suppression by energetic particles: A sensitivity-driven dimension-adaptive sparse grid framework for discharge optimization
- Generating nested quadrature rules with positive weights based on arbitrary sample sets
- Approximation and Uncertainty Quantification of Systems with Arbitrary Parameter Distributions using Weighted Leja Interpolation
- Fast prediction of plasma instabilities with sparse-grid-accelerated optimized dynamic mode decomposition