Uncertainty propagation of p-boxes using sparse polynomial chaos expansions
Roland Sch\"obi, Bruno Sudret

TL;DR
This paper introduces a two-level sparse polynomial chaos expansion method for efficiently propagating p-box uncertainties through complex engineering models, reducing computational costs while maintaining accuracy.
Contribution
It presents a novel non-intrusive meta-modeling approach for uncertainty propagation with p-boxes, combining efficiency and accuracy in high-fidelity simulations.
Findings
Accurately estimates output statistics with few model evaluations
Effective for both benchmark and real engineering problems
Reduces computational costs in uncertainty quantification
Abstract
In modern engineering, physical processes are modelled and analysed using advanced computer simulations, such as finite element models. Furthermore, concepts of reliability analysis and robust design are becoming popular, hence, making efficient quantification and propagation of uncertainties an important aspect. In this context, a typical workflow includes the characterization of the uncertainty in the input variables. In this paper, input variables are modelled by probability-boxes (p-boxes), accounting for both aleatory and epistemic uncertainty. The propagation of p-boxes leads to p-boxes of the output of the computational model. A two-level meta-modelling approach is proposed using non-intrusive sparse polynomial chaos expansions to surrogate the exact computational model and, hence, to facilitate the uncertainty quantification analysis. The capabilities of the proposed approach…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
