Title: Core-chasing symplectic QR algorithms and numerical stability
Abstract: A presentation form of symplectic Hessenberg matrices is given. Based on which three versions of the core-chasing symplectic QR algorithm are proposed. The algorithms use unitary symplectic similarity transformations only and preserve the symplectic structure. On the other hand, the proposed algorithms may not be numerically stable because of the symplectic structure.