Finite splitting algorithm for the j-symmetric generalized eigenvalue problem

Abstract

The properties of matrix pencils associated with the numerical solution of matrix Riccati equations are considered. In particular, a new notion is defined — J-symmetric matrix pencils — and a finite orthogonal and symplectic algorithm is proposed for such pencils, halving the order of the generalized eigenvalue problem.