Back to Search
Start Over
Multi-level multi-fidelity sparse polynomial chaos expansion based on Gaussian process regression
- Source :
- Computer Methods in Applied Mechanics and Engineering. 349:360-377
- Publication Year :
- 2019
- Publisher :
- Elsevier BV, 2019.
-
Abstract
- The polynomial chaos expansion (PCE) approaches have drawn much attention in the field of simulation-based uncertainty quantification (UQ) of stochastic problem . In this paper, we present a multi-level multi-fidelity (MLMF) extension of non-intrusive sparse PCE based on recent work of recursive Gaussian process regression (GPR) methodology. The proposed method firstly builds the full PCE with varying degree of fidelity based on GPR technique using orthogonal polynomial covariance function . Then an autoregressive scheme is used to exploit the cross-correlation of these PCE models of different fidelity level, and this procedure yields a high-fidelity PCE model that encodes the information of all the lower fidelity levels. Furthermore, an iterative scheme is used to detect the important bases of PCE in each fidelity level. Three test examples are investigated d to validate the performance of the proposed method, and the results show that the present method provides an accurate meta-model for UQ of stochastic problem.
- Subjects :
- Polynomial chaos
Covariance function
Computer science
Mechanical Engineering
media_common.quotation_subject
Computational Mechanics
General Physics and Astronomy
Fidelity
010103 numerical & computational mathematics
01 natural sciences
Field (computer science)
Computer Science Applications
010101 applied mathematics
Autoregressive model
Mechanics of Materials
Kriging
Orthogonal polynomials
0101 mathematics
Uncertainty quantification
Algorithm
media_common
Subjects
Details
- ISSN :
- 00457825
- Volume :
- 349
- Database :
- OpenAIRE
- Journal :
- Computer Methods in Applied Mechanics and Engineering
- Accession number :
- edsair.doi...........1de9346bbbef27e579ddc58592860c0b
- Full Text :
- https://doi.org/10.1016/j.cma.2019.02.021