Numerical Methods for General and Structured Eigenvalue Problems

Lecture Notes in Computational Science and Engineering

Volumn 46, Issue , 2005, Pages

  Kressner, Daniel ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34447544986     PISSN: 14397358     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Article

References (368)

1. J. Abels and P. Benner. CAREX a collection of benchmark examples for continuous-time algebraic Riccati equations (version 2.0). SLICOT working note 1999-14, WGS, 1999. Available online from http://www.win.tue.nl/niconet/.
2. P.-A. Absil and P. Van Dooren. Two-sided Grassmann Rayleigh quotient iteration, 2002. Submitted.
3. B. Adlerborn, K. Dackland, and B. K agström. Parallel and blocked algorithms for reduction of a regular matrix pair to Hessenberg-triangular and generalized Schur forms. In J. Fagerholm et al., editor, PARA 2002, LNCS 2367, pages 319-328. Springer-Verlag, 2002.
4. M. Ahues and F. Tisseur. A new deflation criterion for the QR algorithm. LAPACK Working Note 122, 1997.
5. G. S. Ammar, P. Benner, and V. Mehrmann. A multishift algorithm for the numerical solution of algebraic Riccati equations. Electr. Trans. Num. Anal., 1:33-48, 1993.
6. G. S. Ammar, W. B. Gragg, and L. Reichel. On the eigenproblem for orthogonal matrices. In Proc. IEEE Confrence on Decision and Control, pages 1963-1966, 1985.
7. G. S. Ammar, W. B. Gragg, and L. Reichel. Direct and inverse unitary eigen-problems in signal processing: An overview. In M. S. Moonen, G. H. Golub, and B. L. R. De Moor, editors, Linear algebra for large scale and real-time applications (Leuven, 1992), volume 232 of NATO Adv. Sci. Inst. Ser. E Appl. Sci., pages 341-343, Dordrecht, 1993. Kluwer Acad. Publ.
8. G. S. Ammar and V. Mehrmann. On Hamiltonian and symplectic Hessenberg forms. Linear Algebra Appl., 149:55-72, 1991.
9. G. S. Ammar, L. Reichel, and D. C. Sorensen. An implementation of a divide and conquer algorithm for the unitary eigenproblem. ACM Trans. Math. Software, 18(3):292-307, 1992.
10. 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. SIAM, Philadelphia, PA, third edition, 1999.
11. A. C. Antoulas. Lectures on the Approximation of Large-Scale Dynamical Systems. SIAM, Philadelphia, PA, 2004. To appear.
12. A. C. Antoulas and D. C. Sorensen. Approximation of large-scale dynamical systems: an overview. Int. J. Appl. Math. Comput. Sci., 11(5):1093-1121, 2001.
13. A. C. Antoulas, D. C. Sorensen, and S. Gugercin. A survey of model reduction methods for large-scale systems. In Structured matrices in mathematics, computer science, and engineering, I (Boulder, CO, 1999), volume 280 of Contemp. Math., pages 193-219. Amer. Math. Soc., Providence, RI, 2001.
14. T. Apel, V. Mehrmann, and D. S. Watkins. Structured eigenvalue methods for the computation of corner singularities in 3D anisotropic elastic structures. Comput. Methods Appl. Mech. Engrg, 191:4459-4473, 2002.
15. P. Arbenz and Z. Drmac̀. On positive semidefinite matrices with known null space. SIAM J. Matrix Anal. Appl., 24(1):132-149, 2002.
16. 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.
17. Z. Bai and J. W. Demmel. On a block implementation of the Hessenberg multishift QR iterations. Internat. J. High Speed Comput., 1:97-112, 1989.
18. Z. Bai and J. W. Demmel. On swapping diagonal blocks in real Schur form. Linear Algebra Appl., 186:73-95, 1993.
19. Z. Bai, J. W. Demmel, J. J. Dongarra, A. Ruhe, and H. van der Vorst, editors. Templates for the Solution of Algebraic Eigenvalue Problems. Software, Environments, and Tools. SIAM, Philadelphia, PA, 2000.
20. Z. Bai, J. W. Demmel, and A. McKenney. On computing condition numbers for the nonsymmetric eigenproblem. ACM Trans. Math. Software, 19(2):202-223, 1993.
21. R. Barrett, M. Berry, T. F. Chan, J. W. Demmel, J. Donato, J. J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. van der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia, PA, 1994.
22. R. H. Bartels and G. W. Stewart. Algorithm 432: The solution of the matrix equation AX- BX = C. Communications of the ACM, 8:820-826, 1972.
23. S. Batterson. Convergence of the shifted QR algorithm on 3 × 3 normal matrices. Numer. Math., 58(4):341-352, 1990.
24. S. Batterson and J. Smillie. The dynamics of Rayleigh quotient iteration. SIAM J. Numer. Anal., 26(3):624-636, 1989.
25. S. Batterson and J. Smillie. Rayleigh quotient iteration for nonsymmetric matrices. Math. Comp., 55:169-178, 1990.
26. H. Baumgärtel. Endlichdimensionale analytische Störungstheorie. Akademie Verlag, Berlin, 1972.
27. C. Beattie, M. Embree, and J. Rossi. Convergence of restarted Krylov subspaces to invariant subspaces. Technical report 01/21, Oxford University Computing Laboratory Numerical Analysis, 2001.
28. C. Beattie, M. Embree, and D. C. Sorensen. Convergence of polynomial restart Krylov methods for eigenvalue computation. Computational and applied mathematics report TR03-08, Rice University, 2003.
29. P. Benner. Computational methods for linear-quadratic optimization. Supplemento ai Rendiconti del Circolo Matematico di Palermo, Serie II, No. 58:21-56, 1999.
30. P. Benner. Symplectic balancing of Hamiltonian matrices. SIAM J. Sci. Comput., 22(5):1885-1904, 2000.
31. P. Benner, R. Byers, and E. Barth. Algorithm 800: Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices I: The square-reduced method. ACM Trans. Math. Software, 26:49-77, 2000.
32. P. Benner, R. Byers, V. Mehrmann, and H. Xu. Numerical computation of deflating subspaces of skew-Hamiltonian/Hamiltonian pencils. SIAM J. Matrix Anal. Appl., 24(1), 2002.
33. P. Benner, R. Byers, V. Mehrmann, and H. Xu. Robust numerical methods for robust control. Technical Report 06-2004, Institut für Mathematik, TU Berlin, 2004.
34. P. Benner and H. Faßbender. An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem. Linear Algebra Appl., 263:75-111, 1997.
35. P. Benner and H. Faßbender. A hybrid method for the numerical solution of discrete-time algebraic Riccati equations. Contemporary Mathematics, 280:255-269, 2001.
36. P. Benner and D. Kressner. Balancing sparse Hamiltonian eigenproblems, 2003. To appear in Linear Algebra Appl.
37. P. Benner and D. Kressner. Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices II. Submitted. See also http://www.tu-chemnitz.de/mathematik/hapack/, 2004.
38. P. Benner, D. Kressner, and V. Mehrmann. Skew-Hamiltonian and Hamiltonian eigenvalue problems: Theory, algorithms and applications. In Z. Drmač, M. Marušić, and Z. Tutek, editors, Proceedings of the Conference on Applied Mathematics and Scientific Computing, Brijuni (Croatia), June 23-27, 2003, pages 3-39. Springer-Verlag, 2005.
39. P. Benner, A. J. Laub, and V. Mehrmann. Benchmarks for the numerical solution of algebraic Riccati equations. IEEE Control Systems Magazine, 7(5):18-28, 1997.
40. P. Benner, V. Mehrmann, V. Sima, S. Van Huffel, and A. Varga. SLICOT-a subroutine library in systems and control theory. In Applied and computational control, signals, and circuits, Vol. 1, pages 499-539. Birkhäuser Boston, Boston, MA, 1999.
41. P. Benner, V. Mehrmann, and H. Xu. A new method for computing the stable invariant subspace of a real Hamiltonian matrix. J. Comput. Appl. Math., 86:17-43, 1997.
42. P. Benner, V. Mehrmann, and H. Xu. A numerically stable, structure preserving method for computing the eigenvalues of real Hamiltonian or symplectic pencils. Numer. Math., 78(3):329-358, 1998.
43. P. Benner, V. Mehrmann, and H. Xu. Perturbation analysis for the eigenvalue problem of a formal product of matrices. BIT, 42(1):1-43, 2002.
44. A. Berman and R. J. Plemmons. Nonnegative Matrices in the Mathematical Sciences, volume 9 of Classics in Applied Mathematics. SIAM, Philadelphia, PA, 1994. Revised reprint of the 1979 original.
45. R. Bhatia. Matrix Analysis. Springer-Verlag, New York, 1997.
46. C. H. Bischof, B. Lang, and X. Sun. A framework for symmetric band reduction. ACM Trans. Math. Software, 26(4):581-601, 2000.
47. C. H. Bischof and C. F. Van Loan. The W Y representation for products of Householder matrices. SIAM J. Sci. Statist. Comput., 8(1):S2-S13, 1987.
48. Å. Björck. Numerical Methods for Least Squares Problems. SIAM, Philadelphia, PA, 1996.
49. L. S. Blackford, J. Choi, A. Cleary, E. D'Azevedo, J. W. Demmel, I. Dhillon, J. J. Dongarra, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker,and R. C. Whaley. ScaLAPACK Users' Guide. SIAM, Philadelphia, PA, 1997.
50. B. Bohnhorst. Beiträge zur numerischen Behandlung des unitären Eigenwertproblems. PhD thesis, Fakultät für Mathematik, Universität Bielefeld, Bielefeld, Germany, 1993.
51. B. Bohnhorst, A. Bunse-Gerstner, and H. Faßbender. On the perturbation theory for unitary eigenvalue problems. SIAM J. Matrix Anal. Appl., 21(3):809-824, 2000.
52. A. Bojanczyk, G. H. Golub, and P. Van Dooren. The periodic Schur decomposition; algorithm and applications. In Proc. SPIE Conference, volume 1770, pages 31-42, 1992.
53. A. Bojanczyk and P. Van Dooren. Reordering diagonal blocks in the real Schur form. In M. S. Moonen, G. H. Golub, and B. L. R. De Moor, editors, Linear algebra for large scale and real-time applications (Leuven, 1992), volume 232 of NATO Adv. Sci. Inst. Ser. E Appl. Sci., pages 351-352, Dordrecht, 1993. Kluwer Acad. Publ.
54. D. L. Boley and G. H. Golub. The nonsymmetric Lanczos algorithm and controllability. Systems Control Lett., 16(2):97-105, 1991.
55. W. Bomhof. Iterative and parallel methods for linear systems, with applications in circuit simulation. PhD thesis, Universiteit Utrecht, Faculteit der Wiskunde en Informatica, Utrecht, Netherlands, 2001.
56. W. Bomhof and H. van der Vorst. A parallelizable GMRES-type method for p-cyclic matrices, with applications in circuit simulation. In U. Van Rienen, M. Gunther, and D. Hecht, editors, Scientific computing in electrical engineering: proceedings of the 3rd international workshop, August 20-23, 2000, Warnemünde, Germany, volume 18 of LNCSE, pages 293-300. Springer Verlag, 2001.
57. F. Bonhoure, Y. Dallery, and W. J. Stewart. On the use of periodicity properties for the efficient numerical solution of certain Markov chains. Numer. Linear Algebra Appl., 1(3):265-286, 1994.
58. S. Bora and V. Mehrmann. Linear perturbation theory for structured matrix pencils arising in control theory. Preprint 16-2004, Institut für Mathematik, TU Berlin, 2004.
59. S. Boyd, V. Balakrishnan, and P. Kabamba. A bisection method for computing the H∞ norm of a transfer matrix and related problems. Math. Control, Signals, Sys., 2:207-219, 1989.
60. K. Braman. Toward A Recursive QR Algorithm. PhD thesis, University of Kansas, 2003.
61. 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(4):929-947, 2002.
62. K. Braman, R. Byers, and R. Mathias. The multishift QR algorithm. II. Aggressive early deflation. SIAM J. Matrix Anal. Appl., 23(4):948-973, 2002.
63. K. E. Brenan, S. L. Campbell, and L. R. Petzold. Numerical solution of initial value problems in differential-algebraic equations, volume 14 of Classics in Applied Mathematics. SIAM, Philadelphia, PA, 1996. Revised and corrected reprint of the 1989 original.
64. R. Bru, R. Cantó, and B. Ricarte. Modelling nitrogen dynamics in citrus trees. Mathematical and Computer Modelling, 38:975-987, 2003.
65. N.A. Bruinsma and M. Steinbuch. A fast algorithm to compute the H∞-norm of a transfer function matrix. Sys. Control Lett., 14(4):287-293, 1990.
66. J. R. Bunch. The weak and strong stability of algorithms in numerical linear algebra. Linear Algebra Appl., 88/89:49-66, 1987.
67. A. Bunse-Gerstner. Matrix factorizations for symplectic QR-like methods. Linear Algebra Appl., 83:49-77, 1986.
68. A. Bunse-Gerstner and L. Elsner. Schur parameter pencils for the solution of the unitary eigenproblem. Linear Algebra Appl., 154/156:741-778, 1991.
69. A. Bunse-Gerstner and H. Faßbender. Error bounds in the isometric Arnoldi process. J. Comput. Appl. Math., 86(1):53-72, 1997.
70. A. Bunse-Gerstner and H. Faßbender. A Jacobi-like method for solving algebraic Riccati equations on parallel computers. IEEE Trans. Automat. Control, 42(8):1071-1084, 1997.
71. A. Bunse-Gerstner and C. He. On a Sturm sequence of polynomials for unitary Hessenberg matrices. SIAM J. Matrix Anal. Appl., 16(4):1043-1055, 1995.
72. A. Bunse-Gerstner and V. Mehrmann. A symplectic QR like algorithm for the solution of the real algebraic Riccati equation. IEEE Trans. Automat. Control, 31(12):1104-1113, 1986.
73. A. Bunse-Gerstner, V. Mehrmann, and D. S. Watkins. An SR algorithm for Hamiltonian matrices based on Gaussian elimination. In XII Symposium on Operations Research (Passau, 1987), volume 58 of Methods Oper. Res., pages 339-357. Athenäum/Hain/Hanstein, Königstein, 1989.
74. J. V. Burke, A. S. Lewis, and M. L. Overton. Pseudospectral components and the distance to uncontrollability, 2003. To appear in SIAM J. Matrix Anal. Appl.
75. J. V. Burke, A. S. Lewis, and M. L. Overton. Robust stability and a criss-cross algorithm for pseudospectra. IMA J. Numer. Anal., 23(3):359-375, 2003.
76. R. Byers. Hamiltonian and Symplectic Algorithms for the Algebraic Riccati Equation. PhD thesis, Cornell University, Dept. Comp. Sci., Ithaca, NY, 1983.
77. T = C. IEEE Trans. Automat. Control, 29(10):926-928, 1984.
78. R. Byers. A Hamiltonian QR algorithm. SIAM J. Sci. Statist. Comput., 7(1):212-229, 1986.
79. R. Byers. A bisection method for measuring the distance of a stable to unstable matrices. SIAM J. Sci. Statist. Comput., 9:875-881, 1988.
80. R. Byers. A Hamiltonian-Jacobi algorithm. IEEE Trans. Automat. Control, 35:566-570, 1990.
81. Byers, 2004. Personal communication.
82. R. Byers and D. Kressner. On the condition of a complex eigenvalue under real perturbations. BIT, 44(2):209-215, 2004.
83. R. Byers and D. Kressner. Structured condition numbers for invariant subspaces, 2005. In preparation.
84. R. Byers, V. Mehrmann, and H. Xu. A structured staircase algorithm for skew-symmetric/symmetric pencils, 2005. In preparation.
85. R. Byers and S. Nash. On the singular vectors of the Lyapunov operator. SIAM J. Algebraic Discrete Methods, 8(1):59-66, 1987.
86. R. Byers and N. Rhee. Cyclic Schur and Hessenberg-Schur numerical methods for solving periodic Lyapunov and Sylvester equations. Technical report, Dept. of Mathematics, Univ. of Missouri at Kansas City, 1995.
87. Z. Cao and F. Zhang. Direct methods for ordering eigenvalues of a real matrix (in Chinese). Chinese Univ. J. Comput. Math., 1:27-36, 1981. Cited in [18].
88. 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.
89. F. Chatelin. Eigenvalues of matrices. John Wiley & Sons Ltd., Chichester, 1993.
90. T.-Y. Chen. Balancing sparse matrices for computing eigenvalues. Master's thesis, University of California at Berkeley, 1998.
91. T.-Y. Chen and J. W. Demmel. Balancing sparse matrices for computing eigenvalues. Linear Algebra Appl., 309:261-287, 2000.
92. D. Chu, X. Liu, and V. Mehrmann. A numerically backwards stable method for computing the Hamiltonian Schur form. Preprint 24-2004, Institut für Mathematik, TU Berlin, 2004.
93. K.-W. E. Chu. The solution of the matrix equations AXB-CXD = E and (Y A-DZ, Y C-BZ) = (E, F). Linear Algebra Appl., 93:93-105, 1987.
94. J. K. Cullum and R. A. Willoughby. Lanczos algorithms for large symmetric eigenvalue computations. Vol. 1, volume 41 of Classics in Applied Mathematics. SIAM, Philadelphia, PA, 2002. Reprint of the 1985 original.
95. J. J. M. Cuppen. A divide and conquer method for the symmetric tridiagonal eigenproblem. Numer. Math., 36(2):177-195, 1980/81.
96. K. Dackland and B. Kagström. Blocked algorithms and software for reduction of a regular matrix pair to generalized Schur form. ACM Trans. Math. Software, 25(4):425-454, 1999.
97. L. Dai. Singular control systems, volume 118 of Lecture Notes in Control and Information Sciences. Springer-Verlag, Berlin, 1989.
98. J. Daniel, W. B. Gragg, L. Kaufman, and G. W. Stewart. Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Mathematics of Computation, 30:772-795, 1976.
99. P. I. Davies. Structured conditioning of matrix functions. Electron. J. Linear Algebra, 11:132-161, 2004.
100. D. Day. How the shifted QR algorithm fails to converge and how to fix it. Tech. Report 96-0913, Sandia National Laboratories, Albuquerque, NM, 1996
101. J. W. Demmel. Computing stable eigendecompositions of matrices. Linear Algebra Appl., 79:163-193, 1986.
102. J. W. Demmel. Three methods for refining estimates of invariant subspaces. Computing, 38:43-57, 1987.
103. J. W. Demmel. Applied Numerical Linear Algebra. SIAM, Philadelphia, PA, 1997.
104. J. W. Demmel and J. J. Dongarra. LAPACK 2005 prospectus: Reliable and scalable software for linear algebra computations on high end computers. LA-PACK Working Note 165, 2005.
105. J. W. Demmel and B. Kagström. Computing stable eigendecompositions of matrix pencils. Linear Algebra Appl., 88/89:139-186, 1987.
106. J. W. Demmel and B. K agströ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(2):160-174, 1993.
107. J. W. Demmel and B. K agströ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(2):175-201, 1993
108. 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:1-17, 1990
109. J. J. Dongarra, J. Du Croz, S. Hammarling, and R. J. Hanson. An extended set of fortran basic linear algebra subprograms. ACM Trans. Math. Software, 14:1-17, 1988.
110. J. J. Dongarra, S. Hammarling, and J. H. Wilkinson. Numerical considerations in computing invariant subspaces. SIAM J. Matrix Anal. Appl., 13(1):145-161, 1992.
111. 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(1/2):215-227, 1989. Reprinted in Parallel algorithms for numerical linear algebra, 215-227, North-Holland, Amsterdam, 1990.
112. P. Donovan and M. R. Freislich. The representation theory of finite graphs and associated algebras. Carleton University, Ottawa, Ont., 1973. Carleton Mathematical Lecture Notes, No. 5.
113. Z. Drmač, V. Hari, and I. Slapničar. Advances in Jacobi methods. In Applied mathematics and scientific computing (Dubrovnik, 2001), pages 63-90. Kluwer/Plenum, New York, 2003.
114. A. A. Dubrulle. The multishift QR algorithm-is it worth the trouble? TR 6320-3558, IBM Scientific Center, Palo Alto, CA, 1991.
115. A. A. Dubrulle and G. H. Golub. A multishift QR iteration without computation of the shifts. Numer. Algorithms, 7(2-4):173-181, 1994.
116. A. A. Dubrulle, R. S. Martin, and J. H. Wilkinson. The implicit QL algorithm. Numer. Math., 12:377-383, 1968. Also in [365, pp.241-248].
117. B. C. Eaves, A. J. Hoffman, U. G. Rothblum, and H. Schneider. Line-sumsymmetric scalings of square nonnegative matrices. Math. Programming Stud., 25:124-141, 1985.
118. P. J. Eberlein and C. P. Huang. Global convergence of the QR algorithm for unitary matrices with some results for normal matrices. SIAM J. Numer. Anal., 12:97-104, 1975.
119. R. Eising. Between controllable and uncontrollable. Systems Control Lett., 4(5):263-264, 1984.
120. O. G. Ernst. Equivalent iterative methods for p-cyclic matrices. Numer. Algorithms, 25(1-4):161-180, 2000.
121. T. F. Fairgrieve and Allan D. Jepson. O. K. Floquet multipliers. SIAM J. Numer. Anal., 28(5):1446-1462, 1991.
122. H. Faßbender. Symplectic methods for the symplectic eigenproblem. Kluwer Academic/Plenum Publishers, New York, 2000.
123. H. Faßbender and K. D. Ikramov. Computing matrix-vector products with centrosymmetric and centrohermitian matrices. Linear Algebra Appl., 364:235-241, 2003.
124. H. Faßbender, D. S. Mackey, and N. Mackey. Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems. Linear Algebra Appl., 332/334:37-80, 2001.
125. H. Faßbender, D. S. Mackey, N. Mackey, and H. Xu. Hamiltonian square roots of skew-Hamiltonian matrices. Linear Algebra Appl., 287(1-3):125-159, 1999.
126. W. R. Ferng, W.-W. Lin, and C.-S. Wang. The shift-inverted J-Lanczos algorithm for the numerical solutions of large sparse algebraic Riccati equations. Comput. Math. Appl., 33(10):23-40, 1997.
127. L. V. Foster. Gaussian elimination with partial pivoting can fail in practice. SIAM J. Matrix Anal. Appl., 15(4):1354-1362, 1994.
128. J. G. F. Francis. The QR transformation, parts I and II. Computer Journal, 4: 265-271+332-345, 1961, 1962.
129. G. Freiling, V. Mehrmann, and H. Xu. Existence, uniqueness, and parametrization of Lagrangian invariant subspaces. SIAM J. Matrix Anal. Appl., 23(4):1045-1069, 2002.
130. R. W. Freund, G. H. Golub, and M. Hochbruck. Krylov subspace methods for non-Hermitian p-cyclic matrices. Technical report, RIACS, NASA Ames Research Center, Moffet Field, CA, 1992. Cited in [131].
131. R. W. Freund, G. H. Golub, and N. M. Nachtigal. Recent advances in Lanczosbased iterative methods for nonsymmetric linear systems. In Algorithmic trends in computational fluid dynamics (1991), ICASE/NASA LaRC Ser., pages 137-162. Springer, New York, 1993.
132. K. A. Gallivan, S. Thirumala, P. Van Dooren, and V. Vermaut. High performance algorithms for Toeplitz and block Toeplitz matrices. Linear Algebra Appl., 241-243:343-388, 1996.
133. F.R. Gantmacher. The Theory of Matrices. Chelsea, New York, 1960
134. J. D. Gardiner. Stabilizing control for second-order models and positive real systems. AIAA J. Guidance, Dynamics and Control, 15(1):280-282, 1992.
135. Y. Genin, P. Van Dooren, and V. Vermaut. Convergence of the calculation of H∞ norms and related questions. In A. Beghi, L. Finesso, and G. Picci, editors, Proceedings of the Conference on the Mathematical Theory of Networks and Systems, MTNS'98, pages 429-432, 1998.
136. I. Gohberg, P. Lancaster, and L. Rodman. Matrix polynomials. Academic Press Inc. [Harcourt Brace Jovanovich Publishers], New York, 1982. Computer Science and Applied Mathematics.
137. G. H. Golub, P. Milanfar, and J. Varah. A stable numerical method for inverting shape from moments. SIAM J. Sci. Comput., 21(4):1222-1243, 1999/2000
138. G. H. Golub and C. Reinsch. Singular value decomposition and least squares solution. Numer. Math., 14:403-420, 1970.
139. G. H. Golub, K. Sølna, and P. Van Dooren. Computing the SVD of a general matrix product/quotient. SIAM J. Matrix Anal. Appl., 22(1):1-19, 2000.
140. G. H. Golub and H. van der Vorst. Eigenvalue computation in the 20th century. J. Comput. Appl. Math., 123(1-2):35-65, 2000.
141. G. H. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, MD, third edition, 1996.
142. J. Grad. Matrix balancing. Comput. J., 14:280-284, 1971.
143. W. B. Gragg. Positive definite Toeplitz matrices, the Hessenberg process for isometric operators, and the Gauss quadrature on the unit circle. In Numerical methods of linear algebra (Russian), pages 16-32. Moskov. Gos. Univ., Moscow, 1982.
144. W. B. Gragg. The QR algorithm for unitary Hessenberg matrices. J. Comput. Appl. Math., 16:1-8, 1986.
145. W. B. Gragg and L. Reichel. A divide and conquer method for unitary and orthogonal eigenproblems. Numer. Math., 57(8):695-718, 1990.
146. Graillat. Structured condition number and backward error for eigenvalue problems. Research Report RR2005-01, LP2A, University of Perpignan, France, 2005.
147. R. Granat and B. Kagström. Direct eigenvalue reordering in a product of matrices in extended periodic Schur form. Report UMINF-05.05, Department of Computing Science, Umea University, Umea, Sweden, 2005.
148. M. Green and D. J. N. Limebeer. Linear Robust Control. Prentice-Hall, Englewood Cliffs, NJ, 1995.
149. M. Gu. New methods for estimating the distance to uncontrollability. SIAM J. Matrix Anal. Appl., 21(3):989-1003, 2000.
150. M. Günther and U. Feldmann. The DAE-index in electric circuit simulation. Math. Comput. Simulation, 39(5-6):573-582, 1995.
151. C.-H. Guo and P. Lancaster. Analysis and modification of Newton's method for algebraic Riccati equations. Math. Comp., 67:1089-1105, 1998.
152. D. Hacon. Jacobi's method for skew-symmetric matrices. SIAM J. Matrix Anal. Appl., 14(3):619-628, 1993.
153. S. Hammarling. Numerical solution of the stable, nonnegative definite Lyapunov equation. IMA J. Numer. Anal., 2(3):303-323, 1982.
154. V. Hari. On the quadratic convergence of the Paardekooper method. I. Glas. Mat. Ser. III, 17(37)(1):183-195, 1982.
155. V. Hari and N. H. Rhee. On the quadratic convergence of the Paardekooper method. II. Glas. Mat. Ser. III, 27(47)(2):369-391, 1992.
156. D. J. Hartfiel. Concerning diagonal similarity of irreducible matrices. Proc. Amer. Math. Soc., 30:419-425, 1971.
157. 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.
158. J. J. Hench, C. He, V. Kučera, and V. Mehrmann. Dampening controllers via a Riccati equation approach. IEEE Trans. Automat. Control, 43(9):1280-1284, 1998.
159. J. J. Hench and A. J. Laub. Numerical solution of the discrete-time periodic Riccati equation. IEEE Trans. Automat. Control, 39(6):1197-1210, 1994.
160. H. V. Henderson and S. R. Searle. The vec-permutation matrix, the vec operator and Kronecker products: a review. Linear and Multilinear Algebra, 9(4):271-288, 1980/81.
161. G. Henry, D. S. Watkins, and J. Dongarra. A parallel implementation of the nonsymmetric QR algorithm for distributed memory architectures. SIAM J. Sci. Comput., 24(1):284-311, 2002.
162. D. J. Higham and N. J. Higham. Backward error and condition of structured linear systems. SIAM J. Matrix Anal. Appl., 13(1):162-175, 1992.
163. D. J. Higham and N. J. Higham. Structured backward error and condition of generalized eigenvalue problems. SIAM J. Matrix Anal. Appl., 20(2):493-512, 1999.
164. N. J. Higham. Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia, PA, 1996.
165. N. J. Higham, M. Konstantinov, V. Mehrmann, and P. Petkov. The sensitivity of computational control problems. IEEE Control Systems Magazine, 24(1):28-43, 2004.
166. A. Hilliges, C. Mehl, and V. Mehrmann. On the solution of palindromic eigen-value problems. In Proceedings of ECCOMAS, Jyväskylä, Finland, 2004.
167. D. Hinrichsen and A. J. Pritchard. Stability radii of linear systems. Systems Control Lett., 7(1):1-10, 1986.
168. D. Hinrichsen and A. J. Pritchard. Mathematical Systems Theory I, volume 48 of Texts in Applied Mathematics. Springer-Verlag, 2005.
169. M. E. Hochstenbach and B. Plestenjak. Backward error, condition numbers, and pseudospectra for the multiparameter eigenvalue problem. Linear Algebra Appl., 375:63-81, 2003.
170. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985.
171. R. A. Horn and C. R. Johnson. Topics in Matrix Analysis. Cambridge University Press, Cambridge, 1991.
172. C. G. J. Jacobi. Über ein leichtes Verfahren die in der Theorie der Säculärstörungen vorkommenden Gleichungen numerisch aufzulösen. Journal für die reine und angewandte Mathematik, 30:51-94, 1846. Cited in [327].
173. C. F. Jagels and L. Reichel. The isometric Arnoldi process and an application to iterative solution of large linear systems. In Iterative methods in linear algebra (Brussels, 1991), pages 361-369. North-Holland, Amsterdam, 1992.
174. C. F. Jagels and L. Reichel. A fast minimal residual algorithm for shifted unitary matrices. Numer. Linear Algebra Appl., 1(6):555-570, 1994.
175. I. M. Jaimoukha and E. M. Kasenally. Krylov subspace methods for solving large Lyapunov equations. SIAM J. Numer. Anal., 31:227-251, 1994.
176. I. Jonsson and B. K agström. Recursive blocked algorithm for solving triangular systems. I. one-sided and coupled Sylvester-type matrix equations. ACM Trans. Math. Software, 28(4):392-415, 2002.
177. I. Jonsson and B. Kagström. Recursive blocked algorithm for solving triangular systems. II. Two-sided and generalized Sylvester and Lyapunov matrix equations. ACM Trans. Math. Software, 28(4):416-435, 2002.
178. B. Kagström. The QR algorithm to find the eigensystem of a skew-symmetric matrix. Report UMINF-14.71, Institute of Information Processing, University of Umea, Sweden, 1971.
179. B. K agström. A direct method for reordering eigenvalues in the generalized real Schur form of a regular matrix pair (A, B). In M. S. Moonen, G. H. Golub, and B. L. R. De Moor, editors, Linear algebra for large scale and real-time applications (Leuven, 1992), volume 232 of NATO Adv. Sci. Inst. Ser. E Appl. Sci., pages 195-218. Kluwer Acad. Publ., Dordrecht, 1993.
180. B. Kagström and D. Kressner. Multishift variants of the QZ algorithm with aggressive early deflation. Report UMINF-05.11, Department of Computing Science, Umea University, Umea, Sweden, 2005.
181. -1 estimators. SIAM J. Matrix Anal. Appl., 13(1):90-101, 1992.
182. B. K agströ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(3-4):369-407, 1996.
183. B. K agström and P. Poromaa. LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs. ACM Trans. Math. Software, 22(1):78-103, 1996.
184. B. K agström and L. Westin. Generalized Schur methods with condition estimators for solving the generalized Sylvester equation. IEEE Trans. Automat. Control, 34(7):745-751, 1989.
185. B. Kalantari, L. Khachiyan, and A. Shokoufandeh. On the complexity of matrix balancing. SIAM J. Matrix Anal. Appl., 18(2):450-463, 1997.
186. M. Karow. Geometry of Spectral Value Sets. PhD thesis, Universität Bremen, Fachbereich 3 (Mathematik & Informatik), Bremen, Germany, 2003.
187. M. Karow. Structured Hölder condition numbers for multiple eigenvalues, 2005. In preparation.
188. M. Karow, D. Kressner, and F. Tisseur. Structured eigenvalue condition numbers, 2005. Submitted.
189. L. Kaufman. Some thoughts on the QZ algorithm for solving the generalized eigenvalue problem. ACM Trans. Math. Software, 3(1):65-75, 1977.
190. L. Kaufman. A parallel QR algorithm for the symmetric tridiagonal eigenvalue problem. Journal of Parallel and Distributed Computing, Vol 3:429-434, 1994.
191. D. L. Kleinman. On an iterative technique for Riccati equation computations. IEEE Trans. Automat. Control, AC-13:114-115, 1968.
192. M. Kleinsteuber, U. Helmke, and K. Hüper. Jacobi's algorithm on compact Lie algebras. SIAM J. Matrix Anal. Appl., 26(1):42-69, 2004.
193. D. E. Knuth. The Art of Computer Programming. Volume 3. Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1973. Sorting and searching, Addison-Wesley Series in Computer Science and Information Processing.
194. M. Konstantinov, D.-W. Gu, V. Mehrmann, and P. Petkov. Perturbation the-ory for matrix equations, volume 9 of Studies in Computational Mathematics. North-Holland Publishing Co., Amsterdam, 2003.
195. M. Konstantinov, V. Mehrmann, and P. Petkov. Perturbation analysis of Hamiltonian Schur and block-Schur forms. SIAM J. Matrix Anal. Appl., 23(2):387-424, 2001.
196. S. G. Krantz. Function Theory of Several Complex Variables. John Wiley & Sons Inc., New York, 1982.
197. D. Kressner. An efficient and reliable implementation of the periodic QZ algo-rithm. In IFAC Workshop on Periodic Control Systems, 2001.
198. D. Kressner. Block algorithms for orthogonal symplectic factorizations. BIT, 43(4):775-790, 2003.
199. D. Kressner. The periodic QR algorithm is a disguised QR algorithm, 2003. To appear in Linear Algebra Appl.
200. D. Kressner. Perturbation bounds for isotropic invariant subspaces of skew Hamiltonian matrices, 2003. To appear in SIAM J. Matrix Anal. Appl.
201. D. Kressner. A Krylov-Schur algorithm for matrix products, 2004. Submitted.
202. D. Kressner. Numerical Methods and Software for General and Structured Eigenvalue Problems. PhD thesis, TU Berlin, Institut für Mathematik, Berlin, Germany, 2004.
203. D. Kressner. Block algorithms for reordering standard and generalized Schur forms, 2005. In preparation.
204. D. Kressner, V. Mehrmann, and T. Penzl. CTDSX -a collection of benchmark examples for state-space realizations of continuous-time dynamical systems. SLICOT working note 1998-9, WGS, 1998.
205. D. Kressner and E. Mengi. Structure-exploiting methods for computing numerical and pseudospectral radii, 2005. Submitted.
206. V. N. Kublanovskaya. On some algorithms for the solution of the complete eigenvalue problem. Zhurnal Vychislitelnoi Matematiki i Matematicheskoi Fiziki, 1:555-570, 1961.
207. P. Lancaster and L. Rodman. The Algebraic Riccati Equation. Oxford University Press, Oxford, 1995.
208. B. Lang. Effiziente Orthogonaltransformationen bei der Eigen-und Singulärwertzerlegung. Habilitationsschrift, 1997.
209. B. Lang. Using level 3 BLAS in rotation-based algorithms. SIAM J. Sci. Comput., 19(2):626-634, 1998.
210. H. Langer and B. Najman. Leading coefficients of the eigenvalues of perturbed analytic matrix functions. Integral Equations Operator Theory, 16(4):600-604, 1993.
211. A. J. Laub. A Schur method for solving algebraic Riccati equations. IEEE Trans. Automat. Control, AC-24:913-921, 1979.
212. A. J. Laub. Invariant subspace methods for the numerical solution of Riccati equations. In S. Bittanti, A. J. Laub, and J. C. Willems, editors, The Riccati Equation, pages 163-196. Springer-Verlag, Berlin, 1991.
213. C. L. Lawson, R. J. Hanson, D. R. Kincaid, and F. T. Krogh. Basic linear algebra subprograms for fortran usage. ACM Trans. Math. Software, 5:308-323, 1979.
214. J. M. Lee. Introduction to smooth manifolds, volume 218 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2003.
215. R. B. Lehoucq and D. C. Sorensen. Deflation techniques for an implicitly restarted Arnoldi iteration. SIAM J. Matrix Anal. Appl., 17(4):789-821, 1996.
216. R. B. Lehoucq, D. C. Sorensen, and C. Yang. ARPACK users' guide. SIAM, Philadelphia, PA, 1998. Solution of large-scale eigenvalue problems with im-plicitly restarted Arnoldi methods.
217. B. J. Leimkuhler and E. S. Van Vleck. Orthosymplectic integration of linear Hamiltonian systems. Numer. Math., 77(2):269-282, 1997.
218. D. Lemonnier and P. Van Dooren. Balancing regular matrix pencils, 2004. Submitted to SIAM J. Matrix Anal. Appl.
219. W.-W. Lin and T.-C. Ho. On Schur type decompositions for Hamiltonian and symplectic pencils. Technical report, Institute of Applied Mathematics, National Tsing Hua University, Taiwan, 1990.
220. W.-W. Lin, V. Mehrmann, and H. Xu. Canonical forms for Hamiltonian and symplectic matrices and pencils. Linear Algebra Appl., 302/303:469-533, 1999.
221. W.-W. Lin and J.-G. Sun. Perturbation analysis for the eigenproblem of peri-odic matrix pairs. Linear Algebra Appl., 337:157-187, 2001.
222. W.-W. Lin, P. Van Dooren, and Q.-F. Xu. Periodic invariant subspaces in control. In Proc. of IFAC Workshop on Periodic Control Systems, Como, Italy, 2001.
223. X.-G. Liu. Differential expansion theory of matrix functions and its applications (in Chinese). PhD thesis, Computing Center, Academia Sinica, Beijing, 1990. Cited in [317].
224. K. Lust. Continuation and bifurcation analysis of periodic solutions of partial differential equations. In Continuation methods in fluid dynamics (Aussois, 1998), pages 191-202. Vieweg, Braunschweig, 2000.
225. K. Lust. Improved numerical Floquet multipliers. Internat. J. Bifur. Chaos Appl. Sci. Engrg., 11(9):2389-2410, 2001.
226. D. S. Mackey, N. Mackey, and D. Dunlavy. Structure preserving algorithms for perplectic eigenproblems. Electron. J. Linear Algebra, 13:10-39, 2005.
227. D. S. Mackey, N. Mackey, C. Mehl, and V. Mehrmann. Palindromic poly-nomial eigenvalue problems: Good vibrations from good linearizations, 2005. Submitted.
228. D. S. Mackey, N. Mackey, and F. Tisseur. Structured tools for structured matrices. Electron. J. Linear Algebra, 10:106-145, 2003.
229. D. S. Mackey, N. Mackey, and F. Tisseur. G-reflectors: analogues of House-holder transformations in scalar product spaces. Linear Algebra Appl., 385:187-213, 2004.
230. D. S. Mackey, N. Mackey, and F. Tisseur. Structured factorizations in scalar product spaces. Numerical Analysis Report No. 421, Manchester Centre for Computational Mathematics, 2004. To appear in SIAM J. Matrix Anal. Appl.
231. A. N. Malyshev. Balancing, pseudospectrum and inverse free iteration for matrix pencils, June 2004. Presentation given at the V International Workshop on Accurate Solution of Eigenvalue Problems, Hagen, Germany.
232. T. A. Manteuffel. Adaptive procedure for estimating parameters for the non-symmetric Tchebychev iteration. Numer. Math., 31(2):183-208, 1978.
233. R. S. Martin, G. Peters, and J. H. Wilkinson. The QR algorithm for real Hessenberg matrices. Numer. Math., 14:219-231, 1970. Also in [365, pp.359-371].
234. R. März. Canonical projectors for linear differential algebraic equations. Comput. Math. Appl., 31(4-5):121-135, 1996. Selected topics in numerical methods (Miskolc, 1994).
235. The MathWorks, Inc., Cochituate Place, 24 Prime Park Way, Natick, Mass, 01760. The Matlab Control Toolbox, Version 5, 2000.
236. The MathWorks, Inc., Cochituate Place, 24 Prime Park Way, Natick, Mass, 01760. Matlab Version 6.5, 2002.
237. C. Mehl. Condensed forms for skew-Hamiltonian/Hamiltonian pencils. SIAM J. Matrix Anal. Appl., 21(2):454-476, 1999.
238. C. Mehl. Anti-triangular and anti-m-Hessenberg forms for Hermitian matrices and pencils. Linear Algebra Appl., 317(1/3):143-176, 2000.
239. C. Mehl. Jacobi-like algorithms for the indefinite generalized Hermitian eigen-value problem. SIAM J. Matrix Anal. Appl., 25(4):964-985, 2004.
240. V. Mehrmann. The Autonomous Linear Quadratic Control Problem, Theory and Numerical Solution. Number 163 in Lecture Notes in Control and Information Sciences. Springer-Verlag, Heidelberg, 1991.
241. V. Mehrmann and E. Tan. Defect correction methods for the solution of algebraic Riccati equations. IEEE Trans. Automat. Control, 33(7):695-698, 1988.
242. V. Mehrmann and D. S. Watkins. Structure-preserving methods for computing eigenpairs of large sparse skew-Hamiltonian/Hamiltonian pencils. SIAM J. Sci. Comput., 22(6):1905-1925, 2000.
243. V. Mehrmann and H. Xu. An analysis of the pole placement problem. I. The single-input case. Electron. Trans. Numer. Anal., 4(Sept.):89-105, 1996.
244. V. Mehrmann and H. Xu. Choosing poles so that the single-input pole placement problem is well conditioned. SIAM J. Matrix Anal. Appl., 19(3):664-681, 1998.
245. A. Melman. Symmetric centrosymmetric matrix-vector multiplication. Linear Algebra Appl., 320(1/3):193-198, 2000.
246. R. A. Meyer and C. S. Burrus. A unified analysis of multirate and periodically time-varying digital filters. IEEE Trans. Circuits and Systems, CAS 22:162-168, 1975.
247. C. B. Moler. Cleve's corner: MATLAB incorporates LAPACK, 2000. See http://www.mathworks.com/company/newsletter/win00/index.shtml.
248. C. B. Moler and G. W. Stewart. An algorithm for generalized matrix eigenvalue problems. SIAM J. Numer. Anal., 10:241-256, 1973.
249. B. C. Moore. Principal component analysis in linear systems: controllability, observability, and model reduction. IEEE Trans. Automat. Control, 26(1):17-32, 1981.
250. J. Moro, J. V. Burke, and M. L. Overton. On the Lidskii-Vishik-Lyusternik perturbation theory for eigenvalues of matrices with arbitrary Jordan structure. SIAM J. Matrix Anal. Appl., 18(4):793-817, 1997.
251. Z. J. Mou. Fast algorithms for computing symmetric/Hermitian matrix-vector products. Electronic Letters, 27:1272-1274, 1991.
252. F. D. Murnaghan and A. Wintner. A canonical form for real matrices under orthogonal transformations. Proc. Natl. Acad. Sci. USA, 17:417-420, 1931.
253. L. A. Nazarova. Representations of quivers of infinite type. Izv. Akad. Nauk SSSR Ser. Mat., 37:752-791, 1973.
254. A. Nemirovski and U. G. Rothblum. On complexity of matrix scaling. Linear Algebra Appl., 302/303:435-460, 1999. Special issue dedicated to Hans Schneider (Madison, WI, 1998).
255. K. C. Ng and B. N. Parlett. Development of an accurate algorithm for EXP(Bt), Part I, Programs to swap diagonal block, Part II. CPAM-294, Univ. of California, Berkeley, 1988. Cited in [18].
256. S. Noschese and L. Pasquini. Eigenvalue condition numbers: zero-structured versus traditional. Preprint 28, Mathematics Department, University of Rome La Sapienza, Italy, 2004.
257. E. E. Osborne. On preconditioning of matrices. Journal of the ACM, 7:338-345, 1960.
258. M. H. C. Paardekooper. An eigenvalue algorithm for skew-symmetric matrices. Numer. Math., 17:189-202, 1971.
259. C. C. Paige. Bidiagonalization of matrices and solutions of the linear equations. SIAM J. Numer. Anal., 11:197-209, 1974.
260. C. C. Paige and C. F. Van Loan. A Schur decomposition for Hamiltonian matrices. Linear Algebra Appl., 41:11-32, 1981.
261. B. N. Parlett. The Symmetric Eigenvalue Problem, volume 20 of Classics in Applied Mathematics. SIAM, Philadelphia, PA, 1998. Corrected reprint of the 1980 original.
262. B. N. Parlett and J. Le. Forward instability of tridiagonal QR. SIAM J. Matrix Anal. Appl., 14(1):279-316, 1993.
263. B. N. Parlett and C. Reinsch. Balancing a matrix for calculation of eigenvalues and eigenvectors. Numer. Math., 13:293-304, 1969. Also in [365, pp.315-326].
264. G. Peters and J. H. Wilkinson. Inverse iteration, ill-conditioned equations and Newton's method. SIAM Rev., 21(3):339-360, 1979.
265. P. H. Petkov, N. D. Christov, and M. M. Konstantinov. Computational Methods for Linear Control Systems. Prentice-Hall, Hertfordshire, UK, 1991.
266. G. Quintana-Orti and R. van de Geijn. Improving the performance of reduction to Hessenberg form. FLAME working note #14, Department of Computer Sciences, The University of Texas at Austin, 2004.
267. P. J. Rabier and W. C. Rheinboldt. Nonholonomic motion of rigid mechanical systems from a DAE viewpoint. SIAM, Philadelphia, PA, 2000.
268. A. C. Raines and D. S. Watkins. A class of Hamiltonian-symplectic methods for solving the algebraic Riccati equation. Linear Algebra Appl., 205/206:1045-1060, 1994.
269. A. C. M. Ran and L. Rodman. Stability of invariant maximal semidefinite subspaces. I. Linear Algebra Appl., 62:51-86, 1984.
270. A. C. M. Ran and L. Rodman. Stability of invariant Lagrangian subspaces. I. In Topics in operator theory, volume 32 of Oper. Theory Adv. Appl., pages 181-218. Birkhäuser, Basel, 1988.
271. A. C. M. Ran and L. Rodman. Stability of invariant Lagrangian subspaces. II. In The Gohberg anniversary collection, Vol. I (Calgary, AB, 1988), volume 40 of Oper. Theory Adv. Appl., pages 391-425. Birkhäuser, Basel, 1989.
272. R. M. Reid. Some eigenvalue properties of persymmetric matrices. SIAM Rev., 39(2):313-316, 1997.
273. N. H. Rhee and V. Hari. On the cubic convergence of the Paardekooper method. BIT, 35(1):116-132, 1995.
274. U. G. Rothblum and H. Schneider. Scalings of matrices which have prespecified row sums and column sums via optimization. Linear Algebra Appl., 114/115:737-764, 1989.
275. A. Ruhe. An algorithm for numerical determination of the structure of a general matrix. BIT, 10:196-216, 1969.
276. S. M. Rump. Structured perturbations. I. Normwise distances. SIAM J. Matrix Anal. Appl., 25(1):1-30, 2003.
277. S. M. Rump. Eigenvalues, pseudosprectrum and structured perturbations, 2005. Submitted.
278. H. Rutishauser. Solution of eigenvalue problems with the LR transformation. Nat. Bur. Stand. App. Math. Ser., 49:47-81, 1958.
279. Y. Saad. On the rates of convergence of the Lanczos and the block Lanczos methods. SIAM Journal on Numerical Analysis, 17:687-706, 1980.
280. Y. Saad. Chebyshev acceleration techniques for solving nonsymmetric eigen-value problems. Math. Comp., 42(166):567-588, 1984.
281. Y. Saad. Numerical Methods for Large Eigenvalue Problems: Theory and Algorithms. John Wiley, New York, 1992.
282. R. Schreiber and C. F. Van Loan. A storage-efficient W Y representation for products of Householder transformations. SIAM J. Sci. Statist. Comput., 10(1):53-57, 1989.
283. V. V. Sergeichuk. Canonical matrices for linear matrix problems. Linear Algebra Appl., 317(1/3):53-102, 2000.
284. V. V. Sergeichuk. Computation of canonical matrices for chains and cycles of linear mappings. Linear Algebra Appl., 376:235-263, 2004.
285. V. Sima. Algorithms for Linear-Quadratic Optimization, volume 200 of Pure and Applied Mathematics. Marcel Dekker, Inc., New York, NY, 1996.
286. V. Sima. Accurate computation of eigenvalues and real Schur form of 2x2 real matrices. In Proceedings of the Second NICONET Workshop on Numerical Control Software: SLICOT, a Useful Tool in Industry, December 3, 1999, INRIA Rocquencourt, France, pages 81-86, 1999.
287. V. Simoncini. Variable accuracy of matrix-vector products in projection methods for eigencomputation, 2005. To appear in SIAM J. Numer. Anal.
288. V. Simoncini and D. B. Szyld. Theory of inexact Krylov subspace methods and applications to scientific computing. SIAM J. Sci. Comput., 25(2):454-477, 2003.
289. R. Sinkhorn. A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Statist., 35:876-879, 1964.
290. P. Smit. Numerical Analysis of Eigenvalue Algorithms Based on Subspace Iterations. PhD thesis, Catholic University Brabant, The Netherlands, 1997.
291. B. T. Smith, J. M. Boyle, J. J. Dongarra, B. S. Garbow, Y. Ikebe, V. C. Klema, and C. B. Moler. Matrix Eigensystem Routines-EISPACK Guide. Lecture Notes in Computer Science. Springer-Verlag, New York, second edition, 1976.
292. R. L. Smith. Algorithm 116: Complex division. Comm. ACM, 5(8):435, 1962.
293. M. Sofroniou and G. Spaletta. Symplectic methods for separable Hamiltonian systems. In P.M.A. Sloot et al., editor, ICCS 2002, LNCS 2329, pages 506-515. Springer-Verlag, 2002.
294. D. C. Sorensen. Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. Appl., 13:357-385, 1992.
295. D. C. Sorensen. Implicitly restarted Arnoldi/Lanczos methods for large scale eigenvalue calculations. In Parallel numerical algorithms (Hampton, VA, 1994), volume 4 of ICASE/LaRC Interdiscip. Ser. Sci. Eng., pages 119-165. Kluwer Acad. Publ., Dordrecht, 1997.
296. D. C. Sorensen. Passivity preserving model reduction via interpolation of spectral zeros. Technical report TR02-15, ECE-CAAM Depts, Rice University, 2002.
297. J. Sreedhar and P. Van Dooren. A Schur approach for solving some periodic matrix equations. In U. Helmke, R. Mennicken, and J. Saurer, editors, Systems and Networks: Mathematical Theory and Applications, volume 77, pages 339-362. Akademie Verlag, Berlin, 1994.
298. J. Stefanovski and K. Trenčevski. Antisymmetric Riccati matrix equation. In 1st Congress of the Mathematicians and Computer Scientists of Macedonia (Ohrid, 1996), pages 83-92. Sojuz. Mat. Inform. Maked., Skopje, 1998.
299. G. W. Stewart. Error bounds for approximate invariant subspaces of closed linear operators. SIAM J. Numer. Anal., 8:796-808, 1971.
300. G. W. Stewart. On the sensitivity of the eigenvalue problem Ax = λBx. SIAM J. Numer. Anal., 9:669-686, 1972.
301. G. W. Stewart. Error and perturbation bounds for subspaces associated with certain eigenvalue problems. SIAM Rev., 15:727-764, 1973.
302. G. W. Stewart. Gerschgorin theory for the generalized eigenvalue problem Ax = λBx. Mathematics of Computation, 29:600-606, 1975.
303. G. W. Stewart. Algorithm 407: HQR3 and EXCHNG: FORTRAN programs for calculating the eigenvalues of a real upper Hessenberg matrix in a prescribed order. ACM Trans. Math. Software, 2:275-280, 1976.
304. G. W. Stewart. Matrix Algorithms. Vol. I. SIAM, Philadelphia, PA, 1998. Basic decompositions.
305. G. W. Stewart. Matrix Algorithms. Vol. II. SIAM, Philadelphia, PA, 2001. Eigensystems.
306. G. W. Stewart. On the eigensystems of graded matrices. Numer. Math., 90(2):349-370, 2001.
307. G. W. Stewart. A Krylov-Schur algorithm for large eigenproblems. SIAM J. Matrix Anal. Appl., 23(3):601-614, 2001/02.
308. G. W. Stewart and J.-G. Sun. Matrix Perturbation Theory. Academic Press, New York, 1990.
309. W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton, NJ, 1994.
310. T. Ström. Minimization of norms and logarithmic norms by diagonal similarities. Computing (Arch. Elektron. Rechnen), 10:1-7, 1972.
311. T. Stykel. Balanced truncation model reduction for semidiscretized Stokes equation. Technical report 04-2003, Institut für Mathematik, TU Berlin, 2003.
312. T. Stykel. Gramian-based model reduction for descriptor systems. Math. Control Signals Systems, 16:297-319, 2004.
313. J.-G. Sun. Perturbation expansions for invariant subspaces. Linear Algebra Appl., 153:85-97, 1991.
314. J.-G. Sun. A note on backward perturbations for the Hermitian eigenvalue problem. BIT, 35(3):385-393, 1995.
315. J.-G. Sun. Perturbation analysis of singular subspaces and deflating subspaces. Numer. Math., 73(2):235-263, 1996.
316. J.-G. Sun. Backward errors for the unitary eigenproblem. Report UMINF-97.25, Department of Computing Science, Umea University, Umea, Sweden, 1997.
317. J.-G. Sun. Stability and accuracy: Perturbation analysis of algebraic eigen-problems. Technical report UMINF 98-07, Department of Computing Science, University of Umea, Umea, Sweden, 1998. Revised 2002.
318. J.-G. Sun. Perturbation analysis of algebraic Riccati equations. Technical report UMINF 02-03, Department of Computing Science, University of Umea, Umea, Sweden, 2002.
319. R. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Comput., 1(2):146-160, 1972.
320. R. C. Thompson. Pencils of complex and real symmetric and skew matrices. Linear Algebra Appl., 147:323-371, 1991.
321. C. Tischendorf. Topological index calculation of differential-algebraic equations in circuit simulation. Surveys Math. Indust., 8(3/4):187-199, 1999.
322. F. Tisseur. Backward stability of the QR algorithm. TR 239, UMR 5585 Lyon Saint-Etienne, 1996.
323. F. Tisseur. A chart of backward errors for singly and doubly structured eigen-value problems. SIAM J. Matrix Anal. Appl., 24(3):877-897, 2003.
324. F. Tisseur and K. Meerbergen. The quadratic eigenvalue problem. SIAM Rev., 43(2):235-286, 2001.
325. M.S. Tombs and I. Postlethwaite. Truncated balanced realization of a stable non-minimal state-space system. Internat. J. Control, 46(4):1319-1330, 1987.
326. L. N. Trefethen and M. Embree. Spectra and Pseudospectra: The Behavior of Non-Normal Matrices and Operators. Princeton University Press, 2005. To appear.
327. H. van der Vorst and G. H. Golub. 150 years old and still alive: eigenproblems. In The state of the art in numerical analysis (York, 1996), volume 63 of Inst. Math. Appl. Conf. Ser. New Ser., pages 93-119. Oxford Univ. Press, New York, 1997.
328. P. Van Dooren. Algorithm 590: DSUBSP and EXCHQZ: Fortran subroutines for computing deflating subspaces with specified spectrum. ACM Trans. Math. Softw., 8:376-382, 1982.
329. P. Van Dooren. Numerical Linear Algebra for Signal, Systems and Control. Draft notes prepared for the Graduate School in Systems and Control, 2003.
330. C. F. Van Loan. Generalized Singular Values with Algorithms and Applications. PhD thesis, The University of Michigan, 1973.
331. C. F. Van Loan. A general matrix eigenvalue algorithm. SIAM J. Numer. Anal., 12(6):819-834, 1975.
332. C. F. Van Loan. How near is a matrix to an unstable matrix? Lin. Alg. And its Role in Systems Theory, 47:465-479, 1984.
333. C. F. Van Loan. A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix. Linear Algebra Appl., 61:233-251, 1984.
334. A. Varga. A multishift Hessenberg method for pole assignment of single-input systems. IEEE Trans. Automat. Control, 41(12):1795-1799, 1996.
335. A. Varga. Periodic Lyapunov equations: some applications and new algorithms. Internat. J. Control, 67(1):69-87, 1997.
336. A. Varga. Balancing related methods for minimal realization of periodic systems. Systems Control Lett., 36(5):339-349, 1999.
337. A. Varga. Computation of Kronecker-like forms of periodic matrix pairs. In Proc. of Sixteenth International Symposium on Mathematical Theory of Networks and Systems (MTNS 2004), Leuven, Belgium, 2004.
338. A. Varga and P. Van Dooren. Computational methods for periodic systems - an overview. In Proc. of IFAC Workshop on Periodic Control Systems, Como, Italy, pages 171-176, 2001.
339. R. S. Varga. Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, NJ, 1962.
340. H. Voss. A symmetry exploiting Lanczos method for symmetric Toeplitz matrices. Numer. Algorithms, 25(1/4):377-385, 2000.
341. H. F. Walker. Implementation of the GMRES method using Householder transformations. SIAM J. Sci. Stat. Comp., 9:152-163, 1988.
342. T.-L. Wang and W. B. Gragg. Convergence of the shifted QR algorithm for unitary Hessenberg matrices. Math. Comp., 71(240):1473-1496, 2002.
343. T.-L. Wang and W. B. Gragg. Convergence of the unitary QR algorithm with a unimodular Wilkinson shift. Math. Comp., 72(241):375-385, 2003.
344. R. C. Ward. A numerical solution to the generalized eigenvalue problem. PhD thesis, University of Virginia, Charlottesville, Va., 1974.
345. R. C. Ward. The combination shift QZ algorithm. SIAM J. Numer. Anal., 12(6):835-853, 1975.
346. R. C. Ward. Balancing the generalized eigenvalue problem. SIAM J. Sci. Statist. Comput., 2(2):141-152, 1981.
347. R. C. Ward and L. J. Gray. Eigensystem computation for skew-symmetric matrices and a class of symmetric matrices. ACM Trans. Math. Software, 4(3):278-285, 1978.
348. D. S. Watkins. Some perspectives on the eigenvalue problem. SIAM Review, 35:430-471, 1993.
349. D. S. Watkins. Shifting strategies for the parallel QR algorithm. SIAM J. Sci. Comput., 15(4):953-958, 1994.
350. D. S. Watkins. Forward stability and transmission of shifts in the QR algorithm. SIAM J. Matrix Anal. Appl., 16(2):469-487, 1995.
351. D. S. Watkins. The transmission of shifts and shift blurring in the QR algorithm. Linear Algebra Appl., 241/243:877-896, 1996.
352. D. S. Watkins. Bulge exchanges in algorithms of QR type. SIAM J. Matrix Anal. Appl., 19(4):1074-1096, 1998.
353. D. S. Watkins. Performance of the QZ algorithm in the presence of infinite eigenvalues. SIAM J. Matrix Anal. Appl., 22(2):364-375, 2000.
354. D. S. Watkins. Fundamentals of Matrix Computations. Pure and Applied Mathematics. Wiley-Interscience [John Wiley & Sons], New York, 2002. Second editon.
355. D. S. Watkins. On Hamiltonian and symplectic Lanczos processes. Linear Algebra Appl., 385:23-45, 2004.
356. D. S. Watkins. A case where balancing is harmful, 2005. Submitted.
357. D. S. Watkins. Product eigenvalue problems. SIAM Rev., 47:3-40, 2005.
358. D. S. Watkins and L. Elsner. Chasing algorithms for the eigenvalue problem. SIAM J. Matrix Anal. Appl., 12(2):374-384, 1991.
359. D. S. Watkins and L. Elsner. Convergence of algorithms of decomposition type for the eigenvalue problem. Linear Algebra Appl., 143:19-47, 1991.
360. D. S. Watkins and L. Elsner. Theory of decomposition and bulge-chasing algorithms for the generalized eigenvalue problem. SIAM J. Matrix Anal. Appl., 15:943-967, 1994.
361. J. R. Weaver. Centrosymmetric (cross-symmetric) matrices, their basic properties, eigenvalues, and eigenvectors. Amer. Math. Monthly, 92(10):711-717, 1985.
362. H. Weyl. The Classical Groups. Princeton University Press, Princeton, NJ, 1973. 8th Printing.
363. N. J. Wildberger. Diagonalization in compact Lie algebras and a new proof of a theorem of Kostant. Proc. Amer. Math. Soc., 119(2):649-655, 1993.
364. J. H. Wilkinson. The Algebraic Eigenvalue Problem. Clarendon Press, Oxford, 1965.
365. J. H. Wilkinson and C. Reinsch. Handbook for Automatic Computation. Vol. II Linear Algebra. Springer-Verlag, New York, 1971.
366. The Working Group on Software: WGS, Available from http://www.win.tue.nl/wgs/reports.html. SLICOT Implementation and Documentation Standards 2.1, 1996. WGS-report 96-1.
367. S. J. Wright. A collection of problems for which Gaussian elimination with partial pivoting is unstable. SIAM J. Sci. Comput., 14(1):231-238, 1993.
368. K. Zhou, J. C. Doyle, and K. Glover. Robust and Optimal Control. Prentice-Hall, Upper Saddle River, NJ, 1996.