Asymptotic convergence of spectral inverse iterations for stochastic eigenvalue problems

Research output: Contribution to journalArticle


Research units


We consider and analyze applying a spectral inverse iteration algorithm and its subspace iteration variant for computing eigenpairs of an elliptic operator with random coefficients. With these iterative algorithms the solution is sought from a finite dimensional space formed as the tensor product of the approximation space for the underlying stochastic function space, and the approximation space for the underlying spatial function space. Sparse polynomial approximation is employed to obtain the first one, while classical finite elements are employed to obtain the latter. An error analysis is presented for the asymptotic convergence of the spectral inverse iteration to the smallest eigenvalue and the associated eigenvector of the problem. A series of detailed numerical experiments supports the conclusions of this analysis.


Original languageEnglish
Pages (from-to)577-609
Number of pages33
JournalNumerische Mathematik
Issue number3
Publication statusPublished - 1 Jan 2019
MoE publication typeA1 Journal article-refereed

Download statistics

No data available

ID: 32707433