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

Title:
Algorithm 800: Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices. I: the square-reduced method
Source:
ACM Transactions on Mathematical Software. 26:49-77
Publisher Information:
Association for Computing Machinery (ACM), 2000.
Publication Year:
2000
Document Type:
Academic journal Article
File Description:
application/xml
Language:
English
ISSN:
1557-7295
0098-3500
DOI:
10.1145/347837.347852
Accession Number:
edsair.doi.dedup.....9f7433a68c57be93cf6bc6d10e93579f
Database:
OpenAIRE

Further Information

This article describes LAPACK-based Fortran 77 subroutines for the reduction of a Hamiltonian matrix to square-reduced form and the approximation of all its eigenvalues using the implicit version of Van Loan's method. The transformation of the Hamiltonian matrix to a square-reduced form transforms a Hamiltonian eigenvalue problem of order 2 n to a Hessenberg eigenvalue problem of order n . The eigenvalues of the Hamiltonian matrix are the square roots of those of the Hessenberg matrix. Symplectic scaling and norm scaling are provided, which, in some cases, improve the accuracy of the computed eigenvalues. We demonstrate the performance of the subroutines for several examples and show how they can be used to solve some control-theoretic problems.