CUED Publications database

Multi-fidelity non-intrusive polynomial chaos based on regression

Palar, PS and Tsuchiya, T and Parks, GT (2016) Multi-fidelity non-intrusive polynomial chaos based on regression. Computer Methods in Applied Mechanics and Engineering, 305. pp. 579-606. ISSN 0045-7825

Full text not available from this repository.

Abstract

© 2016 Elsevier B.V. In this paper we present a multi-fidelity (MF) extension of non-intrusive polynomial chaos based on regression (point collocation) for uncertainty quantification purposes. The proposed method uses the principle of a global correction function from a previous similar method that uses spectral projection to estimate the coefficients. Due to its usage of regression to estimate the coefficients, the present method offers high flexibility in the sampling and generation of the polynomial basis. The method takes advantage of a nested sampling plan to create the samples for the low-fidelity (LF) and correction expansions where the high-fidelity (HF) samples are a subset of the LF ones. To build the polynomial basis, a total order or hyperbolic truncation strategy is used with a highly flexible combination of the LF and correction polynomial expansions. The method is demonstrated on some artificial test problems and aerodynamic problems of the Euler flow around an airfoil and common three-dimensional research models. In order to derive the strategies for successful MF approximation, the effect of the correlation and the errors between the LF and HF functions is also studied. The results show that high correlation and moderately low errors are important to improve the MF approximation's accuracy. On a common research model problem, the MF approach with partially-converged simulations as the LF samples can successfully reduce the computational cost to about 40% for similar accuracy compared to an approach using a single HF expansion.

Item Type: Article
Subjects: UNSPECIFIED
Divisions: Div A > Energy
Depositing User: Cron Job
Date Deposited: 17 Jul 2017 19:11
Last Modified: 16 Nov 2017 02:16
DOI: