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

Efficient solution for Galerkin-based polynomial chaos expansion systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 18 publications
(6 citation statements)
references
References 24 publications
0
6
0
Order By: Relevance
“…In this section, the developed techniques are applied to a NASTRAN model of a satellite with 900 QUAD4 elements (∼ 5300 DOF) [18]. The model is available in the OpenCossan software [20].…”
Section: Problem Descriptionmentioning
confidence: 99%
“…In this section, the developed techniques are applied to a NASTRAN model of a satellite with 900 QUAD4 elements (∼ 5300 DOF) [18]. The model is available in the OpenCossan software [20].…”
Section: Problem Descriptionmentioning
confidence: 99%
“…Therefore, novel strategies have been introduced, which determine adequate values for their input parameters, e.g. drop tolerance or convergence threshold (see [27] for details). It should be however noted that the proposed approaches do not remove the already existing drawbacks or limitations of the selected preconditioner, iterative solver or the P-C method itself.…”
Section: Efficient Implementations and Strategies For Stochastic Analmentioning
confidence: 99%
“…In these cases, the sparsity of the corresponding deterministic matrix that has to be inverted is decreased, leading in a dramatic increase of the required computational effort. Stochastic adaptivity and model reduction techniques for the SSFEM have been proposed in in an effort to reduce the overall problem dimensionality and augment the sparsity of the deterministic matrix, in tandem with efficient preconditioning and domain decomposition‐based approaches which reduce the computational cost encountered in the inversion of coupled deterministic problems . Regarding the PDD method, an adaptive variant was recently introduced in where global sensitivity indices are used to truncate the PDD.…”
Section: Introductionmentioning
confidence: 99%