Symplectic Balancing of Hamiltonian Matrices
Author:
- 1 January 2001
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 22 (5) , 1885-1904
Abstract
We discuss the balancing of Hamiltonian matrices by structure preserving similarity transformations. The method is closely related to balancing nonsymmetric matrices for eigenvalue computations as proposed by Osborne [J. ACM, 7 (1960), pp. 338--345]and Parlett and Reinsch [Numer. Math., 13 (1969), pp. 296--304] and implemented in most linear algebra software packages. It is shown that isolated eigenvalues can be deflated using similarity transformations with symplectic permutation matrices. Balancing is then based on equilibrating row and column norms of the Hamiltonian matrix using symplectic scaling matrices. Due to the given structure, it is sufficient to deal with the leading half rows and columns of the matrix. Numerical examples show that the method improves eigenvalue calculations of Hamiltonian matrices as well as numerical methods for solving continuous-time algebraic Riccati equations.Keywords
This publication has 19 references indexed in Scilit:
- A numerically stable, structure preserving method for computing the eigenvalues of real Hamiltonian or symplectic pencilsNumerische Mathematik, 1998
- An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problemLinear Algebra and its Applications, 1997
- On Hamiltonian and symplectic Hessenberg formsLinear Algebra and its Applications, 1991
- A fast algorithm to compute the of a transfer function matrixSystems & Control Letters, 1990
- A bisection method for computing the H∞ norm of a transfer matrix and related problemsMathematics of Control, Signals, and Systems, 1989
- A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable MatricesSIAM Journal on Scientific and Statistical Computing, 1988
- The weak and strong stability of algorithms in numerical linear algebraLinear Algebra and its Applications, 1987
- Matrix factorizations for symplectic QR-like methodsLinear Algebra and its Applications, 1986
- A Hamiltonian $QR$ AlgorithmSIAM Journal on Scientific and Statistical Computing, 1986
- Matrix balancingThe Computer Journal, 1971