For the SIAM Classics edition, the author has added over 60 pages of material covering recent results and discussing the important advances made in the last two decades. It is an excellent research reference for all those interested in operator theory, linear algebra, and numerical analysis.

This revised edition discusses numerical methods for computing eigenvalues and eigenvectors of large sparse matrices. It provides an in-depth view of the numerical methods that are applicable for solving matrix eigenvalue problems that arise in various engineering and scientific applications. Each chapter was updated by shortening or deleting outdated topics, adding topics of more recent interest, and adapting the Notes and References section. Significant changes have been made to Chapters 6 through 8, which describe algorithms and their implementations and now include topics such as the implicit restart techniques, the Jacobi-Davidson method, and automatic multilevel substructuring.

This text presents selected aspects of matrix theory that are most useful in developing computational methods for solving linear equations and finding characteristic roots. Topics include norms, bounds and convergence; localization theorems; more. 1964 edition.

This book is a comprehensive survey of matrix perturbation theory, a topic of interest to numerical analysts, statisticians, physical scientists, and engineers. In particular, the authors cover perturbation theory of linear systems and least square problems, the eignevalue problem, and the generalized eignevalue problem as wellas a complete treatment of vector and matrix norms, including the theory of unitary invariant norms.

A rigorous introduction to the basic theory of random matrices designed for graduate students with a background in probability theory.