# Global sensitivity analysis in the context of imprecise probabilities   (p-boxes) using sparse polynomial chaos expansions

**Authors:** R. Sch\"obi, B. Sudret

arXiv: 1705.10061 · 2017-05-30

## TL;DR

This paper extends global sensitivity analysis to models with imprecise probabilities using p-boxes, introducing imprecise Sobol' indices computed efficiently via sparse polynomial chaos expansions.

## Contribution

It proposes a novel algorithm for calculating imprecise Sobol' indices with low computational cost using augmented space and sparse PCE.

## Key findings

- Validated the method on analytical examples
- Achieved significant computational efficiency
- Compared results with brute-force Monte Carlo

## Abstract

Global sensitivity analysis aims at determining which uncertain input parameters of a computational model primarily drives the variance of the output quantities of interest. Sobol' indices are now routinely applied in this context when the input parameters are modelled by classical probability theory using random variables. In many practical applications however, input parameters are affected by both aleatory and epistemic (so-called polymorphic) uncertainty, for which imprecise probability representations have become popular in the last decade. In this paper, we consider that the uncertain input parameters are modelled by parametric probability boxes (p-boxes). We propose interval-valued (so-called imprecise) Sobol' indices as an extension of their classical definition. An original algorithm based on the concepts of augmented space, isoprobabilistic transforms and sparse polynomial chaos expansions is devised to allow for the computation of these imprecise Sobol' indices at extremely low cost. In particular, phantoms points are introduced to build an experimental design in the augmented space (necessary for the calibration of the sparse PCE) which leads to a smart reuse of runs of the original computational model. The approach is illustrated on three analytical and engineering examples which allows one to validate the proposed algorithms against brute-force double-loop Monte Carlo simulation.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1705.10061/full.md

## Figures

21 figures with captions in the complete paper: https://tomesphere.com/paper/1705.10061/full.md

## References

51 references — full list in the complete paper: https://tomesphere.com/paper/1705.10061/full.md

---
Source: https://tomesphere.com/paper/1705.10061