Multifidelity Algorithm for the Sensitivity Analysis of Multidisciplinary Problems

Abstract

Abstract The present article proposes an algorithm for the sensitivity analysis of a multidisciplinary problem, in which the derivative-based global sensitivity indices are computed with multifidelity Gaussian process models. Two levels of fidelity are used to estimate the indices, where the low-fidelity samples are obtained by stopping the multidisciplinary analysis solver before convergence. A dedicated refinement strategy for the multifidelity Gaussian process is proposed to ensure the accuracy of the sensitivity index estimation. This algorithm is tested on three multidisciplinary problems of increasing complexity (one analytical and two representative engineering design problems), and proved to be both reliable in detecting the noninfluential variables and computationally efficient, compared to classical Monte Carlo integration and to three other candidate algorithms.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 7 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.