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

  • Authors:
  • Peter Benner;Ralph Byers;Eric Barth

  • Affiliations:
  • Univ. Bremen, Bremen, Germany;Univ. of Kansas, Lawrence;Kalamazoo College, Kalamazoo, MI

  • Venue:
  • ACM Transactions on Mathematical Software (TOMS)
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 2n 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.