Algorithm 800: Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices I: The square-reduced method

Citation
P. Benner et al., Algorithm 800: Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices I: The square-reduced method, ACM T MATH, 26(1), 2000, pp. 49-77
Citations number
41
Categorie Soggetti
Computer Science & Engineering
Journal title
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
ISSN journal
00983500 → ACNP
Volume
26
Issue
1
Year of publication
2000
Pages
49 - 77
Database
ISI
SICI code
0098-3500(200003)26:1<49:A8F7SF>2.0.ZU;2-#
Abstract
This article describes LAPACK-based Fortran 77 subroutines for the reductio n of a Hamiltonian matrix to square-reduced form and the approximation of a ll its eigenvalues using the implicit version of Van Loan's method. The tra nsformation of the Hamiltonian matrix to a square-reduced form transforms a Hamiltonian eigenvalue problem of order 2n to a Hessenberg eigenvalue prob lem of order Iz,The eigenvalues of the Hamiltonian matrix are the square ro ots of those of the Hessenberg matrix. Symplectic scaling and norm scaling are provided, which, in some cases, improve the accuracy of the computed ei genvalues. We demonstrate the performance of the subroutines for several ex amples and show how they can be used to solve some control-theoretic proble ms.