2008
DOI: 10.1016/j.cma.2008.06.012
|View full text |Cite
|
Sign up to set email alerts
|

Generalized spectral decomposition method for solving stochastic finite element equations: Invariant subspace problem and dedicated algorithms

Abstract: Stochastic Galerkin methods have become a significant tool for the resolution of stochastic partial differential equations (SPDE). However, they suffer from prohibitive computational times and memory requirements when dealing with large scale applications and high stochastic dimensionality. Some alternative techniques, based on the construction of suitable reduced deterministic or stochastic bases, have been proposed in order to reduce these computational costs. Recently, a new approach, based on the concept o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
153
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
7
3

Relationship

1
9

Authors

Journals

citations
Cited by 129 publications
(153 citation statements)
references
References 35 publications
0
153
0
Order By: Relevance
“…[66,139,29,95,43,22]. Recently, a generalization of the classical spectral decomposition (truncated K-L expansion) for the solution of the problem interpreted as an ''extended" eigenproblem has been proposed together with ad hoc iterative solution techniques inspired by classical techniques for solving the eigenproblem [122,123]. This method leads to further computational savings and reduction of memory requirements compared to Krylov-type techniques in the solution of linear problems.…”
Section: The Spectral Stochastic Finite Element Methods -Ssfemmentioning
confidence: 99%
“…[66,139,29,95,43,22]. Recently, a generalization of the classical spectral decomposition (truncated K-L expansion) for the solution of the problem interpreted as an ''extended" eigenproblem has been proposed together with ad hoc iterative solution techniques inspired by classical techniques for solving the eigenproblem [122,123]. This method leads to further computational savings and reduction of memory requirements compared to Krylov-type techniques in the solution of linear problems.…”
Section: The Spectral Stochastic Finite Element Methods -Ssfemmentioning
confidence: 99%
“…Several strategies have been proposed for the extraction of reduced bases from approximate Karhunen-Loeve expansions (or classical spectral decompositions) of the solution [113,103]. Another method, called Generalized Spectral Decomposition method, has been recently proposed for the construction of such representations without knowing a priori the solution nor an approximation of it [69,114,70]. A major advantage of these algorithms is that they allow a separation of deterministic problems for the computation of deterministic functions and stochastic algebraic equations for the computation of stochastic functions.…”
Section: Propagation Of Uncertainties or What Are The Methods To Solvmentioning
confidence: 99%
“…Detailed discussion on the efficient solution of the linear system in Equation (39) is beyond the scope of the current work, and hence, the reader is referred to a review of the important literature in this domain [38,39].…”
Section: Solution Methodologymentioning
confidence: 99%