๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The matrix eigenvalue problem: GR and Krylov subspace methods

โœ Scribed by David S. Watkins

Book ID
127456867
Publisher
Society for Industrial and Applied Mathematics
Year
2007
Tongue
English
Weight
3 MB
Edition
1
Category
Library
City
Philadelphia
ISBN
0898716411

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 generic GR algorithm, including special cases (for example, QR, SR, HR), and the development of Krylov subspace methods. Also addressed are a generic Krylov process and the Arnoldi and various Lanczos algorithms, which are obtained as special cases. The chapter on product eigenvalue problems provides further unification, showing that the generalized eigenvalue problem, the singular value decomposition problem, and other product eigenvalue problems can all be viewed as standard eigenvalue problems.

The author provides theoretical and computational exercises in which the student is guided, step by step, to the results. Some of the exercises refer to a collection of MATLABร‚ยฎ programs compiled by the author that are available on a Web site that supplements the book.

**Audience: 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. This book is intended for graduate students in numerical linear algebra. It will also be useful as a reference for researchers in the area and for users of eigenvalue codes who seek a better understanding of the methods they are using.

Contents: Preface; Chapter 1: Preliminary Material; Chapter 2: Basic Theory of Eigensystems; Chapter 3: Elimination; Chapter 4: Iteration; Chapter 5: Convergence; Chapter 6: The Generalized Eigenvalue Problem; Chapter 7: Inside the Bulge; Chapter 8: Product Eigenvalue Problems; Chapter 9: Krylov Subspace Methods; Bibliography; Index.**

๐Ÿ“œ SIMILAR VOLUMES

Eigenvalue perturbation and generalized
Eigenvalue perturbation and generalized Krylov subspace method
โœ T. Zhang; G.H. Golub; K.H. Law ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 909 KB

In this paper, we study the computational aspect of eigenvalue perturbation theory. In previous research, high order perturbation terms were often derived from Taylor series expansion. Computations based on such an approach can be both unstable and highly complicated. We present here an approach bas

Deflated block Krylov subspace methods f
Deflated block Krylov subspace methods for large scale eigenvalue problems
โœ Qiang Niu; Linzhang Lu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 530 KB

We discuss a class of deflated block Krylov subspace methods for solving large scale matrix eigenvalue problems. The efficiency of an Arnoldi-type method is examined in computing partial or closely clustered eigenvalues of large matrices. As an improvement, we also propose a refined variant of the A

Comparison of Krylov subspace methods on
Comparison of Krylov subspace methods on the PageRank problem
โœ Gianna M. Del Corso; Antonio Gullรญ; Francesco Romani ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 289 KB

PageRank algorithm plays a very important role in search engine technology and consists in the computation of the eigenvector corresponding to the eigenvalue one of a matrix whose size is now in the billions. The problem incorporates a parameter that determines the difficulty of the problem. In this