.png){kind=icon}
返回
Uncertain eigenvalue analysis by the sparse grid stochastic collocation method
.png){kind=icon}
PRE
AI
DOI：10.1007/s10409-015-0422-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, the eigenvalue problem with multiple uncertain parameters is analyzed by the sparse grid stochastic collocation method. This method provides an interpolation approach to approximate eigenvalues and eigenvectors' functional dependencies on uncertain parameters. This method repetitively evaluates the deterministic solutions at the pre-selected nodal set to construct a high-dimensional interpolation formula of the result. Taking advantage of the smoothness of the solution in the uncertain space, the sparse grid collocation method can achieve a high order accuracy with a small nodal set. Compared with other sampling based methods, this method converges fast with the increase of the number of points. Some numerical examples with different dimensions are presented to demonstrate the accuracy and efficiency of the sparse grid stochastic collocation method.
Keyword:
Uncertainty quantification
Eigenvalue
Eigenvector
Sparse grid
Stochastic collocation method
Eigenvector pairing
期刊
A
IF:
4.6
论文数:
2.9K
被引数:
4.7K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容