A QL procedure for computing the eigenvalues of complex symmetric tridiagonal matrices

SIAM Journal on Matrix Analysis and Applications

Volumn 17, Issue 1, 1996, Pages 83-109

  Cullum, Jane K ^a,b   Willoughby, Ralph A ^c  

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

^b UNIVERSITY OF MARYLAND   (United States)

^c NONE

Author keywords

Complex symmetric; Eigenvalues; QL procedure; Tridiagonal matrices

Indexed keywords

EID: 0030547039     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479894137639     Document Type: Article

References (33)

1. I. BAR-ON AND V. RYABOY, Fast diagonalization of large and dense complex symmetric matrices with applications to quantum reaction dynamics, Tech. Report, Dept. of Chemistry, Technion, Haifa, Israel, 1994.
2. W.E. BOYSE, D.R. LYNCH, K.D. PAULSEN, AND G.N. MINERBO, Nodal based finite element modeling of Maxwell's equations, IEEE Trans. Antennas Propagat., 40 (1992), pp. 642-651.
3. A. BUNSE-GERSTNER, Der HR-Algorithms zur numerischen Bestimmung der Eigenwerte einer Matrix, Dissertation, University Bielefeld, Germany, 1978.
4. J. CULLUM, Lanczos algorithms for large scale symmetric and nonsymmetric matrix eigenvalue problems, Proc. Lanczos International Centenary Conference, Dec. 12-17, 1993, North Carolina State University, Raleigh, Society for Industrial and Applied Mathematics, Philadelphia, 1994, pp. 11-31.
5. J. CULLUM, W. KERNER, AND R. WILLOUGHBY, A generalized nonsymmetric Lanczos procedure, Comput. Phys. Comm., 53 (1989), pp. 19-48.
6. J. CULLUM AND R. WILLOUGHBY, Computing eigenvalues of large matrices, some Lanczos procedures and a shift and invert strategy, in Advances in Numerical Partial Differential Equations and Optimization, S. Gomez, J. P. Hennart, and R. A. Tapia, eds., Society for Industrial and Applied Mathematics, Philadelphia, 1991, pp. 198-246.
7. _, A QL procedure for complex, symmetric, tridiagonal matrices, IBM Research Report RC 12835, IBM T. J. Watson Research Center, Yorktown Heights, NY, 1987.
8. _, EDS., A practical procedure for computing eigenvalues of large sparse nonsymmetric matrices, in Large Scale Eigenvalue Problems, North-Holland, Amsterdam, 1986, pp. 193-240.
9. _, Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. 1, Theory, Progress in Scientific Computing, 3, Birkhaüser Boston, Inc., Boston, MA 1985.
10. A. DAX AND S. KANIEL, The ELR method for computing the eigenvalues of a general matrix, SIAM J. Numer. Anal., 18 (1981), pp. 597-605.
11. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
12. P. J. EBERLEIN, On the diagonalization of complex symmetric matrices, J. Instit. Math. Anal., 7 (1971), pp. 377-383.
13. R. FREUND, Conjugate gradient type methods for linear systems with complex symmetric coefficient matrices, SIAM J. Sci. Statist. Comput., 13(1992), pp. 425-448.
14. R. FREUND AND N. NACHTIGAL, QMR: A quasi-minimal residual method for non-Hermitian linear systems, Numer. Math., 8 (1992), pp. 43-71.
15. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, 1989.
16. R. G. GORDON AND T. MESSENGER, Magnetic resonance line shapes in slowly tumbling molecules, in Electron Spin Relaxations in Liquids, L. T. Muus and P. W. Atkins, eds., Plenum Press, New York, 1972, pp. 341-375.
17. W. KERNER, Large-scale complex eigenvalue problems, J. Comput. Physics, 85 (1989), pp. 1-85.
18. N. N. LIPKIN AND C. LEFORESTIER, A three-dimensional study of NeICl predissociation resonances by the complex-scaled discrete variable representation method, J. Chem. Phys., 98 (1993), pp. 1888-1901.
19. G. MORO AND J. H. FREED, Calculation of ESR spectra and related Fokker-Planck forms by the use of the Lanczos algorithm, J. Chem. Physics, 74 (1981), pp. 3757-3773.
20. NETLIB, Public Software Library, accessible via netlib at ornl.gov.
21. D. NEUHAUSER AND M. BAER, The time-dependent Schroedinger equation: application of absorbing boundary condition, J. Chem. Phys., 90 (1989), pp. 4351-4355.
22. B. N. PARLETT, The Symmetric Eigenproblem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
23. B. N. PARLETT, Global convergence of the basic QR procedure on Hessenberg matrices, Math. Comp., 22(1968), pp. 801-817.
24. B. N. PARLETT, Canonical decomposition of Hessenberg matrices, Math. Comp., 21(1967), pp. 223-227.
25. B. N. PARLETT AND W. G. POOLE, A geometric theory for the QR, LU and power iterations, SIAM J. Numer. Anal., 8 (1973), pp. 389-412.
26. B. N. PARLETT, D. R. TAYLOR, AND Z. A. LIU, A look-ahead Lanczos procedure for unsymmetric matrices, Math. Comp., 44 (1985), pp. 105-124.
27. Y. SAAD, Numerical Methods for Large Eigenvalue Problems, Manchester University Press, Manchester, UK, 1992.
28. B. T. SMITH, J. M. GARBOW, B. S. IKEBE, V. C. KLEMA, AND C. B. MOLER, Matrix Eigensystem Routines - EISPACK Guide, Vols. 5, 61, Springer-Verlag, Berlin.
29. G. W. STEWART, Introduction to Matrix Computations, Academic Press, New York, 1973.
30. D. S. WATKINS, Understanding the QR algorithm, SIAM Rev., 24 (1982), pp. 427-440.
31. D. S. WATKINS AND L. ELSNER, Chasing algorithms for the eigenvalue problem, SIAM J. Matrix Anal. Appl., 12 (1991), pp. 374-384.
32. _, Convergence of algorithms of decomposition type for the eigenvalue problem, Linear Algebra Appl., 143 (1991), pp. 19-47.
33. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Oxford University Press, London, 1965.