.png){kind=icon}
返回
Approximate methods for stochastic eigenvalue problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2014.12.112.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the discretization and solution of eigenvalue problems of elliptic operators with random coefficients. For solving the resulting systems of equations we present a new and efficient spectral inverse iteration based on the stochastic Galerkin approach with respect to a polynomial chaos basis. The curse of dimensionality inherent in normalization over parameter spaces is avoided by a solution of a non-linear system of equations defining the Galerkin coefficients. For reference we also present an algorithm for adaptive stochastic collocation. Functionality of the algorithms is demonstrated by applying them on four examples of a given model problem. Convergence of the Galerkin-based method is analyzed and the results are tested against the collocated reference solutions and theoretical predictions. (C) 2015 Elsevier Inc. All rights reserved.
Keyword:
sFEM
Stochastic eigenvalue problem
Stochastic collocation
Stochastic Galerkin method
Inverse iteration
Sparse grids
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Physical systems with random uncertainties: Chaos representations with arbitrary probability measure
OAAI
OAAI分享收藏Current-voltage characteristics and quasi-two-dimensional vortex-glass transition in epitaxial Bi2Sr2Ca2Cu3Ox films电流-电压特性及外延Bi₂Sr₂Ca₂Cu₃Oₓ薄膜中的准二维涡旋玻璃态转变.png)
Cryogenics
CryogenicsIF0
PREAI
分享收藏分享收藏
查看更多内容