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

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

Year:    2014

Communications in Computational Physics, Vol. 16 (2014), Iss. 2 : pp. 365–381

Abstract

In this work, we concern with the numerical comparison between different kinds of design points in least square (LS) approach on polynomial spaces. Such a topic is motivated by uncertainty quantification (UQ). Three kinds of design points are considered, which are the Sparse Grid (SG) points, the Monte Carlo (MC) points and the Quasi Monte Carlo (QMC) points. We focus on three aspects during the comparison: (i) the convergence properties; (ii) the stability, i.e. the properties of the resulting condition number of the design matrix; (iii) the robustness when numerical noises are present in function values. Several classical high dimensional functions together with a random ODE model are tested. It is shown numerically that (i) neither the MC sampling nor the QMC sampling introduces the low convergence rate, namely, the approach achieves high order convergence rate for all cases provided that the underlying functions admit certain regularity and enough design points are used; (ii)The use of SG points admits better convergence properties only for very low dimensional problems (say d ≤ 2); (iii)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.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/10.4208/cicp.130813.060214a

Communications in Computational Physics, Vol. 16 (2014), Iss. 2 : pp. 365–381

Published online:    2014-01

AMS Subject Headings:    Global Science Press

Copyright:    COPYRIGHT: © Global Science Press

Pages:    17

Keywords:   

  1. Data-driven polynomial chaos expansions: A weighted least-square approximation

    Guo, Ling | Liu, Yongle | Zhou, Tao

    Journal of Computational Physics, Vol. 381 (2019), Iss. P.129

    https://doi.org/10.1016/j.jcp.2018.12.020 [Citations: 17]
  2. Uncertainty Management for Robust Industrial Design in Aeronautics

    Polynomial Chaos and Collocation Methods and Their Range of Applicability

    Lacor, Chris | Savin, Éric

    2019

    https://doi.org/10.1007/978-3-319-77767-2_42 [Citations: 1]
  3. A new polynomial chaos expansion method for uncertainty analysis with aleatory and epistemic uncertainties

    He, Wanxin | Gao, Chao | Li, Gang | Zhou, Jinhang

    Structural and Multidisciplinary Optimization, Vol. 67 (2024), Iss. 10

    https://doi.org/10.1007/s00158-024-03899-4 [Citations: 0]
  4. Neumann enriched polynomial chaos approach for stochastic finite element problems

    Pryse, S.E. | Adhikari, S.

    Probabilistic Engineering Mechanics, Vol. 66 (2021), Iss. P.103157

    https://doi.org/10.1016/j.probengmech.2021.103157 [Citations: 6]
  5. A Stochastic Collocation Method for Delay Differential Equations with Random Input

    Zhou, Tao

    Advances in Applied Mathematics and Mechanics, Vol. 6 (2014), Iss. 4 P.403

    https://doi.org/10.4208/aamm.2012.m38 [Citations: 5]
  6. Least squares polynomial chaos expansion: A review of sampling strategies

    Hadigol, Mohammad | Doostan, Alireza

    Computer Methods in Applied Mechanics and Engineering, Vol. 332 (2018), Iss. P.382

    https://doi.org/10.1016/j.cma.2017.12.019 [Citations: 116]
  7. Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression

    Shin, Yeonjong | Xiu, Dongbin

    SIAM Journal on Scientific Computing, Vol. 38 (2016), Iss. 1 P.A385

    https://doi.org/10.1137/15M1015868 [Citations: 46]
  8. Uncertainty Management for Robust Industrial Design in Aeronautics

    Generalized Polynomial Chaos for Non-intrusive Uncertainty Quantification in Computational Fluid Dynamics

    Couaillier, Vincent | Savin, Éric

    2019

    https://doi.org/10.1007/978-3-319-77767-2_8 [Citations: 3]
  9. Numerical methods for reinterpreted discrete fracture models with random inputs

    Ding, Huan | Yang, Yang | Zhong, Xinghui

    Journal of Computational and Applied Mathematics, Vol. 448 (2024), Iss. P.115938

    https://doi.org/10.1016/j.cam.2024.115938 [Citations: 0]
  10. Sparse Recovery via ℓq-Minimization for Polynomial Chaos Expansions

    Guo, Ling | Liu, Yongle | Yan, Liang

    Numerical Mathematics: Theory, Methods and Applications, Vol. 10 (2017), Iss. 4 P.775

    https://doi.org/10.4208/nmtma.2017.0001 [Citations: 1]
  11. Coherence motivated sampling and convergence analysis of least squares polynomial Chaos regression

    Hampton, Jerrad | Doostan, Alireza

    Computer Methods in Applied Mechanics and Engineering, Vol. 290 (2015), Iss. P.73

    https://doi.org/10.1016/j.cma.2015.02.006 [Citations: 92]
  12. On Discrete Least-Squares Projection in Unbounded Domain with Random Evaluations and its Application to Parametric Uncertainty Quantification

    Tang, Tao | Zhou, Tao

    SIAM Journal on Scientific Computing, Vol. 36 (2014), Iss. 5 P.A2272

    https://doi.org/10.1137/140961894 [Citations: 25]
  13. Weighted discrete least-squares polynomial approximation using randomized quadratures

    Zhou, Tao | Narayan, Akil | Xiu, Dongbin

    Journal of Computational Physics, Vol. 298 (2015), Iss. P.787

    https://doi.org/10.1016/j.jcp.2015.06.042 [Citations: 22]
  14. Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification

    Liu, Yongle | Guo, Ling

    East Asian Journal on Applied Mathematics, Vol. 6 (2016), Iss. 2 P.171

    https://doi.org/10.4208/eajam.090615.060216a [Citations: 3]
  15. Multivariate Discrete Least-Squares Approximations with a New Type of Collocation Grid

    Zhou, Tao | Narayan, Akil | Xu, Zhiqiang

    SIAM Journal on Scientific Computing, Vol. 36 (2014), Iss. 5 P.A2401

    https://doi.org/10.1137/130950434 [Citations: 21]
  16. Sensitivity analysis based on non-intrusive regression-based polynomial chaos expansion for surgical mesh modelling

    Szepietowska, Katarzyna | Magnain, Benoit | Lubowiecka, Izabela | Florentin, Eric

    Structural and Multidisciplinary Optimization, Vol. 57 (2018), Iss. 3 P.1391

    https://doi.org/10.1007/s00158-017-1799-9 [Citations: 16]
  17. Entropy Stable Galerkin Methods with Suitable Quadrature Rules for Hyperbolic Systems with Random Inputs

    Zhong, Xinghui | Shu, Chi-Wang

    Journal of Scientific Computing, Vol. 92 (2022), Iss. 1

    https://doi.org/10.1007/s10915-022-01866-z [Citations: 5]
  18. Polynomial chaos expansion for permutation and cyclic permutation invariant systems: Application to mistuned bladed disks

    Dréau, Juliette | Magnain, Benoit | Nyssen, Florence | Batailly, Alain

    Journal of Sound and Vibration, Vol. 503 (2021), Iss. P.116103

    https://doi.org/10.1016/j.jsv.2021.116103 [Citations: 5]