Bibliographic Details
| Title: |
Nested polynomial trends for the improvement of Gaussian process-based predictors. |
| Authors: |
Perrin, G.1 guillaume.perrin2@cea.fr, Soize, C.2, Marque-Pucheu, S.1,3, Garnier, J.3 |
| Source: |
Journal of Computational Physics. Oct2017, Vol. 346, p389-402. 14p. |
| Subjects: |
Polynomials, Gaussian processes, Sensitivity analysis, Mathematical mappings, Parameterization |
| Abstract: |
The role of simulation keeps increasing for the sensitivity analysis and the uncertainty quantification of complex systems. Such numerical procedures are generally based on the processing of a huge amount of code evaluations. When the computational cost associated with one particular evaluation of the code is high, such direct approaches based on the computer code only, are not affordable. Surrogate models have therefore to be introduced to interpolate the information given by a fixed set of code evaluations to the whole input space. When confronted to deterministic mappings, the Gaussian process regression (GPR), or kriging, presents a good compromise between complexity, efficiency and error control. Such a method considers the quantity of interest of the system as a particular realization of a Gaussian stochastic process, whose mean and covariance functions have to be identified from the available code evaluations. In this context, this work proposes an innovative parametrization of this mean function, which is based on the composition of two polynomials. This approach is particularly relevant for the approximation of strongly non linear quantities of interest from very little information. After presenting the theoretical basis of this method, this work compares its efficiency to alternative approaches on a series of examples. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Computational Physics is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |