Approximate methods for stochastic eigenvalue problems

H. Hakula, V. Kaarnioja and M. Laaksonen

Applied Mathematics and Computation, 2015, vol. 267, issue C, 664-681

Abstract: 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.

Keywords: sFEM; Stochastic eigenvalue problem; Stochastic collocation; Stochastic Galerkin method; Inverse iteration; Sparse grids (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314017731
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:267:y:2015:i:c:p:664-681

DOI: 10.1016/j.amc.2014.12.112

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().