Multishift variants of the QZ algorithm with aggressive early deflation

SIAM Journal on Matrix Analysis and Applications

Volumn 29, Issue 1, 2006, Pages 199-227

  Kagstrom, B O ^a   Kressner, Daniel ^a,b  

^a UMEÅ UNIVERSITY   (Sweden)

^b UNIVERSITY OF ZAGREB   (Croatia)

Author keywords

Aggressive early deflation; Blocked algorithms; Generalized eigenvalue problem; Generalized Schur form; Multishifts; QZ algorithm

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; PROBLEM SOLVING; THEOREM PROVING;

AGGRESSIVE EARLY DEFLATION; BLOCKED ALGORITHMS; DEFLATION ALGORITHM; GENERALIZED EIGENVALUE PROBLEM; GENERALIZED SCHUR FORM; MULTISHIFTS; QZ ALGORITHM;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 38049095339     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/05064521X     Document Type: Article

References (55)

1. B. ADLERBORN, K. DACKLAND, AND B. KAGSTRÖ M, Parallel and blocked algorithms for reduction of a regular matrix pair to Hessenberg-triangular and generalized Schur forms, in PARA 2002, J. Fagerholm et al., eds., Lecture Notes in Comput. Sci. 2367, Springer-Verlag, Berlin, 2002, pp. 319-328.
2. E. ANDERSON, Z. BAI, C. H. BISCHOF, S. BLACKFORD, J. W. DEMMEL, J. J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, AND D. C. SORENSEN, LAPACK Users' Guide, 3rd ed., Software Environ. Tools 9, SIAM, Philadelphia, 1999,
3. Z. BAI, D. DAY, J. W. DEMMEL, AND J. J. DONGARRA, A Test Matrix Collection for Non-Hermitian Eigenvalue Problems (Release 1.0), Technical report CS-97-355, Department of Computer Science, University of Tennessee, Knoxville, TN, 1997. Also available online from http://math.nist.gov/MatrixMarket.
4. Z. BAI AND J. W. DEMMEL, On a block implementation of the Hessenberg multishift QR iterations, Internat. J. High Speed Comput., 1 (1989), pp. 97-112.
5. C. H. BISCHOF, B. LANG, AND X. SUN, A framework for symmetric band reduction, ACM Trans. Math. Software, 26 (2000), pp. 581-601.
6. K. BRAMAN, R. BYERS, AND R. MATHIAS, The multishift QR algorithm. Part II: Aggressive early deflation, SIAM J. Matrix Anal. Appl., 23 (2002), pp. 948-973.
7. K. BRAMAN, R. BYERS, AND R. MATHIAS, The multishift QR algorithm. Part I: Maintaining well-focused shifts and level 3 performance, SIAM J. Matrix Anal. Appl., 23 (2002), pp. 929-947.
8. K. E. BRENAN, S. L. CAMPBELL, AND L. R. PETZOLD, Numerical Solution of Initial-Value Problems in Differential-Algebraic Equations, Classics Appl. Math. 14, SIAM, Philadelphia, 1995.
9. R. BYERS, C. HE, AND V. MEHRMANN, Where is the nearest non-regular pencil?, Linear Algebra Appl., 285 (1998), pp. 81-105.
10. R. BYERS, The descriptor controllability radius, in Proceedings of the Conference on the Mathematical Theory of Networks and Systems, U. Helmke, R. Mennicken, and J. Saurer, eds., MTNS '93, Akademie Verlag, Berlin, 1994, pp. 85-88.
11. Y. CHAHLAOUI AND P. VAN DOOREN, A Collection of Benchmark Examples for Model Reduction of Linear Time Invariant Dynamical Systems, SLICOT working note 2002-2, WGS, 2002.
12. K. DACKLAND AND B. KÅGSTRÖM, Blocked algorithms and software for reduction of a regular matrix pair to generalized Schur form, ACM Trans. Math. Software, 25 (1999), pp. 425-454.
13. J. W. DEMMEL AND B. KÅGSTRÖM, The generalized Schur decomposition of an arbitrary pencil A - λB: Robust software with error bounds and applications. I. Theory and algorithms, ACM Trans. Math. Software, 19 (1993), pp. 160-174.
14. J. W. DEMMEL AND B. KÅGSTRÖM, The generalized Schur decomposition of an arbitrary pencil A - λ B: Robust software with error bounds and applications. II. Software and applications, ACM Trans. Math. Software, 19 (1993), pp. 175-201.
15. J. J. DONGARRA, J. DU CROZ, I. S. DUFF, AND S. HAMMARLING, A set of level 3 basic linear algebra subprograms, ACM Trans. Math. Software, 16 (1990), pp. 1-17.
16. A. A. DUBRULLE, The Multishift QR Algorithm-Is it Worth the Trouble?, Technical report TR 6320-3558, IBM Scientific Center, Palo Alto, CA, 1991.
17. F.R. GANTMACHER, The Theory of Matrices, Chelsea, New York, 1960.
18. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
19. K. GOTO AND R. VAN DE GEIJN, High-Performance Implementation of the Level-3 BLAS, Technical report TR-2006-23, Department of Computer Sciences, The University of Texas at Austin, Austin, TX, 2006.
20. E. GRIEPENTROG AND R. MÄRZ, Differential- Algebraic Equations and Their Numerical Treatment, Teubner Texte zur Mathematik, Teubner-Verlag, Leipzig, 1986.
21. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, 1996.
22. B. KÅGSTRÖM AND D. KRESSNER, Multishift Variants of the QZ Algorithm with Aggressive Early Deflation, Report UMINF-05.11, Department of Computing Science, Umeå University, Umeå, Sweden, 2005.
23. Also appeared as LAPACK Working Note 173.
24. B. KÄGSTRÖM, P. LING, AND C. F. VAN LOAN, GEMM-based level 3 BLAS: Algorithms for the model implementations, ACM Trans. Math. Software, 24 (1999), pp. 268-302.
25. B. KAGSTRÖM, P. LING, AND C. F. VAN LOAN, GEMM-based level 3 BLAS: High-performance model implementations and performance evaluation benchmark, ACM Trans. Math. Software, 24 (1999), pp. 303-316.
26. B. KAGSTRÖM AND P. POROMAA, Computing eigenspaces with specified eigenvalues of a regular matrix pair (A, B) and condition estimation: Theory, algorithms and software, Numer. Algorithms, 12 (1996), pp. 369-407.
27. B. KAGSTRÖM, 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 (Leuven, 1992), M. S. Moonen, G. H. Golub, and B. L. R. De Moor, eds., NATO Adv. Sci. Inst. Ser. E Appl. Sci. 232, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1993, pp. 195-218.
28. B. KAGSTRÖM, Singular matrix pencils, in Templates for the Solution of Algebraic Eigenvalue Problems, Z. Bai, J. W. Demmel, J. J. Dongarra, A. Ruhe, and H. van der Vorst, eds., Software Environ. Tools 11, SIAM, Philadelphia, 2000, pp. 260-277.
29. L. KAUFMAN, The LZ-algorithm to solve the generalized eigenvalue problem, SIAM J. Numer. Anal., 11 (1974), pp. 997-1024.
30. L. KAUFMAN, Some thoughts on the QZ algorithm for solving the generalized eigenvalue problem, ACM Trans. Math. Software, 3 (1977), pp. 65-75.
31. J. G. KORVINK AND B. R. EVGENII, Oberwolfach benchmark collection, in Dimension Reduction of Large-Scale Systems, P. Benner, V. Mehrmann, and D. C. Sorensen, eds., Lecture Notes Comput. Sci. Eng. 45, Springer-Verlag, Heidelberg, 2005, pp. 311-316.
32. D. KRESSNER, Numerical Methods and Software for General and Structured Eigenvalue Problems, Ph.D. thesis, Institut für Mathematik, TU Berlin, Berlin, Germany, 2004.
33. D. KRESSNER, Block algorithms for reordering standard and generalized Schur forms, LAPACK working note 171, September 2005. ACM Trans. Math. Software, to appear.
34. D. KRESSNER, On the use of larger bulges in the QR algorithm, Electron. Trans. Numer. Anal., 20 (2005), pp. 50-63.
35. V. N. KUBLANOVSKAYA, AB-algorithm and its modifications for the spectral problems of linear pencils of matrices, Numer. Math., 43 (1984), pp. 329-342.
36. P. KUNKEL AND V. MEHRMANN, Differential-Algebraic Equations. Analysis and Numerical Solution, EMS Publishing House, Zürich, Switzerland, 2006.
37. B. LANG, Effiziente Orthogonaltransformationen bei der Eigen- und Singulärwertzerlegung, Habilitationsschrift, 1997.
38. C. B. MOLER AND G. W. STEWART, An algorithm for generalized matrix eigenvalue problems, SIAM J. Numer. Anal., 10 (1973), pp. 241-256.
39. C. PESTER, COCOS - Computation of Corner Singularities, preprint SFB393/05-03, Technische Universität Chemnitz, Chemnitz, Germany, 2005.
40. P. J. RABIBR AND W. C. RHEINBOLDT, Nonholonomic Motion of Rigid Mechanical Systems from a DAE Viewpoint, SIAM, Philadelphia, 2000.
41. G. W. STEWART AND J.-G. SUN, Matrix Perturbation Theory, Academic Press, New York, 1990.
42. G. W. STEWART, On the eigensystems of graded matrices, Numer. Math., 90 (2001), pp. 349-370.
43. T. STYKEL, Balanced truncation model reduction for semidiscretized Stokes equation, Technical report 04-2003, Institut für Mathematik, TU Berlin, Berlin, Germany, 2003.
44. C. TISCHENDORF, Solution of Index-2-DAEs and Its Application in Circuit Simulation, Dissertation, Humboldt-Univ. zu Berlin, Berlin, Germany, 1996.
45. P. VAN DOOREN, Algorithm 590: DSUBSP and EXCHQZ: Fortran subroutines for computing deflating subspaces with specified spectrum, ACM Trans. Math. Software, 8 (1982), pp. 376-382.
46. C. F. VAN LOAN, Generalized Singular Values with Algorithms and Applications, Ph.D. thesis, The University of Michigan, Ann Arbor, MI, 1973.
47. R. C. WARD, A Numerical Solution to the Generalized Eigenvalue Problem., Ph.D. thesis, University of Virginia, Charlottesville, VA., 1974.
48. R. C. WARD, The combination shift QZ algorithm, SIAM J. Numer. Anal., 12 (1975), pp. 835-853.
49. R. C. WARD, Balancing the generalized eigenvalue problem, SIAM J. Sci. Statist. Comput., 2 (1981), pp. 141-152.
50. D. S. WATKINS AND L. ELSNER, Theory of decomposition and bulge-chasing algorithms for the generalized eigenvalue problem, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 943-967.
51. D. S. WATKINS, Shifting strategies for the parallel QR algorithm, SIAM J. Sci. Comput., 15 (1994), pp. 953-958.
52. D. S. WATKINS, Forward stability and transmission of shifts in the QR algorithm, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 469-487.
53. D. S. WATKINS, The transmission of shifts and shift blurring in the QR algorithm, Linear Algebra Appl., 241/243 (1996), pp. 877-896.
54. D. S. WATKINS, Performance of the QZ algorithm in the presence of infinite eigenvalues, SIAM J. Matrix Anal. Appl., 22 (2000), pp. 364-375.
55. J. H. WILKINSON, Kronecker's canonical form and the QZ algorithm, Linear Algebra Appl., 28 (1979), pp. 285-303.