Global sensitivity analysis: A Bayesian learning based polynomial chaos approach

16Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A novel sparse polynomial chaos expansion (PCE) is proposed in this paper for global sensitivity analysis (GSA). The proposed model combines variational Bayesian (VB) inference and automatic relevance determination (ARD) with the PCE model. The VB inference is utilized to compute the PCE coefficients. The PCE coefficients are obtained through a simple optimization procedure in the VB framework. On the other hand, the curse of dimensionality issue of PCE model is tackled using the ARD which reduces the number of polynomial bases significantly. The applicability of the proposed approach is illustrated by performing GSA on five numerical examples. The results show that the proposed approach outperforms a similar state-of-art surrogate model in obtaining an accurate sensitivity index using limited number of model evaluations. For all the examples, the PCE models are highly sparse, which require very few polynomial bases to assess an accurate sensitivity index.

Cite

CITATION STYLE

APA

Bhattacharyya, B. (2020). Global sensitivity analysis: A Bayesian learning based polynomial chaos approach. Journal of Computational Physics, 415. https://doi.org/10.1016/j.jcp.2020.109539

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free