Kriging-sparse Polynomial Dimensional Decomposition surrogate model with adaptive refinement

Abstract : Uncertainty Quantification and Sensitivity Analysis problems are made more difficult in the case of applications involving expensive computer simulations. This is because a limited amount of simulations is available to build a sufficiently accurate metamodel of the quantities of interest. In this work, an algorithm for the construction of a low-cost and accurate metamodel is proposed, having in mind computationally expensive applications. It has two main features. First, Universal Kriging is coupled with sparse Polynomial Dimensional Decomposition (PDD) to build a metamodel with improved accuracy. The polynomials selected by the adaptive PDD representation are used as a sparse basis to build a Universal Kriging surrogate model. Secondly, a numerical method, derived from anisotropic mesh adaptation, is formulated in order to adaptively insert a fixed number of new training points to an existing Design of Experiments. The convergence of the proposed algorithm is analyzed and assessed on different test functions with an increasing size of the input space. Finally, the algorithm is used to propagate uncertainties in two high-dimensional real problems related to the atmospheric reentry.
Document type :
Journal articles
Complete list of metadatas

Cited literature [65 references]  Display  Hide  Download

https://hal.inria.fr/hal-01914383
Contributor : Pietro Marco Congedo <>
Submitted on : Thursday, January 24, 2019 - 11:52:57 AM
Last modification on : Monday, October 7, 2019 - 4:38:58 PM

File

cortesi2018.pdf
Files produced by the author(s)

Identifiers

Citation

Andrea Francesco Cortesi, Ghina Jannoun, Pietro Marco Congedo. Kriging-sparse Polynomial Dimensional Decomposition surrogate model with adaptive refinement. Journal of Computational Physics, Elsevier, In press, 380, pp.212-242. ⟨10.1016/j.jcp.2018.10.051⟩. ⟨hal-01914383⟩

Share

Metrics

Record views

285

Files downloads

214