Efficient solution for Galerkin-based polynomial chaos expansion systems (Q614007)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient solution for Galerkin-based polynomial chaos expansion systems |
scientific article; zbMATH DE number 5829344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient solution for Galerkin-based polynomial chaos expansion systems |
scientific article; zbMATH DE number 5829344 |
Statements
Efficient solution for Galerkin-based polynomial chaos expansion systems (English)
0 references
23 December 2010
0 references
stochastic finite elements
0 references
polynomial chaos expansion
0 references
computational efficiency
0 references
iterative solvers
0 references
preconditioners
0 references
uncertainty quantification
0 references
numerical examples
0 references
conjugate gradient method
0 references
Galerkin method
0 references
incomplete Cholesky method
0 references
algorithms
0 references
0 references
0 references
0 references
0.7815324068069458
0 references
0.7712140083312988
0 references
0.7653109431266785
0 references
0.7653098702430725
0 references
0.7533449530601501
0 references
