Algorithm 961: Fortran 77 Subroutines for the Solution of Skew-Hamiltonian/Hamiltonian Eigenproblems


Skew-Hamiltonian/Hamiltonian matrix pencils λ S &mins; H appear in many applications, including linear-quadratic optimal control problems, H&infty;-optimization, certain multibody systems, and many other areas in applied mathematics, physics, and chemistry. In these applications it is necessary to compute certain eigenvalues and/or corresponding deflating subspaces of these matrix pencils. Recently developed methods exploit and preserve the skew-Hamiltonian/Hamiltonian structure and hence increase the reliability, accuracy, and performance of the computations. In this article, we describe the corresponding algorithms which have been implemented in the style of subroutines of the Subroutine Library in Control Theory (SLICOT). Furthermore, we address some of their applications. We describe variants for real and complex problems, as well as implementation details and perform numerical tests using real-world examples to demonstrate the superiority of the new algorithms compared to standard methods.

DOI: 10.1145/2818313

Extracted Key Phrases

13 Figures and Tables

Cite this paper

@article{Benner2016Algorithm9F, title={Algorithm 961: Fortran 77 Subroutines for the Solution of Skew-Hamiltonian/Hamiltonian Eigenproblems}, author={Peter Benner and Vasile Sima and Matthias Voigt}, journal={ACM Trans. Math. Softw.}, year={2016}, volume={42}, pages={24:1-24:26} }