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. The author discusses the theory of the generic GR algorithm, including special cases (for example, QR, SR, HR), and the development of Krylov subspace methods. This book also addresses a generic Krylov process and the Arnoldi and various Lanczos algorithms, which are obtained as special cases. Theoretical and computational exercises guide students, step by step, to the results. Downloadable MATLAB programs, compiled by the author, are available on a supplementary Web site. Readers of this book are expected to be familiar with the basic ideas of linear algebra and to have had some experience with matrix computations. Ideal for graduate students, or as a reference book for researchers and users of eigenvalue codes.
Buy Matrix Eigenvalue Problem book by David S. Watkins from Australia's Online Bookstore, Boomerang Books.
(247mm x 174mm x 23mm)
Society for Industrial & Applied Mathematics,U.S.
Publisher: Society for Industrial & Applied Mathematics,U.S.
Country of Publication:
Author Biography - David S. Watkins
David S. Watkins is professor of mathematics at Washington State University.