The Matrix Eigenvalue Problem: GR and Krylov Subspace Methods

Presents the first in-depth, complete, and unified theoretical discussion of the two most important classes of algorithms for solving matrix eigenvalue problems: QR-like algorithms for dense problems and Krylov subspace methods for sparse problems.