Algorithm 841: BHESS: Gaussian reduction to a similar banded Hessenberg form

ACM Transactions on Mathematical Software

Volumn 31, Issue 1, 2005, Pages 166-185

  Howell, Gary W ^a   Diaa, Nadia ^b  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b Box 7109 ^*  (United States)

Author keywords

Cache efficient; Gaussian similarity transformations; Hessenberg form; Matrix eigenvalues; Spectra; Sylvester equation

Indexed keywords

CODES (SYMBOLS); EIGENVALUES AND EIGENFUNCTIONS; FORTRAN (PROGRAMMING LANGUAGE); ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; PROBLEM SOLVING;

CACHE EFFICIENT; GAUSSIAN SIMILARITY TRANSFORMATIONS; HESSENBERG FORMS; MATRIX EIGENVALUES; SYLVESTER EQUATIONS;

ALGORITHMS;

EID: 17644420697     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/1055531.1055539     Document Type: Article

References (31)

1. BAI, Z., 1994. Error analysis of the Lanczos algorithm for the nonsymmetric eigenvalue problem. Math. Comp. 62, 205, 209-226.
2. BAI, Z., DAY, D., AND YE, Q. 1995. ABLE: An adaptive block Lanczos method for non-Hennitian eigenvalue problems. Research Report 95-04, Department of Mathematics, University of Kentucky.
3. BAUER, F. L. 1959. Sequential reduction to tridiagonal form. SLAM J. 7, 107-113.
4. BUSINGEK, P. A. 1969. Reducing a matrix to Hessenberg form. Math. Comp. 23, 819-921.
5. CHOI, C. H. AND LAUB, A. J. 1990. Efficient matrix-valued algorithms for solving stiff Riccati differential equations. IEEE Trans. Autom. Contr. 35, 770-776.
6. DEMMEL, J. W. 1987. On condition numbers and the distance to the nearest ill-posed problem. Numer. Math. 51, 251-289.
7. DONGARRA, J., GEIST, G., AND ROMINE, C. 1992. Algorithm 710: FORTRAN subroutines for computing the eigenvalues and eigenvectors of a general matrix by reduction to tridiagonal form. ACM Trans. Math. Softw. 18, 392-400.
8. ELLNER, N. S. AND WACHSPRESS, E. L. 1991. Alternating direction implicit iteration for systems with complex spectra. SIAM J. Num. Anal. 28, 859-870.
9. FREUND, R. W., GUTKNECHT, M. H., AND NACHTIGAL, N. M. 1993. An implementation of the "lookahead" Lanczos algorithm for non-Hennitian matrices. SIAMJ. Sci. Computing 14, 1, 137-158.
10. GEIST, G. A. 1991. Reduction of a general matrix to tridiagonal form. SIAM J. Matrix Anal. Appl. 12, 2, 362-373.
11. GEIST, G. A., HOWELL, G. W., AND WATKINS, D. S. 1999. The BR eigenvalue algorithm. SIAM J. Matrix Anal. Appl. 20, 4, 1083-1099.
12. GEIST, G. A., LU, A., AND WACHSPRESS, E. L. 1989. Stabilized Gaussian reduction of an arbitrary matrix to tridiagonal form. Tech. Rep. ORNL/TM-11089, Mathematical Sciences Section, Oak Ridge National Laboratory.
13. GOLUB, G. H., NASH, S., AND VAN LOAN, C. 1979. A Hessenberg-Schur method for the problem AX+XB=C. IEEE Trans. Automa. Contr. AC-24, 909-913.
14. HIGHAM, N. J. 1991. Algorithm 694: A collection of test matrices in MATLAB. ACM Trans. Math. Soft. 17, 3 (Sept.), 289-305.
15. HIGHAM, N. J. 1996. Accuracy and Stability of Numerical Algorithms. SIAM, Philadephia.
16. HOWELL, G. W. 1994. Efficient computation of eigenvalues of randomly generated matrices. J. Applied Math. and Comp. 66, 9-24.
17. HOWELL, G. W. AND GEIST, G. A. 1995. Reduction to a similar near-tridiagonal form. In Proceedings of the ISCA 8th International Conference on Parallel and Distributed Computing Systems (Raleigh, NC, 1995), pp. 426-432. ISCA.
18. HOWELL, G. W., GEIST, G. A., AND ROWAN, T. 1997. Stability of reduction to a similar near-tridiagonal Hessenberg form. Tech. Rep. ORNL/TM-11097, Mathematical Sciences Section, Oak Ridge National Laboratory.
19. HOWELL, G. W. AND REKAB, K. 1995. Expected conditioning for eigenvalues of randomly generated matrices. Neural, Parallel & Scientific Computations 3, 2, 263-270.
20. PARLETT, B. N. 1992. Reduction to tridiagonal form and minimal realizations. SIAM J. Matrix Anal. Appl. 13, 2, 567-593.
21. PARLETT, B. N. December, 1993. Do we understand the symmetric Lanczos algorithm yet? Cornelius Lanczos International Centenary Conference, North Carolina State University.
22. ROWAN, T. H. 1990. Functional Stability Analysis of Numerical Algorithms. Ph.D. thesis, Department of Computer Sciences, University of Texas at Austin, Austin, TX.
23. RUTISHAUSER, H. 1953. Beiträge zur Kenntnis des Biorthogonalisierungs-Algorithmus von Lanczos. Zeitschrift für angewandte Mathematik und Physik 4, 35-56.
24. SCHRAUF, G. 1991. Algorithm 696: An inverse Rayleigh iteration for complex band matrices. ACM Trans. Math. Softw. 17, 3, 335-340.
25. TAYLOR, D. R. 1982. Analysis of the look ahead Lanczos algorithm. Ph.D. thesis, University of California, Berkeley, Berkeley, CA.
26. TREFETHEN, L.N. AND SCHREIBER, R. S. 1990. Average-case stability of Gaussian elimination. SIAM J. Matrix Anal. Appl. 11, 335-360.
27. WACHSPRESS, E. L. 1988. Iterative solution of the Lyapunov matrix equation. Appl. Math. Lett. 1, 87-90.
28. WATKINS, D. S. AND ELSNER, L. 1991. Convergence of algorithms of decomposition type for the eigenvalue problem. Lin. Alg. and Applic. 143, 19-47.
29. WILKINSON, J. H. 1965. The Algebraic Eigenvalue Problem. Clarendon Press, Oxford, England.
30. WILKINSON, J. H. 1984. On neighbouring matrices with quadratic elementary divisors. Numer. Math. 44, 1-21.
31. YE, Q. 1994. A breakdown-free variation of the nonsymmetric Lanczos algorithms. Math. Comp. 62, 179-207.