Convergence of the Arnoldi Iteration for Estimating Extreme Eigenvalues
Name
chen-cdchen-meng-eecs-2025-thesis.pdf
Description
Thesis PDF
Size
622.29 KB
Format
Adobe PDF
Checksum (MD5)
30f3b0fc72bf43e025b50f66b3696c5b
Author(s)
Chen, Cecilia
Advisor(s)
Urschel, John
Date Issued
February 2025
Publisher
Massachusetts Institute of Technology
Abstract
Krylov subspace methods, like the Arnoldi iteration, are a powerful tool for efficiently solving high-dimensional linear algebra problems. In this work, we analyze the convergence of Krylov methods for estimating the numerical range of a matrix. Prior bounds on approximation error often depend on eigenvalue gaps of the matrix, which lead to weaker bounds than observed in practice, specifically in applications where these gaps are small. Instead, we extend a line of work proving gap-independent bounds for the Lanczos method, which depend only on the matrix dimensions and number of iterations, to the more general Arnoldi case.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Copyright retained by author(s)
Persistent DSpace Link
