An implicitly restarted symplectic Lanczos method for the Hamiltonian Eigenvalue problem

Linear Algebra and Its Applications

Volumn 263, Issue 1-3, 1997, Pages 75-111

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

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040689412     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(96)00524-1     Document Type: Article

References (46)

1. G. Ammar, P. Benner, and V. Mehrmann, A multishift algorithm for the numerical solution of algebraic Riccati equations, Electron. Trans. Numer. Anal. 1:33-48 (1993).
2. W. Arnold, III, and A. Laub, Generalized eigenproblem algorithms and software for algebraic Riccati equations, Proc. IEEE 72:1746-1754 (1984).
3. P. Benner and H. Faβ bender, A Restarted Symplectic Lanczos Method for the Hamiltonian Eigenvalue Problem, Tech. Rep. SPC 95_28, Fak f. Mathematik, TU Chemnitz-Zwickau, 09107 Chemnitz, FRG, 1995.
4. P. Benner, A. Laub, and V. Mehrmann, A Collection of Benchmark Examples for the Numerical Solution of Algebraic Riccati Equation I: Continuous-Time Case, Tech. Rep. SPC 95_22, Fak. f. Mathematik, TU Chemnitz-Zwickau, 09107 Chemnitz, FRG, 1995.
5. J. Bunch, The weak and strong stability of algorithms in numerical algebra, Linear Algebra Appl. 88:49-66 (1987).
6. W. Bunse and A. Bunse-Gerstner, Numerische Lineare Algebra, Teubner, Stuttgart, 1985.
7. A. Bunse-Gerstner, An analysis of the HR algorithm for computing the eigenvalues of a matrix, Linear Algebra Appl. 35:155-173 (1981).
8. A. Bunse-Gerstner, Matrix factorization for symplectic QR-like methods, Linear Algebra Appl. 83:49-77 (1986).
9. A. Bunse-Gerstner and V. Mehrmann, A symplectic QR-like algorithm for the solution of the real algebraic Riccati equation, IEEE Trans. Automat. Control AC-31:1104-1113 (1986).
10. R. Byers, Hamiltonian and Symplectic Algorithms for the Algebraic Riccati Equation, Ph.D. Thesis, Dept. of Computer Science, Cornell Univ., Ithaca, N.Y., 1983.
11. _, A Hamiltonian QR-algorithm, SIAM J. Sci. Statist. Comput. 7:212-229 (1986).
12. _, A bisection method for measuring the distance of a stable to unstable matrices, SIAM J. Sci. Statist. Comput. 9:875-881 (1988).
13. D. Calvetti, L. Reichet, and D. C. Sorensen, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, Electron. Trans. Numer. Anal. 2:1-21 (1994).
14. J. Chow and P. Kokotovic, A decomposition of near-optimum regulators for systems with slow and fast modes, IEEE Trans. Automat. Control AC-21:701-705 (1976).
15. J. Della-Dora, Sur Quelques Algorithmes de Recherche de Valeurs Propres, Thèse, Univ. Scientifique et Medicale de Grenoble, 1973.
16. P. Van Dooren, Talk given at IMA Conference on Linear Algebra and Applications, Manchester, U.K., July 1995.
17. ∞ control problems, IEEE Trans. Automat. Control AC-34:831-847 (1989).
18. L. Elsner, On some algebraic problems in connection with general eigenvalue algorithms, Linear Algebra Appl. 26:123-138 (1979).
19. U. Flaschka, Eine Variante des Lanczos-Algorithmus für große, dünn besetzte symmetrische Matrizen mit Blockstruktur, Preprint 92-057, SFB 343, "Diskrete Strukturen in der Mathematik," Univ. Bielefeld, Bielefeld, FRG, 1992.
20. J. G. F. Francis, The QR transformation, Parts I and II, Comput. J. 4:265-271, 332-345 (1961).
21. R. Freund, Transpose-Free Quasi-Minimal Residual Methods for Non-Hermitian Linear Systems, Numerical Analysis Manuscript 92-97, AT & T Bell Labs., 1992.
22. R. Freund, Lanczos-type algorithms for structured non-Hermitian eigenvalue problems, in Proceedings of the Cornelius Lanczos International Centenary Conference (J. Brown, M. Chu, D. Ellison, and R. Plemmons, Eds.), SIAM, 1994, pp. 243-245.
23. R. Freund and V. Mehrmann, A Symplectic Look-ahead Lanczos Algorithm for the Hamiltonian Eigenvalue Problem, Manuscript.
24. R. W. Freund, M. H. Gutknecht, and N. M. Nachtigal, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Comput. 14:137-158 (1993).
25. G. Golub and C. Van Loan, Matrix Computations, 2nd ed., Johns Hopkins U.P., Baltimore, 1989.
26. E. Grimme, D. Sorensen, and P. Van Dooren, Model reduction of state space systems via an implicitly restarted Lanczos method, Numer. Algorithms 12:1-31 (1996).
27. M. Gutknecht, A completed theory of the unsymmetric Lanczos process and related algorithms, Part I, SIAM J. Matrix Anal. Appl. 13:594-639 (1992).
28. _, A completed theory of the unsymmetric Lanczos process and related algorithms, Part II, SIAM J. Matrix Anal. Appl. 15:15-58 (1994).
29. A. Hodel and K. Poolla, Heuristic approaches to the solution of very large sparse Lyapunov and algebraic Riccati equations, in Proceedings of the 27th IEEE Conference on Decision and Control, Austin, Tex., 1988, pp. 2217-2222.
30. A. S. Householder, The Theory of Matrices in Numerical Analysis, Blaisdell, New York, 1964.
31. I. M. Jaimoukha and E. M. Kasenally, Krylov subspace methods for solving large Lyapunov equations, SIAM J. Numer. Anal. 31:227-251 (1994).
32. V. N. Kublanoskaja, On some algorithms for the solution of the complete eigenvalue problem, U.S.S.R. Comput. Math. and Math. Phys. 3:637-657 (1961).
33. P. Lancaster and L. Rodman, The Algebraic Riccati Equation, Oxford U.P., Oxford, 1995.
34. C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Standards 45:255-282 (1950).
35. A. Laub, Invariant subspace methods for the numerical solution of Riccati equations, in The Riccati Equation (S. Bittanti, A. Laub, and J. Willems, Eds.), Springer-Verlag, Berlin, 1991, pp. 163-196.
36. V. Mehrmann, Der SR-Algorithmus zur Berechnung der Eigenwerte einer Matrix, Diplomarbeit, Univ. Bielefeld, Bielefeld, FRG, 1979.
37. _, The Autonomous Linear Quadratic Control Problem, Theory and Numerical Solution, Lecture Notes in Control and Inform. Sci. 163, Springer-Verlag, Heidelberg, July 1991.
38. G. Mei, A New Method for Solving the Algebraic Riccati Equation, Master's Thesis, Nanjing Aeronautical Inst., Campus P.O. Box 245, Nanjing, P.R. China, 1986.
39. J. Olson, H. Jensen, and P. Jørgensen, Solution of large matrix equations which occur in response theory, J. Comput. Phys. 74:265-282 (1988).
40. C. Paige, The Computation of Eigenvalues and Eigenvectors of Very Large Sparse Matrices, Ph.D. Thesis, Univ. of London (U.K.), 1971.
41. B. N. Parlett, D. R. Taylor, and Z. A. Liu, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp. 44:105-124 (1985).
42. I. Rosen and C. Wang, A multi-level technique for the approximate solution of operator Lyapunov and algebraic Riccati equations, SIAM J. Numer. Anal. 32:514-541 (1995).
43. V. Sima, Algorithm GRICSR solving continuous-time algebraic Riccati equations using Gaussian symplectic transformations, Stud. Res. Comp. Inf. 1:237-254 (1992).
44. D. C. Sorensen, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl. 13:357-385 (1992).
45. D. R. Taylor, Analysis of the Look-ahead Lanczos Algorithm, Ph.D. Thesis, Center for Pure and Applied Mathematics, Univ. of California, Berkeley, 1982.
46. C. Van Loan, A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix, Linear Algebra Appl. 16:233-251 (1984).