Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems

BIT Numerical Mathematics

Volumn 36, Issue 3, 1996, Pages 470-493

  Cullum, Jane ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Arnoldi methods; Lanczos methods; Matrix eigenvalue problems

Indexed keywords

EID: 0001126627     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01731928     Document Type: Article

References (31)

1. Z. Bai, Error analysis of the Lanczos algorithm for nonsymmetric eigenvalue problem, Math. Comp., 62 (1994), pp. 209-226.
2. M. Bennani and T. Braconnier, Comparative behaviour of eigensolvers on highly nonnormal matrices. CERFACS Technical Report TR-PA-94-23, 1994, CERFACS, Toulouse, France.
3. T. Braconnier, Influence of orthogonality on the backward error and the stopping criterion for Krylov methods, Report No. 281, December 1995, Manchester Centre for Computational Mathematics, University of Manchester, Manchester, England.
4. T. Braconnier, F. Chatelin, and V. Frayssé, The influence of large nonnormality on the quality of convergence of iterative methods in linear algebra, Technical Report TR-PA-94-07, 1994, CERFACS, Toulouse, France.
5. C. Brezinski, M. Redivo Zaglia, and H. Sadok, A breakdown-free Lanczos type algorithm for solving linear systems, Numer. Math., 63 (1992), pp. 29-38.
6. F. Chaitin-Chatelin, Is nonnormality a serious difficulty?, Technical Report TR-PA-94-18, 1994, CERFACS, Toulouse, France.
7. F. Chaitin-Chatelin, Finite precision computations, reliability of numerical software, Technical Report TR-PA-94-05, 1994, CERFACS, Toulouse, France.
8. F. Chaitin-Chatelin and V. Frayssé, Lectures on Finite Precision Computation, SIAM Publications, Philadelphia, PA, 1996.
9. F. Chatelin and V. Frayssé, numerical illustrations by T. Braconnier, Qualitative computing, elements for a theory for finite precision computation, Technical Report TR-PA-93-12, 1993, CERFACS, Toulouse, France.
10. J. Cullum, Iterative methods for solving Ax = b, GMRES/FOM versus QMR/BICG, IBM Research Report, RC20325, January 1996, T. J. Watson Research Center, Yorktown Heights, NY; to appear in Advances in Computational Mathematics.
11. J. Cullum, Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems, IBM Research Report, RC20303, December 1995, T. J. Watson Research Center, Yorktown Heights, NY.
12. J. Cullum, Lanczos algorithms for large scale symmetric and nonsymmetric matrix eigenvalues problems, in Proceedings of the Cornelius Lanczos International Centenary Conference, J. David Brown, Moody T. Chu, D. C. Ellison, and Robert J. Plemmons, eds., SIAM, Philadelphia, PA, 1994, pp. 11-31.
13. J. Cullum, W. Kerner, and R. Willoughby, A generalized nonsymmetric Lanczos procedure, Comput. Phys. Comm., 53 (1989), pp. 19-48.
14. 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, 1986, pp. 193-240.
15. 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. Stat. Computing, 14 (1993), pp. 137-58.
16. F. R. Gantmacher, The Theory of Matrices, Vol. 1, Chelsea Publishing Company, New York, NY, 1977.
17. A. Greenbaum, V. Ptak, and Z. Strakos, Any nonincreasing convergence curve is possible for GMRES, SIAM J. Matrix Anal. Appl., to appear 1996.
18. A. Greenbaum and Z. Strakos, Matrices that Generate the Same Krylov Residual Spaces, in Recent Advances in Iterative Methods, G. Golub, A. Greenbaum, and M. Luskin, eds., IMA Volumes in Mathematics and its Applications, Volume 60, Springer-Verlag, Berlin, 1993, pp. 95-118.
19. G. H. Golub and C. F. Van Loan, Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, MD, 1989.
20. 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.
21. W. Kerner, Large-scale complex eigenvalue problems, J. Comp. Physics, 85 (1989), pp. 1-85.
22. C. Moler et al., MATLAB User's Guide, MathWorks, Inc., 24 Prime Park Way, Natick, MA, 1992.
23. C. C. Paige, Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem, Linear Algebra Appl., 34 (1980), pp. 235-258.
24. C. C. Paige Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix, J. Inst. Math. Appl., 18 (1976), pp. 341-349.
25. 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.
26. Y. Saad, Numerical Methods for Large Eigenvalue Problems, Manchester University Press, Manchester, UK, 1992.
27. Y. Saad, Iterative Methods for Sparse Linear Systems, PWS Publishing Co., Boston, MA, 1996.
28. D. C. Sorensen, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
29. L. N. Trefethen, A. E. Trefethen, S. C. Reddy, and T. A. Driscoll, Hydrodynamic stability without eigenvalues, Science, 261 (1993), pp. 578-584.
30. L. N. Trefethen, Pseudospectra of matrices, in D. F. Griffiths and G. A. Watson, eds., Numerical Analysis 1991, Longman Scientific and Technical, Harlow, UK, 1992.
31. H. F. Walker, Implementations of the GMRES method using Householder transformations, SIAM J. Sci. Stat. Comput., 9(1) (1988), pp. 152-163.