2020
DOI: 10.1016/j.ymssp.2019.106589
|View full text |Cite
|
Sign up to set email alerts
|

Efficient uncertainty propagation for parameterized p-box using sparse-decomposition-based polynomial chaos expansion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(9 citation statements)
references
References 46 publications
0
9
0
Order By: Relevance
“…Constructed p-box for input variables, uncertainty in response could be propagated with a variety of approaches, such as nested Monte Carlo sampling (MCS) (Ferson and Ginzburg, 1996), optimization method (Liu et al, 2018), polynomial chaos expansion (Xiu and Karniadakis, 2003;Liu et al, 2020), etc. Usually, an efficient surrogate model is needed in uncertainty propagation for reducing the computational cost.…”
Section: Uq For Correlated Variablesmentioning
confidence: 99%
“…Constructed p-box for input variables, uncertainty in response could be propagated with a variety of approaches, such as nested Monte Carlo sampling (MCS) (Ferson and Ginzburg, 1996), optimization method (Liu et al, 2018), polynomial chaos expansion (Xiu and Karniadakis, 2003;Liu et al, 2020), etc. Usually, an efficient surrogate model is needed in uncertainty propagation for reducing the computational cost.…”
Section: Uq For Correlated Variablesmentioning
confidence: 99%
“…The training set is generated for an auxiliary input vector X and least angle regression (LARS) is used for training. In case of parametric p-boxes, it is proposed in (Liu et al, 2020) to model the sparse PCE coefficients a α as quadratic polynomial functions of the parameters θ of the p-box and using a double-loop sampling for the propagation.…”
Section: Polynomial Chaos Expansions and Kriging Modelsmentioning
confidence: 99%
“…Here is a short list of methods currently being developed for the reduction of computational cost in imprecise probability models, in particular, for imprecise random fields: Approximations by inner and outer bounds [2,3,57,64]; propagation methods for p-boxes [11,12,48,62,63]; methods employing polynomial chaos expansion [31,43,52]; probability plots, an enhancement of the first order reliability method (FORM) proposed by [26]. A very efficient method appears to be advanced line sampling [8,56] that intertwines the two required loops and can reduce M and N simultaneously.…”
Section: Numerical Aspectsmentioning
confidence: 99%