# Least squares polynomial chaos expansion: A review of sampling strategies

@article{Hadigol2017LeastSP, title={Least squares polynomial chaos expansion: A review of sampling strategies}, author={Mohammad Hadigol and Alireza Doostan}, journal={Computer Methods in Applied Mechanics and Engineering}, year={2017}, volume={332}, pages={382-407} }

## Figures and Tables from this paper

## 76 Citations

Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling

- Computer Science
- 2020

Robust adaptive least squares polynomial chaos expansions in high‐frequency applications

- MathematicsInternational Journal of Numerical Modelling: Electronic Networks, Devices and Fields
- 2020

This work investigates how different conditions affect the robustness of the derived surrogate models, that is, how much the approximation accuracy varies given different experimental designs, and proposes two criteria for a good accuracy-robustness trade-off.

Basis adaptive sample efficient polynomial chaos (BASE-PC)

- Computer ScienceJ. Comput. Phys.
- 2018

A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design

- Computer ScienceComputer Methods in Applied Mechanics and Engineering
- 2021

Sparse polynomial chaos expansions via compressed sensing and D-optimal design

- Computer Science
- 2018

An efficient adaptive forward–backward selection method for sparse polynomial chaos expansion

- EngineeringComputer Methods in Applied Mechanics and Engineering
- 2019

An efficient and robust adaptive sampling method for polynomial chaos expansion in sparse Bayesian learning framework

- Computer ScienceComputer Methods in Applied Mechanics and Engineering
- 2019

Quadrature Strategies for Constructing Polynomial Approximations

- Computer Science, MathematicsUncertainty Modeling for Engineering Applications
- 2018

Finding suitable points for multivariate polynomial interpolation and approximation is a challenging task. Yet, despite this challenge, there has been tremendous research dedicated to this singular…

Polynomial chaos expansion for permutation and cyclic permutation invariant systems: Application to mistuned bladed disks

- EngineeringJournal of Sound and Vibration
- 2021

## References

SHOWING 1-10 OF 148 REFERENCES

Compressive sampling of polynomial chaos expansions: Convergence analysis and sampling strategies

- Computer Science, MathematicsJ. Comput. Phys.
- 2015

Coherence motivated sampling and convergence analysis of least squares polynomial Chaos regression

- Mathematics
- 2015

Evaluation of Non-Intrusive Approaches for Wiener-Askey Generalized Polynomial Chaos.

- Computer Science
- 2008

Experience with non-intrusive PCE methods for algebraic and PDE-based benchmark test problems is presented, demonstrating the need for accurate, efficient coefficient estimation approaches that can be used for problems with significant numbers of random variables.

Quasi-random numbers in stochastic finite element analysis

- Engineering
- 2007

A non-intrusive stochastic finite-element method is proposed for uncertainty propagation through mechanical systems with uncertain input described by random variables. A polynomial chaos expansion…

An Efficient Sampling Method for Regression-Based Polynomial Chaos Expansion

- Computer Science
- 2013

An optimization algorithm that seeks to find the best design of experiments in the D-optimal sense for the PCE, a coupling between genetic algorithms and the Fedorov exchange algorithm is proposed.

Global sensitivity analysis using polynomial chaos expansions

- MathematicsReliab. Eng. Syst. Saf.
- 2008

Multivariate Discrete Least-Squares Approximations with a New Type of Collocation Grid

- Mathematics, Computer ScienceSIAM J. Sci. Comput.
- 2014

This work demonstrates the stability and an optimal convergence estimate, provided the number of points scales quadratically with the dimension of the polynomial space, and shows that the point set asymptotically equidistributes to the product-Chebyshev measure, allowing us to propose a weighted least-squares framework and extend the method to more generalPolynomial approximations.

On the Choice of Design Points for Least Square Polynomial Approximations with Application to Uncertainty Quantification

- Computer Science
- 2014

This work concerns with the numerical comparison between different kinds of design points in least square (LS) approach on polynomial spaces, and the QMC points, being deterministic, seem to be a good choice for higher dimensional problems not only for better convergence properties but also in the stability point of view.

An adaptive multi-element generalized polynomial chaos method for stochastic differential equations

- Computer Science, Mathematics
- 2005

Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations

- Mathematics, Computer ScienceMath. Comput.
- 2017

We analyze the convergence of compressive sensing based sampling techniques for the efficient evaluation of functionals of solutions for a class of high-dimensional, affine-parametric, linear…