The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method

Linear Algebra and Its Applications

Volumn 275-276, Issue , 1998, Pages 19-47

  Benner, Peter ^a   Faßbender, Heike ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

Butterfly form; Eigenvalues; Symplectic Lanczos method; Symplectic matrix

Indexed keywords

EID: 0032390274     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(97)10049-0     Document Type: Article

References (41)

1. G.S. Ammar, V. Mehrmann, On Hamiltonian and symplectic Hessenberg forms. Linear Algebra Appl. 149 (1991) 55-72.
2. G. Banse, Symplektische Eigenwertverfahren zur Lösung zeitdiskreter optimaler Steuerungs-probleme, Dissertation, Universität Bremen, Fachbereich 3 - Mathematik und Informatik, Bremen, Germany, 1995.
3. G. Banse, Condensed forms for symplectic matrices and symplectic pencils in optimal control, ZAMM 76 (Suppl. 3) (1996) 375-376.
4. G. Banse, A. Bunse-Gerstner, A condensed form for the solution of the symplectic eigenvalue problem, in: U. Helmke, R. Menniken, J. Sauer (Eds.). Systems and Networks: Mathematical Theory and Applications, Akademie Verlag, 1994, pp. 613-616.
5. P. Benner, H. Faßbender, An implicitly restarted symplectic Lanczos method for the symplectic eigenvalue problem, in preparation.
6. P. Benner, H. Faßbender, An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem, Linear Algebra Appl. 263 (1997) 75-111.
7. J.R. Bunch, The weak and strong stability of algorithms in numerical algebra. Linear Algebra Appl. 88 (1987) 49-66.
8. A. Bunse-Gerstner, Matrix factorizations for symplectic QR-like methods. Linear Algebra Appl. 83 (1986) 49-77.
9. A. Bunse-Gerstner, L. Elsner, Schur parameter pencils for the solution of the unitary eigenproblem. Linear Algebra Appl. 154-156 (1991) 741-778.
10. A. Bunse-Gerstner, V. Mehrmann, A symplectic QR-like algorithm for the solution of the real algebraic Riccati equation, IEEE Trans. Automat. Control AC-31 (1986) 1104-1113.
11. D. Calvetti, L. Reichel, D.C. Sorensen, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, Electron. Trans. Num. Anal. 2 (1994) 1-21.
12. J. Della-Dora, Numerical linear algorithms and group theory, Linear Algebra Appl. 10 (1975) 267-283.
13. L. Elsner, On some algebraic problems in connection with general eigenvalue algorithms, Linear Algebra Appl. 26 (1979) 123-138.
14. L. Elsner, K. Ikramov, On a condensed form for normal matrices under finite sequences of unitary similarities, Linear Algebra Appl. 254 (1997) 79-98.
15. H. Faßbender, On numerical methods for discrete least-squares approximation by trigonometric polynomials, Math. Comp. 66 (1997) 719-741.
16. U. Flaschka, V. Mehrmann, D. Zywietz, An analysis of structure preserving methods for symplectic eigenvalue problems, RAIRO Automatique Productique Informatique Industrielle 25 (1991) 165-190.
17. J.G.F. Francis, The QR transformation, Part I and Part II, Comput. J. 4 (1961) 265-271 and 332-345.
18. R. Freund, Transpose-free quasi-minimal residual methods for non-Hermitian linear systems, in: G. Golub et al. (Ed.), Recent advances in iterative methods. Papers from the IMA workshop on iterative methods for sparse and structured problems, held in Minneapolis, MN, 24 February-1 March 1992., IMA Vol. Math. Appl., vol. 60, Springer, New York, 1994, pp. 69-94.
19. R.W. Freund, M.H. Gutknecht, N.M. Nachtigal, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Comput. 14(1) (1993) 137-158.
20. G.H. Golub, C.F. van Loan, Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, MD, 1989.
21. E.J. Grimme, D.C. Sorensen, P. van Dooren, Model reduction of state space systems via an implicitly restarted Lanczos method. Num. Alg. 12 (1996) 1-31.
22. D. Hinrichsen, N.K. Son, Stability radii of linear discrete-time systems and symplectic pencils, Int. J. Robust Nonlinear Control 1 (1991) 79-97.
23. V.N. Kublanoskaja, On some algorithms for the solution of the complete eigenvalue problem, USSR Comput. Math. and Math. Phys. 3 (1961) 637-657.
24. P. Lancaster, L. Rodman, The Algebraic Riccati Equation, Oxford University Press, Oxford, 1995.
25. A.J. Laub, Invariant subspace methods for the numerical solution of Riccati equations, in: S. Bittanti, A.J. Laub, J.C. Willems (Eds.), The Riccati Equation, Springer, Berlin, 1991, pp. 163-196.
26. W.-W. Lin, A new method for computing the closed loop eigenvalues of a discrete-time algebraic Riccati equation, Linear Algebra Appl. 6 (1987) 157-180.
27. V. Mehrmann, Der SR-Algorithmus zur Berechnung der Eigenwerte einer Matrix, Diplomarbeit, Universität Bielefeld, Bielefeld, FRG, 1979.
28. V. Mehrmann, A symplectic orthogonal method for single input or single output discrete time optimal linear quadratic control problems, SIAM J. Matrix Anal. Appl. 9 (1988) 221-248.
29. V. Mehrmann, The Autonomous Linear Quadratic Control Problem, Theory and Numerical Solution, Lecture Notes in Control and Information Sciences, vol. 163, Springer, Heidelberg, 1991.
30. C.C. Paige, C.F. Van Loan, A Schur decomposition for Hamiltonian matrices, Linear Algebra Appl. 14 (1981) 11-32.
31. T. Pappas, A.J. Laub, N.R. Sandell, On the numerical solution of the discrete-time algebraic Riccati equation, IEEE Trans. Automat. Control AC-25 (1980) 631-641.
32. B.N. Parlett, D.R. Taylor, Z.A. Liu, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp. 44 (169) (1985) 105-124.
33. R.V. Patel, Computation of the stable deflating subspace of a symplectic pencil using structure preserving orthogonal transformations, in: Proceedings of the 31st Annual Allerton Conference on Communication, Control and Computing, University of Illinois, 1993.
34. R.V. Patel, On computing the eigenvalues of a symplectic pencil, Linear Algebra Appl. 188/189 (1993) 591-611. See also: Proc. CDC-31, Tuscon. AZ, 1992, pp. 1921-1926.
35. R.V. Patel, On computing the eigenvalues of a symplectic pencil, Linear Algebra Appl. 188/189 (1993) 591-611. See also: Proc. CDC-31, Tuscon. AZ, 1992, pp. 1921-1926.
36. D.C. Sorensen, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl. 13 (1) (1992) 357-385.
37. D.R. Taylor, Analysis of the Look Ahead Lanczos Algorithm, Ph.D. Thesis, Center for Pure and Applied Mathematics, University of California, Berkeley, CA, 1982.
38. C.F. Van Loan, A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix, Linear Algebra Appl. 16 (1984) 233-251.
39. D.S. Watkins, Some perspectives on the eigenvalue problem, SIAM Rev. 35 (1993) 430-471.
40. D.S. Watkins, L. Elsner, Chasing algorithms for the eigenvalue problem, SIAM J. Matrix Anal. Appl. 12 (1991) 374-384.
41. D.S. Watkins, L. Elsner, Convergence of algorithms of decomposition type for the eigenvalue problem, Linear Algebra Appl. 143 (1995) 19-47.