Which Eigenvalues Are Found by the Lanczos
نویسنده
چکیده
When discussing the convergence properties of the Lanczos iteration method for the real symmetric eigenvalue problem, Trefethen and Bau noted that the Lanczos method tends to find eigenvalues in regions that have too little charge when compared to an equilibrium distribution. In this paper a quantitative version of this rule of thumb is presented. We describe, in an asymptotic sense, the region containing those eigenvalues that are well approximated by the Ritz values. The region depends on the distribution of eigenvalues and on the ratio between the size of the matrix and the number of iterations, and it is characterized by an extremal problem in potential theory which was first considered by Rakhmanov. We give examples showing the connection with the equilibrium distribution.
منابع مشابه
Which Eigenvalues Are Found by the Lanczos Method?
When discussing the convergence properties of the Lanczos iteration method for the real symmetric eigenvalue problem, Trefethen and Bau noted that the Lanczos method tends to find eigenvalues in regions that have too little charge when compared to an equilibrium distribution. In this paper a quantitative version of this rule of thumb is presented. We describe, in an asymptotic sense, the region...
متن کاملAn Implicitly Restarted Lanczos Method for Large Symmetric Eigenvalue Problems
The Lanczos process is a well known technique for computing a few, say k, eigenvalues and associated eigenvectors of a large symmetric n×n matrix. However, loss of orthogonality of the computed Krylov subspace basis can reduce the accuracy of the computed approximate eigenvalues. In the implicitly restarted Lanczos method studied in the present paper, this problem is addressed by fixing the num...
متن کاملParallel Efficiency of the Lanczos Method for Eigenvalue Problems
Two of the commonly used versions of the Lanczos method for eigenvalues problems are the shift-and-invert Lanczos method and the restarted Lanczos method. In this talk, we will address two questions, is the shift-and-invert Lanczos method a viable option on massively parallel machines and which one is more appropriate for a given eigenvalue problem?
متن کاملNA - 90 - 06 * . . The Nonsymmetric Lanczos Algorithm May 1990 and Controllability
We give a brief description of a non-symmetric Lanczos algorithm that does not require strict bi-orthogonality among the generated vectors. We show how the vectors generated are algebraically related to “Controllable Space” and “Observable Space” for a related linear dynamical system. The algorithm described is particularly appropriate for large sparse systems. 1. Intr~uction The Lanczos Algori...
متن کاملExperiences with a Lanczos Eigensolver in High-Precision Arithmetic
We investigate the behavior of the Lanczos process when it is used to find all the eigenvalues of large sparse symmetric matrices. We study the convergence of classical Lanczos (i.e., without reorthogonalization) to the point where there is a cluster of Ritz values around each eigenvalue of the input matrix A. At that point, convergence to all the eigenvalues can be ascertained if A has no mult...
متن کامل