Least squares polynomial chaos expansion: a review of sampling strategies

DOI10.1016/j.cma.2017.12.019zbMath1440.65007arXiv1706.07564OpenAlexW2696437456MaRDI QIDQ2310855

Mohammad Hadigol, Alireza Doostan

Publication date: 7 April 2020

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.07564

zbMATH Keywords

polynomial chaosoptimal samplingleast squares approximationoptimal design of experimentscoherence-optimal

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Computational methods for problems pertaining to probability theory (60-08) Factorial statistical designs (62K15)

Related Items

Generalized polynomial chaos-informed efficient stochastic kriging ⋮ An adaptive least-squares global sensitivity method and application to a plasma-coupled combustion prediction with parametric correlation ⋮ A sequential experimental design for multivariate sensitivity analysis using polynomial chaos expansion ⋮ CFD-based shape optimization under uncertainties using the adjoint-assisted polynomial chaos expansion and projected derivatives ⋮ Multi-level multi-fidelity sparse polynomial chaos expansion based on Gaussian process regression ⋮ Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling ⋮ Minimally-invasive parametric model-order reduction for sweep-based radiation transport ⋮ Theory and methods for random differential equations: a survey ⋮ A novel sparse polynomial chaos expansion technique with high adaptiveness for surrogate modelling ⋮ Stochastic analysis of structures under limited observations using kernel density estimation and arbitrary polynomial chaos expansion ⋮ Sensitivity-enhanced generalized polynomial chaos for efficient uncertainty quantification ⋮ Cross-mode stabilized stochastic shallow water systems using stochastic finite element methods ⋮ Basis adaptive sample efficient polynomial chaos (BASE-PC) ⋮ A fully Bayesian sparse polynomial chaos expansion approach with joint priors on the coefficients and global selection of terms ⋮ On the influence of over-parameterization in manifold based surrogates and deep neural operators ⋮ Comparison of the performance and reliability between improved sampling strategies for polynomial chaos expansion ⋮ Constructing Least-Squares Polynomial Approximations ⋮ Adaptive multi-fidelity polynomial chaos approach to Bayesian inference in inverse problems ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ Probabilistic model updating via variational Bayesian inference and adaptive Gaussian process modeling ⋮ Surrogate-based sequential Bayesian experimental design using non-stationary Gaussian processes ⋮ A Reduced-Basis Polynomial-Chaos Approach with a Multi-parametric Truncation Scheme for Problems with Uncertainties ⋮ Robust topology optimization of vibrating structures considering random diffuse regions via a phase-field method ⋮ An efficient and robust adaptive sampling method for polynomial chaos expansion in sparse Bayesian learning framework ⋮ An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion ⋮ Variance-based adaptive sequential sampling for polynomial chaos expansion ⋮ A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design ⋮ Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares ⋮ Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction ⋮ Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling ⋮ Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements ⋮ Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark ⋮ Polynomial Chaos as a Control Variate Method ⋮ Learning ``best kernels from data in Gaussian process regression. With application to aerodynamics ⋮ Sequential Sampling for Optimal Weighted Least Squares Approximations in Hierarchical Spaces

Uses Software

• NetQuest

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A distribution-free approach to inducing rank correlation among input variables
• Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
• Optimal design of multi-response experiments using semi-definite programming
• On the stability and accuracy of least squares approximations
• Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
• \(E\)-optimal designs for second-order response surface models
• A non-adapted sparse approximation of PDEs with stochastic inputs
• Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
• Design of computer experiments: space filling and beyond
• Sparse pseudospectral approximation method
• Galerkin methods for linear and nonlinear elliptic stochastic partial differential equations
• Majorization framework for balanced lattice designs
• Response surface design evaluation and comparison
• A new approach to the construction of optimal designs
• Model-oriented design of experiments
• A note on construction of nearly uniform designs with large number of runs.
• Algorithmic construction of optimal symmetric Latin hypercube designs.
• Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
• Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
• Weighted discrete least-squares polynomial approximation using randomized quadratures
• Optimal experimental design and some related control problems
• Low discrepancy sequences in high dimensions: how well are their projections distributed?
• An adaptive multi-element generalized polynomial chaos method for stochastic differential equations
• A review of some exchange algorithms for constructing discrete \(D\)-optimal designs
• Worst case scenario analysis for elliptic problems with uncertainty
• The orthogonal development of non-linear functionals in series of Fourier-Hermite functionals
• Optimal and orthogonal Latin hypercube designs for computer experiments
• Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression
• Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces
• Optimal designs for two-level factorial experiments with binary response
• Multivariate Discrete Least-Squares Approximations with a New Type of Collocation Grid
• A Christoffel function weighted least squares algorithm for collocation approximations
• Minimizing the Condition Number of a Gram Matrix
• Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Stochastic finite elements: Computational approaches to stochastic partial differential equations
• Uncertainty Quantification and Polynomial Chaos Techniques in Computational Fluid Dynamics
• Stochastic finite element: a non intrusive approach by regression
• Spectral Methods for Uncertainty Quantification
• A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
• A hybrid collocation/Galerkin scheme for convective heat transfer problems with stochastic boundary conditions
• Large Sample Properties of Simulations Using Latin Hypercube Sampling
• The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
• Constructing Exact D-Optimal Experimental Designs by Simulated Annealing
• The construction of exact D-optimum experimental designs with application to blocking response surface designs
• `` Direct Search Solution of Numerical and Statistical Problems
• A Comparison of Algorithms for Constructing Exact D-Optimal Designs
• An Algorithm for the Construction of "D-Optimal" Experimental Designs
• Quasi-Monte Carlo methods and pseudo-random numbers
• Latin supercube sampling for very high-dimensional simulations
• Application of genetic algorithms to the construction of exact D-optimal designs
• Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
• Uniform Design: Theory and Application
• An Efficient Sampling Method for Regression-Based Polynomial Chaos Expansion
• Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
• The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
• The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
• Sliced Latin Hypercube Designs
• Maximum projection designs for computer experiments
• Optimal Design of Experiments
• Minimizing the Condition Number to Construct Design Points for Polynomial Regression Models
• On the Choice of Design Points for Least Square Polynomial Approximations with Application to Uncertainty Quantification
• High-Order Collocation Methods for Differential Equations with Random Inputs
• A construction method for orthogonal Latin hypercube designs
• The Sequential Generation of $D$-Optimum Experimental Designs
• A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
• Design and analysis of simulation experiments
• Discrepancy estimates based on Haar functions