Able: An adaptive block Lanczos method for non-Hermitian Eigenvalue problems

SIAM Journal on Matrix Analysis and Applications

Volumn 20, Issue 4, 1999, Pages 1060-1082

  Bai, Zhaojun ^a   Day, David ^b   Ye, Qiang ^c  

^a UNIVERSITY OF KENTUCKY   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

^c UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Eigenvalue problem; Lanczos method; Non Hermitian matrices; Spectral transformation

Indexed keywords

EID: 0033242222     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479897317806     Document Type: Article

References (54)

1. W. E. ARNOLDI, The principle of minimized iteration in the solution of the matrix eigenproblem, Quart. Appl. Math., 9 (1951), pp. 17-29.
2. Z. BAI, Error analysis of the Lanczos algorithm for the nonsymmetric eigenvalue problem, Math. Comp., 62 (1994), pp. 209-226.
3. Z. BAI, A spectral transformation block nonsymmetric Lanczos algorithm for solving sparse non-Hermitian eigenproblems, in Proc. Fifth SIAM Conference on Applied Linear Algebra, J. G. Lewis, ed., SIAM, Philadelphia, PA, 1994, pp. 307-311.
4. Z. BAI, D. DAY, D. DEMMEL, AND J. DONGARRA, A Test Matrix Collection for Non-Hermitian Eigenvalue Problems, available online from http://math.nist.gov/MatrixMarket.
5. Z. BAI AND G. W. STEWART, SRRIT: A Fortran subroutine to calculate the dominant invariant subspace of a nonsymmetric matrix, ACM Trans. Math. Software, 23 (1997), pp. 494-513.
6. D. BOLEY, S. ELHAY, G. H. GOLUB, AND M. H. GUTKNECHT, Nonsymmetric Lanczos and Finding Orthogonal Polynomials Associated with Indefinite Weights, Numerical Analysis report NA-90-09, Stanford University, Palo Alto, CA, 1990.
7. D. BOLEY AND G. GOLUB, The nonsymmetric Lanczos algorithm and controllability, Systems Control Lett., 16 (1991), pp. 97-105.
8. J. G. L. BOOTEN, H. A. VAN DER VORST, P. M. MEIJER, AND H. J. J. TE RIELE, A Preconditioned Jacobi-Davidson Method for Solving Large Generalized Eigenvalue Problems, Technical report NM-R9414, Dept. of Numerical Math, CWI, Amsterdam, the Netherlands, 1994.
9. F. CHATELIN, Eigenvalues of Matrices, John Wiley, Chichester, England, 1993.
10. J. CULLUM AND W. E. DONATH, A block Lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace of large sparse real symmetric matrices, in Proc. 1974 IEEE Conference on Decision and Control, Phoenix, AZ, 1974, pp. 505-509.
11. J. CULLUM, W. KERNER, AND R. WILLOUGHBY, A generalized nonsymmetric Lanczos procedure, Comput. Phys. Comm., 53 (1989), pp. 19-48.
12. J. CULLUM AND R. WILLOUGHBY, A practical procedure for computing eigenvalues of large sparse nonsymmetric matrices, in Large Scale Eigenvalue Problems, J. Cullum and R. Willoughby, eds., North-Holland, Amsterdam, 1986.
13. E. R. DAVIDSON, The iteration calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices, Comput. Phys., 17 (1975), pp. 87-94.
14. D. DAY, Semi-Duality in the Two-Sided Lanczos Algorithm, Ph.D. thesis, University of California, Berkeley, CA, 1993.
15. I. DUFF AND J. SCOTT, Computing selected eigenvalues of sparse nonsymmetric matrices using subspace iteration, ACM Trans. Math. Software, 19 (1993), pp. 137-159.
16. T. ERICSSON AND A. RUHE, The spectral transformation Lanczos method for the numerical solution of large sparse generalized symmetric eigenvalue problem, Math. Comp., 35 (1980), pp. 1251-1268.
17. R. W. FREUND, M. H. GUTKNECHT, AND N. M. NACHTIGAL, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Comput., 14 (1993), pp. 137-158.
18. R. W. FREUND, N. M. NACHTIGAL, AND J. C. REEB, QMRPACK User's Guide, Technical report ORNL/TM-12807, Oak Ridge National Laboratory, Oak Ridge, TN, 1994.
19. G. GOLUB AND R. UNDERWOOD, The block Lanczos method for computing eigenvalues, in Mathematical Software III, J. Rice, ed., Academic Press, New York, 1977, pp. 364-377.
20. G. GOLUB AND C. VAN LOAN, Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, MD, 1989.
21. W. B. GRAGG, Matrix interpretations and applications of the continued fraction algorithm, Rocky Mountain J. Math., 5 (1974), pp. 213-225.
22. R. GRIMES, J. LEWIS, AND H. SIMON, A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 228-272.
23. M. H. GUTKNECHT, A completed theory of the unsymmetric Lanczos process and related algorithms, Parts I and II, SIAM J. Matrix Anal. Appl., Part I, 13 (1992), pp. 594-639, Part II, 15 (1994), pp. 15-58.
24. M. H. GUTKNECHT, A completed theory of the unsymmetric Lanczos process and related algorithms, Parts I and II, SIAM J. Matrix Anal. Appl., Part I, 13 (1992), pp. 594-639, Part II, 15 (1994), pp. 15-58.
25. Z. JIA, Generalized block Lanczos methods for large unsymmetric eigenproblems, Numer. Math., 80 (1998), pp. 239-266.
26. W. KAHAN, B. N. PARLETT, AND E. JIANG, Residual bounds on approximate eigensystems of nonnormal matrices, SIAM J. Numer. Anal., 19 (1982), pp. 470-484.
27. T. KATO, Perturbation Theory for Linear Operators, 2nd ed., Springer-Verlag, Berlin, 1980.
28. W. KERNER, Large-scale complex eigenvalue problems, J. Comput. Phys., 85 (1989), pp. 1-85.
29. C. LANCZOS, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Natl. Bur. Stand, 45 (1950), pp. 225-280.
30. R. LEHOUCQ, Analysis and Implementation of an Implicitly Restarted Arnoldi Iterations, Ph.D. thesis, Rice University, Houston, Texas, 1995.
31. R. LEHOUCQ AND J. A. SCOTT, An Evaluation of Software for Computing Eigenvalues of Sparse Nonsymmetric Matrices, Preprint MCS-P547-1195, Argonne National Laboratory, Argonne, IL, 1996.
32. R. LEHOUCQ, D. SORENSEN, AND C. YANG, ARPACK Users' Guide: Solution of Large Scale Eigenvalue Problems by Implicitly Restarted Arnoldi Methods, SIAM, Phildelphia, PA, 1998.
33. K. MEERBERGEN AND A. SPENCE, Implicitly Restarted Arnoldi with Purification for the Shift-Invert Transformation, report tw 225, Dept. of Comput. Sci., Katholieke Universiteit Leuven, Belgium, 1995.
34. C. PAIGE, The Computation of Eigenvalues and Eigenvectors of Very Large Sparse Matrices, Ph.D. thesis, London University, London, UK, 1971.
35. B. PARLETT, The Rayleigh quotient algorithm iteration and some generalizations for nonnormal matrices, Math. Comp., 28 (1974), pp. 679-693.
36. B. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
37. B. PARLETT, Reduction to tridiagonal form and minimal realizations, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 567-593.
38. B. PARLETT AND Y. SAAD, Complex shift and invert strategies for real matrices, Linear Algebra Appl., 88/89 (1987), pp. 575-595.
39. B. N. PARLETT, D. R. TAYLOR, AND Z. A. LIU, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp., 44 (1985), pp. 105-124.
40. A. RUHE, Implementation aspects of band Lanczos algorithms for computation of eigenvalues of large sparse symmetric matrices, Math. Comp., 33 (1979), pp. 680-687.
41. A. RUHE, Rational Krylov, a Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils, Computer Science Division UCB/CSD-95-871, University of California, Berkeley, CA, 1995.
42. Y. SAAD, On the rates of convergence of the Lanczos and block Lanczos methods, SIAM J. Numer. Anal., 17 (1980), pp. 687-706.
43. Y. SAAD, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra Appl., 34 (1980), pp. 269-295.
44. Y. SAAD, Numerical Methods for Large Eigenvalue Problems, Halsted Press (division of John Wiley), New York, 1992.
45. M. SADKANE, Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems, Numer. Math., 64 (1993), pp. 195-211.
46. M. SADKANE, A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices, Numer. Math., 64 (1993), pp. 181-193.
47. H. SIMON, The Lanczos algorithm with partial reorthogonalization, Math. Comp., 42 (1984), pp. 115-142.
48. G. L. G. SLEIJPEN AND H. A. VAN DER VORST, A Jacobi-Davidson iteration method for linear eigenvalue problems, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 401-425.
49. D. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
50. G. W. STEWART, Error and perturbation bounds for subspaces associated with certain eigenvalue problems, SIAM Rev., 15 (1973), pp. 727-764.
51. W. J. STEWART AND A. JENNINGS, Algorithm 570 LOPSI: A simultaneous iteration algorithm for real matrices, ACM Trans. Math. Software, 7 (1981), pp. 230-232.
52. L. N. TREFETHEN, Pseudospectra of matrices, in Numerical Analysis 1991, Dundee, Scotland, Longman Sci. Tech., Harlow, 1992.
53. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Oxford University Press, Oxford, UK, 1965.
54. Q. YE, A breakdown-free variation of the nonsymmetric Lanczos algorithms, Math. Comp., 62 (1994), pp. 179-207.