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