The Matrix Eigenvalue Problem: GR and Krylov Subspace Methods

✍ Scribed by David S. Watkins

Publisher: Society for Industrial Mathematics
Year: 2007
Tongue: English
Leaves: 451
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

The Matrix Eigenvalue Problem: GR and Kr

📁 The Matrix Eigenvalue Problem: GR and Krylov Subspace Methods

✍ David S. Watkins 📂 Library 📅 2007 🏛 Society for Industrial Mathematics 🌐 English

After working on the reduction of IC interconnect networks for months, I am eager to find a book about matrix eigenvalue computations. Although there are several famous bibles in this field, like "The Algebraic Eigenvalue Problem" by James Wilkinson, they are not so up-to-date that some important to

The Matrix Eigenvalue Problem: GR and Kr

📁 The Matrix Eigenvalue Problem: GR and Krylov Subspace Methods

✍ David S. Watkins 📂 Library 📅 2008 🏛 Society for Industrial Mathematics 🌐 English

This book 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. The author discusses the theory of the ge

The Matrix Eigenvalue Problem. GR and Kr

📁 The Matrix Eigenvalue Problem. GR and Krylov Subspace Methods

✍ David S. Watkins 📂 Library 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English

The matrix eigenvalue problem: GR and Kr

📁 The matrix eigenvalue problem: GR and Krylov subspace methods

✍ David S. Watkins 📂 Library 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English

Matrix Computations and Semiseparable Ma

📁 Matrix Computations and Semiseparable Matrices - Eigenvalue and Singular Value Methods

✍ Raf Vandebril, Marc van Van Barel, Nicola Mastronardi 📂 Library 📅 2008 🏛 JHU 🌐 English

<P>The general properties and mathematical structures of semiseparable matrices were presented in volume 1 of Matrix Computations and Semiseparable Matrices. In volume 2, Raf Vandebril, Marc Van Barel, and Nicola Mastronardi discuss the theory of structured eigenvalue and singular value computations

Matrix Computations and Semiseparable Ma

📁 Matrix Computations and Semiseparable Matrices: Eigenvalue and Singular Value Methods

✍ Raf Vandebril, Marc Van Barel, Nicola Mastronardi 📂 Library 📅 2008 🏛 Johns Hopkins University Press 🌐 English

<P>The general properties and mathematical structures of semiseparable matrices were presented in volume 1 of <I>Matrix Computations and Semiseparable Matrices</I>. In volume 2, Raf Vandebril, Marc Van Barel, and Nicola Mastronardi discuss the theory of structured eigenvalue and singular value comp