Thumbnail Image
Publication

Randomized Subspace Iteration Method for Eigenvalue Problems

Kapur, Nikita
Citations
Altmetric:
Abstract
This thesis presents the randomized subspace iteration method for eigenvalue problems. In our analysis, we have considered symmetric positive definite eigenvalue problem. We present deterministic and probabilistic bounds for three quantities. First, we present the deterministic and probabilistic bounds for the canonical angles between the exact and the approximate eigenvector subspaces. Second, we give deterministic and probabilistic bounds for the sine of angle between the eigenvectors of the exact eigenvector subspace and the approximated eigenvector subspace. Third, we also present deterministic and probabilistic bounds for the accuracy of eigenvalues using the randomized subspace iteration. The probabilistic bounds are provided when a Gaussian random matrix is used as the initial subspace. Finally, we illustrate our theoretical results numerically using several different test matrices.
Description
Date
2021-05-31
Journal Title
Journal ISSN
Volume Title
Publisher
University of Kansas
Collections
Theses
Show all metadata
Files
Thumbnail Image
Kapur_ku_0099M_17789_DATA_1.pdf
Adobe PDF, 774.3 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Mathematics, Deterministic Bounds, Probabilistic Bounds, Randomized Subspace Iteration Method
Citation
URI
https://hdl.handle.net/1808/35177
DOI
Embedded videos