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}
}
  • M. Hadigol, A. Doostan
  • Published 23 June 2017
  • Computer Science
  • Computer Methods in Applied Mechanics and Engineering

Figures and Tables from this paper

Robust adaptive least squares polynomial chaos expansions in high‐frequency applications
TLDR
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.
Quadrature Strategies for Constructing Polynomial Approximations
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
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 148 REFERENCES
Evaluation of Non-Intrusive Approaches for Wiener-Askey Generalized Polynomial Chaos.
TLDR
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
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
TLDR
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
  • B. Sudret
  • Mathematics
    Reliab. Eng. Syst. Saf.
  • 2008
Multivariate Discrete Least-Squares Approximations with a New Type of Collocation Grid
TLDR
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
TLDR
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.
Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
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
...
1
2
3
4
5
...