2021
DOI: 10.1137/20m1315774
|View full text |Cite
|
Sign up to set email alerts
|

Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
55
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 156 publications
(55 citation statements)
references
References 105 publications
0
55
0
Order By: Relevance
“…The construction of a surrogate model of implicit function h c by using a deterministic approach, such as the meshless methods [27,28,29,30,31,32], is not adapted taking into account a possible high dimension of the space on which h c is defined. Similarly, the construction of a representation on the chaos (Gaussian or another probability measure) [33,34,35,36,37,38,39,40,41,42,43] would not be at all effective in our case for the same reasons related to the possible high dimension. To circumvent this difficulty, we generalize the approach proposed in [26], which consists in constructing a statistical surrogate model ĥN of h c , depending on the number N of points generated in the constrained learned set, for which its gradient has an explicit algebraic representation.…”
Section: Introductionmentioning
confidence: 91%
“…The construction of a surrogate model of implicit function h c by using a deterministic approach, such as the meshless methods [27,28,29,30,31,32], is not adapted taking into account a possible high dimension of the space on which h c is defined. Similarly, the construction of a representation on the chaos (Gaussian or another probability measure) [33,34,35,36,37,38,39,40,41,42,43] would not be at all effective in our case for the same reasons related to the possible high dimension. To circumvent this difficulty, we generalize the approach proposed in [26], which consists in constructing a statistical surrogate model ĥN of h c , depending on the number N of points generated in the constrained learned set, for which its gradient has an explicit algebraic representation.…”
Section: Introductionmentioning
confidence: 91%
“…The method of the SPCE method has attracted much attention in the community of probabilistic analysis and uncertainty quantification [19,20]. In this section, the SPCE method is introduced as follows.…”
Section: Sparse Polynomial Chaos Expansionsmentioning
confidence: 99%
“…The first order reliability method requires an explicit expression of the limit-state function, which is, however, not always available. The method of sparse polynomial chaos expansions combined with Monte Carlo Simulations has been widely used in probabilistic analysis of classical geotechnical problems, such as slopes, tunnels, retaining walls, and foundations [14,15,19]. The benefit of the sparse polynomial chaos expansions (SPCE) is that it has higher computational efficiency compared with common polynomial chaos expansions, making it applicable to high-dimensional problems with accurate results of probabilistic analysis.…”
Section: Introductionmentioning
confidence: 99%
“…A powerful class of methods are regression-based approaches that rely on an initial input sample X , called experimental design, and corresponding model evaluations M(X ) (See, e.g. Lüthen et al (2020) for a recent survey). Additionally, it is possible to design adaptive algorithms that choose the truncated basis size (Blatman and Sudret, 2011;Jakeman et al, 2015).…”
Section: Spectral Function Decompositionmentioning
confidence: 99%