A maximum cost-performance sampling strategy for multi-fidelity PC-Kriging

To reduce the computational cost of uncertainty propagation, multi-fidelity polynomial chaos approaches have been developed by fusing a few expensive high-fidelity data points and many less expensive lower-fidelity data points to build a stochastic metamodel. However, previous studies mainly focused on multi-model fusion. Systematically allocating sample points from multi-fidelity models to ensure both the accuracy and efficiency of the metamodel still remain challenging. To address this issue, a new maximum cost performance (MCP) sequential sampling strategy considering both the sample cost and accuracy improvement is proposed based on the recently developed multi-fidelity PC-Kriging (MF-PCK) approach. With the proposed sampling strategy, the input location with the largest prediction error is identified as the new input sample point, and then, the multi-fidelity model with the largest CP index is selected for evaluation to reduce the computational cost as much as possible. Furthermore, a sample density function is introduced to avoid the clustering of samples, which can prevent wastage of sample points and the singularity problem. The effectiveness and relative advantage of the proposed multi-fidelity sampling strategy in terms of efficiency is demonstrated by comparative studies using several numerical examples for uncertainty propagation and an airfoil robust optimization problem.

Automated summary

A new maximum cost performance sequential sampling strategy is proposed to optimize multi-fidelity polynomial chaos approaches by considering sample cost and accuracy improvement. By identifying the input location with the largest prediction error as the new sample point and selecting the multi-fidelity model with the largest CP index for evaluation, the efficiency of the metamodel is effectively improved.