2010
DOI: 10.1007/978-90-481-3520-2
|View full text |Cite
|
Sign up to set email alerts
|

Spectral Methods for Uncertainty Quantification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
548
0
2

Year Published

2013
2013
2016
2016

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 825 publications
(552 citation statements)
references
References 0 publications
2
548
0
2
Order By: Relevance
“…Two relevant polynomial approximation strategies that can be conveniently applied to the problem at hand are the Stochastic Galerkin [1,[7][8][9][10] and the Stochastic Collocation methods [2,[11][12][13], which are a projection technique and an interpolation technique, respectively. In this work, we reconsider the quasi-optimal Stochastic Galerkin method proposed in the previous work [3], and provide rigorous convergence results in the special case in which the analyticity region contains a polydisc in the complex plane C N .…”
Section: Introductionmentioning
confidence: 99%
“…Two relevant polynomial approximation strategies that can be conveniently applied to the problem at hand are the Stochastic Galerkin [1,[7][8][9][10] and the Stochastic Collocation methods [2,[11][12][13], which are a projection technique and an interpolation technique, respectively. In this work, we reconsider the quasi-optimal Stochastic Galerkin method proposed in the previous work [3], and provide rigorous convergence results in the special case in which the analyticity region contains a polydisc in the complex plane C N .…”
Section: Introductionmentioning
confidence: 99%
“…It is not seldom to meet in practise deterministic models with a number of unknowns N of order 10 5 . According to (14) and Table 1, the unknown number NxP can be quickly very huge (of order 10 8 ) if the number K of random input parameters is higher than a dozen.…”
Section: Approximation Methodsmentioning
confidence: 99%
“…Under separability condition on the behaviour law, this system of equations can be written in the form of (21) which alleviates the storage space requirement. Dedicated solvers can be applied [1,14] but it does not decrease the size of the equation system. Model Order Reduction Methods like Proper Orthogonal Decomposition (POD), Reduced Basis Method enables to reduce the stochastic problem (9) to solve to an order R ≤≤ N (N is the number of DoF's of the spatial mesh) [49].…”
Section: Intrusive Methodsmentioning
confidence: 99%
“…These last two decades, a growing interest has been devoted to spectral stochastic methods, which provide an explicit representation of the random model output as a function of the basic random parameters modeling the input uncertainties [63,64,97,98,99]. An approximation of the random model output is sought on suitable functional approximation bases.…”
Section: Propagation Of Uncertainties or What Are The Methods To Solvmentioning
confidence: 99%
“…(ii.1) -The first one corresponds to the spectral methods such as the Polynomial Chaos representations (see [63,64] and also [65,66,67,68,69,70,71,72,73]) which can be applied in infinite dimension for stochastic processes and random fields, which allow the effective construction of mapping h to be carried out and which allow any random variable X in L 2 N , to be written as…”
Section: Types Of Representation For the Stochastic Modeling Of Uncermentioning
confidence: 99%