Block algorithms for reordering standard and generalized schur forms

ACM Transactions on Mathematical Software

Volumn 32, Issue 4, 2006, Pages 521-532

  Kressner, Daniel ^a  

^a UNIVERSITY OF ZAGREB   (Croatia)

Author keywords

Deflating subspace; Invariant subspace; Reordering; Schur form

Indexed keywords

DEFLATING SUBSPACE; INVARIANT SUBSPACE; SCHUR FORM;

EIGENVALUES AND EIGENFUNCTIONS; MATHEMATICAL TRANSFORMATIONS;

ALGORITHMS;

EID: 33845523724     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1186785.1186787     Document Type: Article

References (24)

1. ANDERSON, E., BAI, Z., BISCHOF, C. H., BLACKFORD, S., DEMMEL, J. W., DONGARRA, J. J., DU CROZ, J., GREENBAUM, A., HAMMARLING, S., MCKENNEY, A., AND SORENSEN, D. C. 1999. LAPACK Users' Guide, 3rd ed. SIAM, Philadelphia, PA.
2. BAI, Z. AND DEMMEL, J. W. 1993. On swapping diagonal blocks in real Schur form. Linear Algebra Appl. 186, 73-95.
3. BAI, Z. AND DEMMEL, J. W. 1998. Using the matrix sign function to compute invariant subspaces. SIAM J. Matrix Anal. Appl. 19, 1, 205-225.
4. BISCHOF, C. H., LANG, B., AND SUN, X. 2000. A framework for symmetric band reduction. ACM Trans. Math. Softw. 26, 4, 581-601.
5. BOJANCZYK, A. AND VAN DOOREN, P. 1993. Reordering diagonal blocks in the real Schur form. In Linear Algebra for Large Scale and Real-Time Applications, M. S. Moonen et al., Eds. Kluwer Academic, Dordrecht, the Netherlands, 351-352.
6. BRAMAN, K., BYERS, R., AND MATHIAS, R. 2002a. The multishift QR algorithm. I. Maintaining well-focused shifts and level 3 performance. SIAM J. Matrix Anal. Appl. 23, 4, 929-947.
7. BEAMAN, K., BYERS, R., AND MATHIAS, R. 2002b. The multishift Q R algorithm. II. Aggressive early deflation. SIAM J. Matrix Anal. Appl. 23, 4, 948-973.
8. BYERS, R., HE, C., AND MEHRMANN, V. 1997. The matrix sign function method and the computation of invariant subspaces. SIAM J. Matrix Anal. Appl. 18, 3, 615-632.
9. DACKLAND, K. AND KÅGSTRÖM, B. 1999. Blocked algorithms and software for reduction of a regular matrix pair to generalized Schur form. ACM Trans. Math. Softw. 25, 4, 425-454.
10. DONGARRA, J. J., DU CRUZ, J., DUFF, I. S., AND HAMMARLING, S. 1990. A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1-17.
11. FOKKEMA, D. R., SLEIJPEN, G. L. G., AND VAN DER VORST, H. A. 1998. Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils. SIAM J. Sci. Comput. 20, 1, 94-125.
12. GOLUB, G. H. AND VAN LOAN, C. F. 1996. Matrix Computations, 3rd ed. Johns Hopkins University Press, Baltimore, MD.
13. KÅGSTRÖM, B. 1993. A direct method for reordering eigenvalues in the generalized real Schur form of a regular matrix pair (A, B). In Linear Algebra for Large Scale and Real-Time Applications, M. S. Moonen et al., Eds. Kluwer Academic, Dordrecht, the Netherlands, 195-218.
14. KÅGSTRÖM, B. AND KRESSNER, D. 2005. Multishift variants of the QZ algorithm with aggressive early deflation. Tech. Rep. UMINF-05.11, Department of Computing Science, Umeå University, Umeå, Sweden.
15. KÅGSTRÖM, B. AND POROMAA, P. 1996a. Computing eigenspaces with specified eigenvalues of a regular matrix pair (A, B) and condition estimation: Theory, algorithms and software. Numer. Algorithms 12, 3-4, 369-407.
16. KÅGSTRÖM, B. AND POROMAA, P. 1996b. LAPACK-Style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs. ACM Trans. Math. Softw. 22, 1, 78-103.
17. KRESSNER, D. 2004. Numerical methods and software for general and structured eigenvalue problems. Ph.D. thesis, TU Berlin, Institut für Mathematik, Berlin, Germany.
18. LANG, B. 1997. Effiziente Orthogonaltransformationen bei der Eigen- und Singulärwertzerlegung. Habilitationsschrift.
19. MURNAGHAN, F. D. AND WINTNER, A. 1931. A canonical form for real matrices under orthogonal transformations. Proc. Natl. Acad. Sci. USA 17, 417-420.
20. SLEIJPEN, G. L. G. AND VAN DER VORST, H. A. 1996. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17, 2, 401-425.
21. STEWART, G. W. 1976. Algorithm 407: HQR3 and EXCHNG: FORTRAN programs for calculating the eigenvalues of a real upper Hessenberg matrix in a prescribed order. ACM Trans. Math. Softw. 2, 275-280.
22. STEWART, G. W. 2002. A Krylov-Schur algorithm for large eigenproblems. SIAM J. Matrix Anal. Appl. 23, 3, 601-614.
23. VAN DOOREN, P. 1982. Algorithm 590: DSUBSP and EXCHQZ: Fortran subroutines for computing deflating subspaces with specified spectrum. ACM Trans. Math. Softw. 8, 376-382.
24. WHALEY, R. C., PETITET, A., AND DONGARRA, J. J. 2001. Automated empirical optimization of software and the ATLAS project. Parallel Comput. 27, 1-2, 3-35.