Adaptive Leja sparse grid constructions for stochastic collocation and high-dimensional approximation
From MaRDI portal
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.
Recommendations
- An adaptive high-order piecewise polynomial based sparse grid collocation method with applications
- Multilevel adaptive sparse Leja approximations for Bayesian inverse problems
- Multivariate quadrature on adaptive sparse grids
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- Stochastic collocation methods on unstructured grids in high dimensions via interpolation
Cited in
(55)- The numerical approximation of nonlinear functionals and functional differential equations
- Comparing nested sequences of Leja and PseudoGauss points to interpolate in 1D and solve the Schrödinger equation in 9D
- Generation and application of multivariate polynomial quadrature rules
- A dynamically adaptive sparse grids method for quasi-optimal interpolation of multidimensional functions
- Rank-adaptive tensor methods for high-dimensional nonlinear PDEs
- Asymptotics of the minimum values of Riesz and logarithmic potentials generated by greedy energy sequences on the unit circle
- Numerical analysis of a second order ensemble algorithm for numerical approximation of stochastic Stokes-Darcy equations
- On expansions and nodes for sparse grid collocation of lognormal elliptic PDEs
- Fast sparse grid operations using the unidirectional principle: a generalized and unified framework
- Efficiently transforming from values of a function on a sparse grid to basis coefficients
- An adaptive high-order piecewise polynomial based sparse grid collocation method with applications
- Dynamic tensor approximation of high-dimensional nonlinear PDEs
- Optimal design for kernel interpolation: applications to uncertainty quantification
- Data-driven low-fidelity models for multi-fidelity Monte Carlo sampling in plasma micro-turbulence analysis
- Adaptive density tracking by quadrature for stochastic differential equations
- IGA-based multi-index stochastic collocation for random PDEs on arbitrary domains
- Polynomial chaos expansions for dependent random variables
- Generation of nested quadrature rules for generic weight functions via numerical optimization: application to sparse grids
- Dynamically orthogonal tensor methods for high-dimensional nonlinear PDEs
- Multi-index stochastic collocation for random PDEs
- Uncertainty quantification of geochemical and mechanical compaction in layered sedimentary basins
- An adaptive sparse grid algorithm for elliptic PDEs with lognormal diffusion coefficient
- On tensor product approximation of analytic functions
- Comparison of Clenshaw-Curtis and Leja quasi-optimal sparse grids for the approximation of random PDEs
- Stochastic collocation methods on unstructured grids in high dimensions via interpolation
- Numerical integration in multiple dimensions with designed quadrature
- Weighted approximate Fekete points: sampling for least-squares polynomial approximation
- Convergence of Sparse Collocation for Functions of Countably Many Gaussian Random Variables (with Application to Elliptic PDEs)
- Generating nested quadrature rules with positive weights based on arbitrary sample sets
- Multi-index stochastic collocation convergence rates for random PDEs with parametric regularity
- Boosted optimal weighted least-squares
- Constructing least-squares polynomial approximations
- A method for dimensionally adaptive sparse trigonometric interpolation of periodic functions
- Bayesian model calibration with interpolating polynomials based on adaptively weighted Leja nodes
- Multilevel adaptive sparse Leja approximations for Bayesian inverse problems
- An adaptive minimum spanning tree multielement method for uncertainty quantification of smooth and discontinuous responses
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Implicit integration of nonlinear evolution equations on tensor manifolds
- Adaptive experimental design for multi‐fidelity surrogate modeling of multi‐disciplinary systems
- An hp‐adaptive multi‐element stochastic collocation method for surrogate modeling with information re‐use
- Multifidelity uncertainty quantification with models based on dissimilar parameters
- High-dimensional approximation with kernel-based multilevel methods on sparse grids
- Adaptive stochastic isogeometric analysis for nonlinear bending of thin functionally graded shells with material uncertainties
- An adaptive sparse grid rational Arnoldi method for uncertainty quantification of dynamical systems in the frequency domain
- Data-informed uncertainty quantification for laser-based powder bed fusion additive manufacturing
- Algorithm 1040: the Sparse Grids Matlab Kit -- a Matlab implementation of sparse grids for high-dimensional function approximation and uncertainty quantification
- Non-intrusive uncertainty quantification using reduced cubature rules
- Adaptive uncertainty quantification for stochastic hyperbolic conservation laws
- Sparse-grid discontinuous Galerkin methods for the Vlasov-Poisson-Lenard-Bernstein model
- Fast prediction of plasma instabilities with sparse-grid-accelerated optimized dynamic mode decomposition
- SABER: stable adaptive barycentric extension for reconstruction of high-dimensional functions
- Optimally balancing exploration and exploitation to automate multifidelity statistical estimation
- Sensitivity-driven adaptive sparse stochastic approximations in plasma microinstability analysis
- Stability analysis of hierarchical tensor methods for time-dependent PDEs
- Adaptive sampling-based quadrature rules for efficient Bayesian prediction
This page was built for publication: Adaptive Leja sparse grid constructions for stochastic collocation and high-dimensional approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176058)
