2010
DOI: 10.1016/j.jcp.2009.10.043
|View full text |Cite
|
Sign up to set email alerts
|

Multi-element probabilistic collocation method in high dimensions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
179
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 203 publications
(180 citation statements)
references
References 49 publications
(55 reference statements)
1
179
0
Order By: Relevance
“…The scheme is based on a tensor-product construction and hence suffers from the "curse of dimensionality". Future work is to couple the AMR and WENO methodologies in random space with sparse grid [23,26] and adaptive Analysis Of Variance (ANOVA) [11,18] techniques which are efficient tools known for approximating high-dimensional problems.…”
Section: Conclusion and Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…The scheme is based on a tensor-product construction and hence suffers from the "curse of dimensionality". Future work is to couple the AMR and WENO methodologies in random space with sparse grid [23,26] and adaptive Analysis Of Variance (ANOVA) [11,18] techniques which are efficient tools known for approximating high-dimensional problems.…”
Section: Conclusion and Discussionmentioning
confidence: 99%
“…In such cases, Gibbs-type phenomenon will be observed in gPC approximation, which causes the slow convergence. To alleviate such a challenging issue, multi-element gPC methods [16,17] and multi-element stochastic collocation methods [18,19] were developed to decompose the random space into sub-domains, then employ a gPC expansion in each element. The challenge of the standard multi-element gPC or multi-element stochastic collocation method is to detect the discontinuities in high-dimensional random space and the computational cost.…”
Section: Introductionmentioning
confidence: 99%
“…For a moderate number of dimensions, effective approaches are multi-element and sparse adaptive probabilistic collocation [22,23,34].…”
Section: (B) High-dimensional Random Forcingmentioning
confidence: 99%
“…To compute the statistical properties of the solution to stochastic Burgers problem, we need a representation of the functional relation between the state variables of the system and the random input processes. Well-known approaches are polynomial chaos [19][20][21], multi-element and sparse adaptive probabilistic collocation [22,23], high-dimensional model representations [24], stochastic biorthogonal expansions [25,26] and separated representations [27,28]. These techniques can provide considerable speed-up in computational time when compared to Monte Carlo (MC) or quasi-MC methods, and they are usually effective for the determination of the first few statistical moments of the solution.…”
Section: Introductionmentioning
confidence: 99%
“…The PCE offers an efficient and accurate high-order way of including non-linear effects in stochastic analysis, see e.g. Fajraoui et al (2011);Foo & Karniadakis (2010); Zhang & Lu (2004). One of the attractive features of PCE is the high-order approximation of error propagation (Ghanem & Spanos, 1991; as well as its computational speed when compared to MC (Oladyshkin, Class, Helmig & Nowak, 2011b).…”
Section: Response Surface Via Polynomial Chaos Expansionmentioning
confidence: 99%