Speaker
Description
In the context of computations of eignevalues and eignevectors, structure-preserving of a class of specific structured matrices, the reduction of a matrix to a $J$-Hessenberg condensed form is needed.\
Such reduction is based on symplectic similarity transformations.
It is a crucial step in the $SR$-algorithm (which is a $QR$-like algorithm), structure-preserving, for computing eigenvalues and vectors of such structured matrices.
The algorithm JHESS, or its variant JHMSH are the main algorithms used for such reduction.
These algorithms may meet fatal breakdowns, causing brutal stops of the computations or encounter near-breakdowns, which are source of serious numerical instability.
In this talk, we point out the source of these breakdowns and present strategies
for curing them.