## Numerical Computation of Deflating Subspaces of Skew-Hamiltonian/Hamiltonian Pencils (2002)

Venue: | SIAM J. Matrix Anal. Appl |

Citations: | 42 - 25 self |

### BibTeX

@ARTICLE{Benner02numericalcomputation,

author = {Peter Benner and Ralph Byers and Volker Mehrmann and Hongguo Xu},

title = {Numerical Computation of Deflating Subspaces of Skew-Hamiltonian/Hamiltonian Pencils},

journal = {SIAM J. Matrix Anal. Appl},

year = {2002},

volume = {24},

pages = {2002}

}

### Years of Citing Articles

### OpenURL

### Abstract

. We discuss the numerical solution of structured generalized eigenvalue problems that arise from linear-quadratic optimal control problems, H1 optimization, multibody systems, and many other areas of applied mathematics, physics, and chemistry. The classical approach for these problems requires computing invariant and deating subspaces of matrices and matrix pencils with Hamiltonian and/or skew-Hamiltonian structure. We extend the recently developed methods for Hamiltonian matrices to the general case of skew-Hamiltonian/Hamiltonian pencils. The algorithms circumvent problems with skew-Hamiltonian/Hamiltonian matrix pencils that lack structured Schur forms by embedding them into matrix pencils that always admit a structured Schur form. The rounding error analysis of the resulting algorithms is favorable. For the embedded matrix pencils, the algorithms use structure preserving unitary matrix computations and are strongly backwards stable, i.e., they compute the exact structured Schur form of a nearby matrix pencil with the same structure. Keywords. eigenvalue problem, deating subspace, Hamiltonian matrix, skew-Hamiltonian matrix, skew-Hamiltonian/Hamiltonian matrix pencil. AMS subject classication. 49N10, 65F15, 93B40, 93B36. 1.