On the use of larger bulges in the QR algorithm

Electronic Transactions on Numerical Analysis

Volumn 20, Issue , 2005, Pages 50-63

  Kressner, Daniel ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Bulges; Pole placement; QR algorithm; Shift blurring

Indexed keywords

EID: 29444431606     PISSN: 10689613     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (38)

1. E. ANDERSON, Z. BAI, C. BISCHOF, S. BLACKFORD, J. W. DEMMEL, J. J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLINO, A. MCKENNEY, AND D. C. SORENSEN, LAPACKUsers' Guide, SIAM, Philadelphia, PA, third edition, 1999.
2. 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, USA, March 1997, also available online from http://math.nist.gov/ MatrixMarket.
3. 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.
4. K. BRAMAN, R. BYERS, AND R. MATHIAS, The. multishift QR algorithm. I. Maintaining well-focused shifts and level 3 performance, SIAM J. Matrix Anal. Appl., 23 (2002), No. 4, pp. 929-947.
5. K. BRAMAN, R. BYERS, AND R. MATHIAS, The multishift QR algorithm., II, Aggressive early deflation, SIAM J. Matrix Anal. Appl., 23 (2002), No. 4, pp. 948-973.
6. 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.
7. J. J. DONGARRA, D. C. SORENSEN, AND S. J. HAMMARLING, Block reduction of matrices to condensed forms for eigenvalue computations, J. Comput. Appl. Math., 27 (1989), No. 1-2, pp. 215-227,
8. reprinted in Parallel algorithms for numerical linear algebra, pp. 215-227, North-Holland, Amsterdam, 1990.
9. A. A. DUBRULLE, The multishift QR algorithm-is it worth the trouble? TR 6320-3558, IBM Scientific Center, Palo Alto, CA, 1991.
10. A. A. DUBRULLE, R. S. MARTIN, AND J. H. WILKINSON, The implicit QL algorithm, Numerische Mathematik, 12 (1968), pp. 377-383,
11. also in [34, pp.241-248].
12. J. G. F. FRANCIS, The QR transformation, parts land II, Computer Journal, 4 (1961), pp. 265-271,
13. 4 (1962), pp. 332-345.
14. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, Johns Hopkins University Press, Baltimore, MD, third edition, 1996.
15. C. HE, A. J. LAUB, AND V. MEHRMANN, Placing plenty of poles is pretty preposterous, Preprint SPC 95-17, Forschergruppe 'Scientific Parallel Computing', Fakultät für Mathematik, TU Chemnitz-Zwickau, 1995.
16. G. HENRY, D. S. WATKINS, AND J. J. DONGARRA, A parallel implementation of the nonsymmetric QR algorithm for distributed memory architectures, SIAM J. Sci. Comput., 24 (2002), No. 1, pp. 284-311.
17. N. J. HIGHAM, M. KONSTANTINOV, V. MEHRMANN, AND P. PETKOV, Sensitivity of computational control problems, Numerical Analysis Report No.424, Manchester Centre for Computational Mathematics, Manchester, England, February 2003, to appear in IEEE Control Systems Magazine,
18. L. KAUFMAN, A parallel QR algorithm for the symmetric tridiagonal eigenvalue problem, Journal of Parallel and Distributed Computing, 3 (1994), pp. 429-434.
19. D. KRESSNER, Numerical Methods and Software, for General and Structured Eigenvalue Problems, PhD thesis, TU Berlin, Institut für Mathematik, Berlin, Germany, 2004.
20. V. N. KUBLANOVSKAYA, On some algorithms for the solution of the complete eigenvalue problem, Zhurnal Vychislitelnoi Matematiki i Matematicheskoi Fiziki, 1 (1961), pp. 555-570.
21. B. LANG, Effiziente Orthogonaltrunsformationen beider Eigen- und Singulärwertzerlegung, Habilitationsschrift, 1997.
22. B. LANG, Using level 3 BLAS in rotation-based algorithms, SIAM J. Sci. Comput., 19 (1998), No. 2, pp. 626-634.
23. The MATLAB Control Toolbox, Version 5, The MathWorks, Inc., Cochituate Place, 24 Prime Park Way, Natick, MA, 2000.
24. MATLAB Version 6.5, The MathWorks, Inc., Cochituate Place, 24 Prime Park Way, Natick, MA, 2002.
25. V. MEHRMANN AND H. XU, An analysis of the pole placement problem, I, The single-input case, Electron. Trans. Numer. Anal., 4 (1996), pp. 89-105, http://etna.mcs.kent.edu/vol.4.1996/pp89-105.dir/pp89-105.d.pdf.
26. V. MEHRMANN AND H. XU, Choosing poles so that the single-input pole placement problem is well conditioned, SIAM J. Matrix Anal. Appl., 19 (1998), No. 3, pp. 664-681.
27. B. N. PARLETT AND C. REINSCH, Balancing a matrix for calculation of eigenvalues and eigenvectors, Numerische Mathematik, 13 (1969), pp. 293-304,
28. also in [34, pp.315-326].
29. P. H. PETKOV, N. D. CHRISTOV, AND M. M. KONSTANTINOV, Computational Methods for Linear Control Systems, Prentice-Hall, Hertfordshire, UK, 1991.
30. P. VAN DOOREN, Numerical Linear Algebra for Signal, Systems and Control, Draft notes prepared for the Graduate School in Systems and Control, 2003.
31. A. VARGA, A multishift Hessenberg method for pole assignment of single-input systems, IEEE Trans. Automat. Control, 41 (1996), No. 12, pp. 1795-1799.
32. D. VISWANATH AND L. N. TREFETHEN, Condition numbers of random triangular matrices, SIAM J. Matrix Anal. Appl., 19 (1998), No. 2, pp. 564-581.
33. D. S. WATKINS, Shifting strategies for the parallel QR algorithm, SIAM J. Sci. Comput., 15 (1994), No. 4, pp. 953-958.
34. D. S. WATKINS, Forward stability and transmission of shifts in the QR algorithm, SIAM J. Matrix Anal. Appl., 16 (1995), No. 2, pp. 469-487.
35. D. S. WATKINS, The transmission of shifts and shift blurring in the QR algorithm, Linear Algebra Appl., 241/243 (1996), pp. 877-896.
36. D. S. WATKINS AND L. ELSNER, Chasing algorithms for the eigenvalue problem, SIAM J. Matrix Anal. Appl., 12 (1991), No. 2, pp. 374-384.
37. D. S. WATKINS AND L. ELSNER, Convergence of algorithms of decomposition type for the eigenvalue problem, Linear Algebra Appl., 143 (1991), pp. 19-47.
38. J. H. WILKINSON AND C. REINSCH, Handbook for Automatic Computation, Vol. II Linear Algebra, Springer-Verlag, New York, 1971.