.png){kind=icon}
.png){kind=icon}
Return
LOW-RANK SOLUTION METHODS FOR STOCHASTIC EIGENVALUE PROBLEMS
.png){kind=icon}
OA
AI
DOI：10.1137/18M122100X.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint PDEs with random data, where the underlying operators depend linearly on the random parameters. With the stochastic Galerkin approach, the solutions are represented as generalized polynomial chaos expansions. When these solutions can be approximated well by low-rank objects, we introduce a low-rank variant of the inverse subspace iteration algorithm for computing one or several minimal eigenvalues and corresponding eigenvectors of parameter-dependent matrices. In the algorithm, the iterates are approximated by low-rank matrices, which leads to significant cost savings. The algorithm is tested on two benchmark problems: a stochastic diffusion problem with some poorly separated eigenvalues and an operator derived from a discrete stochastic Stokes problem whose minimal eigenvalue is related to the inf-sup stability constant. Numerical experiments show that the low-rank algorithm produces accurate solutions compared to the Monte Carlo method, and it uses much less computational time than the original algorithm without low-rank approximation.
Keywords:
stochastic eigenvalue problem
inverse subspace iteration
low-rank approximation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W