Inexact methods for symmetric stochastic eigenvalue problems

From MaRDI portal
Publication:4611535

DOI10.1137/18M1176026zbMATH Open1405.65052arXiv1811.00745MaRDI QIDQ4611535FDOQ4611535


Authors: Kookjin Lee, Bedřich Sousedík Edit this on Wikidata


Publication date: 21 January 2019

Published in: SIAM/ASA Journal on Uncertainty Quantification (Search for Journal in Brave)

Abstract: We study two inexact methods for solutions of random eigenvalue problems in the context of spectral stochastic finite elements. In particular, given a parameter-dependent, symmetric matrix operator, the methods solve for eigenvalues and eigenvectors represented using polynomial chaos expansions. Both methods are based on the stochastic Galerkin formulation of the eigenvalue problem and they exploit its Kronecker-product structure. The first method is an inexact variant of the stochastic inverse subspace iteration [B. Soused'{i}k, H. C. Elman, SIAM/ASA Journal on Uncertainty Quantification 4(1), pp. 163--189, 2016]. The second method is based on an inexact variant of Newton iteration. In both cases, the problems are formulated so that the associated stochastic Galerkin matrices are symmetric, and the corresponding linear problems are solved using preconditioned Krylov subspace methods with several novel hierarchical preconditioners. The accuracy of the methods is compared with that of Monte Carlo and stochastic collocation, and the effectiveness of the methods is illustrated by numerical experiments.


Full work available at URL: https://arxiv.org/abs/1811.00745




Recommendations




Cites Work


Cited In (11)





This page was built for publication: Inexact methods for symmetric stochastic eigenvalue problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4611535)