Convergence of the block Lanczos method for eigenvalue clusters

The Lanczos method is often used to solve a large scale symmetric matrix eigenvalue problem. It is well-known that the single-vector Lanczos method can only find one copy of any multiple eigenvalue (unless certain deflating strategy is incorporated) and encounters slow convergence towards clustered eigenvalues. On the other hand, the block Lanczos method can compute all or some of the copies of a multiple eigenvalue and, with a suitable block size, also compute clustered eigenvalues much faster. The existing convergence theory due to Saad for the block Lanczos method, however, does not fully reflect this phenomenon since the theory was established to bound approximation errors in each individual approximate eigenpairs. Here, it is argued that in the presence of an eigenvalue cluster, the entire approximate eigenspace associated with the cluster should be considered as a whole, instead of each individual approximate eigenvectors, and likewise for approximating clusters of eigenvalues. In this paper, we obtain error bounds on approximating eigenspaces and eigenvalue clusters. Our bounds are much sharper than the existing ones and expose true rates of convergence of the block Lanczos method towards eigenvalue clusters. Furthermore, their sharpness is independent of the closeness of eigenvalues within a cluster. Numerical examples are presented to support our claims.

[1]  Chandler Davis,et al.  Perturbation of spectral subspaces and solution of linear operator equations , 1983 .

[2]  P. Wedin.  On angles between subspaces of a finite dimensional inner product space , 1983 .

[3]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[4]  Arno B. J. Kuijlaars,et al.  Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory , 2006, SIAM Rev..

[5]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[6]  Gene H. Golub,et al.  The block Lanczos method for computing eigenvalues , 2007, Milestones in Matrix Computation.

[7]  Christopher C. Paige,et al.  The computation of eigenvalues and eigenvectors of very large sparse matrices , 1971 .

[8]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[9]  Y. Saad.  On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods , 1980 .

[10]  V. N. Bogaevski,et al.  Matrix Perturbation Theory , 1991 .

[11]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .

[12]  W. Kahan,et al.  The Rotation of Eigenvectors by a Perturbation. III , 1970 .

[13]  Zhongxiao Jia,et al.  An analysis of the Rayleigh-Ritz method for approximating eigenspaces , 2001, Math. Comput..

[14]  Ren-Cang Li,et al.  Sharpness in rates of convergence for the symmetric Lanczos method , 2010, Math. Comput..

[15]  J. Cullum,et al.  A block Lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace of large, sparse, real symmetric matrices , 1974, CDC 1974.

[16]  James Demmel,et al.  Applied Numerical Linear Algebra , 1997 .

[17]  Arno B. J. Kuijlaars,et al.  Which Eigenvalues Are Found by the Lanczos Method? , 2000, SIAM J. Matrix Anal. Appl..

[18]  S. Kaniel.  Estimates for Some Computational Techniques - in Linear Algebra , 1966 .

[19]  J. Junker.  Introduction To Approximation Theory , 2016 .

[20]  Chandler Davis,et al.  An extremal problem in Fourier analysis with applications to operator theory , 1989 .

[21]  J. Cullum,et al.  Lanczos algorithms for large symmetric eigenvalue computations , 1985 .

[22]  Eckhard Hitzer,et al.  Angles between subspaces , 2013, 1306.1629.

[23]  C. Lanczos.  An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[24]  J. Cullum,et al.  Lanczos Algorithms for Large Symmetric Eigenvalue Computations Vol. I Theory , 1984 .

[25]  Ren-Cang Li,et al.  On Meinardus' examples for the conjugate gradient method , 2008, Math. Comput..

[26]  Chandler Davis.  The rotation of eigenvectors by a perturbation , 1963 .

[27]  Qiang Ye,et al.  An adaptive block Lanczos algorithm , 1996, Numerical Algorithms.