A numerically stable, structure preserving method for computing the eigenvalues of real Hamiltonian or symplectic pencils

Numerische Mathematik

Volumn 78, Issue 3, 1998, Pages 329-358

  Benner, Peter ^a   Mehrmann, Volker ^b   Xu, Hongguo ^b,c  

^a UNIVERSITY OF BREMEN   (Germany)

^b CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

^c FUDAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032344706     PISSN: 0029599X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002110050315     Document Type: Article

References (29)

1. Ammar, G.S., Mehrmann, V. (1991): On Hamiltonian and symplectic Hessenberg forms. Linear Algebra Appl. 149, 55-72
2. Ammar, G.S., Benner, P., Mehrmann, V. (1993): A multishift algorithm for the numerical solution of algebraic Riccati equations. Electr. Trans. Num. Anal. 1, 33-48
3. Anderson, E., Bai, Z., Bischof, C., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Ostrouchov, S., Sorensen, D. (1994): LAPACK Users' Guide. SIAM, Philadelphia, PA, second edition
4. Benner, P., Byers, R., Barth, E. (1996): HAMEV and SQRED: Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices using Van Loan's square reduced method. Technical Report SFB393/96-06, Fak. Mathematik, f., TU Chemnitz-Zwickau, 09107 Chemnitz, FRG Available as SFB393_96-06. ps via anonymous ftp from ftp. tu-chemnitz. de, directory /pub/Local/mathematik/Benner.
5. Benner, P., Laub, A., Mehrmann, V. (1995): A collection of benchmark examples for the numerical solution of algebraic Riccati equations I: Continuous-time case. Technical Report SPC 95_22, Fak. Mathematik, f., TU Chemnitz-Zwickau, 09107 Chemnitz, FRG Available as SPC95_22. ps via anonymous ftp from ftp. tu-chemnitz. de, directory /pub/Local/mathematik/Benner.
6. Bojanczyk, A., Golub, G.H., Van Dooren, P. (1992): The periodic Schur decomposition; algorithms and applications. In Proc. SPIE Conference, vol. 1770, pp. 31-42
7. Bunse-Gerstner, A. (1986): Matrix factorization for symplectic QR-like methods. Linear Algebra Appl. 83, 49-77
8. Bunse-Gerstner, A., Byers, R., Mehrmann, V. (1989): Numerical methods for algebraic Riccati equations. In Bittanti, S., (ed.) Proc. Workshop on the Riccati Equation in Control, Systems, and Signals, pp. 107-116, Como, Italy
9. Golub, G.H., Van Loan, C.F. (1989): Matrix Computations. Johns Hopkins University Press, Baltimore, second edition
10. Hench, J.J., Laub, A.J. (1992): An extension of the QR algorithm for a sequence of matrices. Technical Report CCEC-92-0829, ECE Dept., University of California, Santa Barbara, CA
11. Hench, J.J., Laub, A.J. (1994): Numerical solution of the discrete-time periodic Riccati equation. IEEE Trans. Automat. Control 39, 1197-1210
12. Lancaster, P., Rodman, L. (1995): The Algebraic Riccati Equation. Oxford University Press, Oxford
13. Laub, A.J. (1979): A Schur method for solving algebraic Riccati equations. IEEE Trans. Automat. Control AC-24, 913-921 (See also Proc. 1978 CDC (Jan. 1979), pp. 60-65)
14. Laub, A.J. (1979): A Schur method for solving algebraic Riccati equations. IEEE Trans. Automat. Control AC-24, 913-921 (See also Proc. 1978 CDC (Jan. 1979), pp. 60-65)
15. Laub, A.J. (1986): Algebraic aspects of generalized eigenvalue problems for solving Riccati equations. In Byrnes, C.I., Lindquist, A. (eds.) Computational and Combinatorial Methods in Systems Theory, pp. 213-227. Elsevier (North-Holland)
16. Laub, A.J. (1991): Invariant subspace methods for the numerical solution of Riccati equations. In Bittanti, S., Laub, A.J., Willems, J.C. (eds.) The Riccati Equation, pp. 163-196. Springer-Verlag, Berlin
17. Lin, W.-W. (1987): A new method for computing the closed loop eigenvalues of a discrete-time algebraic Riccati equation. Linear Algebra Appl. 6, 157-180
18. Mehrmann, V. (1991): The Autonomous Linear Quadratic Control Problem, Theory and Numerical Solution. Number 163 in Lecture Notes in Control and Information Sciences. Springer-Verlag, Heidelberg
19. Mehrmann, V. (1996): A step toward a unified treatment of continuous and discrete time control problems. Linear Algebra Appl. 241-243, 749-779
20. Moler, C.B., Stewart, G.W. (1973): An algorithm for generalized matrix eigenvalue problems. SIAM J. Numer. Anal. 10, 241-256
21. Paige, C.C., Van Loan, C.F. (1981): A Schur decomposition for Hamiltonian matrices. Linear Algebra Appl. 14, 11-32
22. Patel, R.V. (1993): On computing the eigenvalues of a symplectic pencil. Linear Algebra Appl. 188/189:591-611 (See also: Proc. CDC-31, Tuscon, AZ, 1992, pp. 1921-1926)
23. Patel, R.V. (1993): On computing the eigenvalues of a symplectic pencil. Linear Algebra Appl. 188/189:591-611 (See also: Proc. CDC-31, Tuscon, AZ, 1992, pp. 1921-1926)
24. Stewart, G.W. (1992): An updating algorithm for subspace tracking. IEEE Trans. Signal Proc. 40, 1535-1541
25. Stewart, G.W., Sun, J.-G. (1990): Matrix Perturbation Theory. Academic Press, New York
26. Stewart, G.W. (1993): Updating a rank revealing ULV decomposition. SIAM J. Matrix Anal. Appl. 4, 494-499
27. Van Loan, C.F. (1984): A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix. Linear Algebra Appl. 16, 233-251
28. Varga, A. (1996): Personal communcication
29. Wilkinson, J.H. (1965): The Algebraic Eigenvalue Problem. Oxford University Press, Oxford