.png){kind=icon}
.png){kind=icon}
Return
Approximate methods for stochastic eigenvalue problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2014.12.112.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
sFEM
Stochastic eigenvalue problem
Stochastic collocation
Stochastic Galerkin method
Inverse iteration
Sparse grids
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W