An isospectral transformation between Hessenberg matrix and Hessenberg-bidiagonal matrix pencil without using subtraction

12/22/2022

∙

by   Katsuki Kobayashi, et al.

∙

0

∙

share

We introduce an eigenvalue-preserving transformation algorithm from the generalized eigenvalue problem by matrix pencil of the upper and the lower bidiagonal matrices into a standard eigenvalue problem while preserving sparsity, using the theory of orthogonal polynomials. The procedure is formulated without subtraction, which causes numerical instability. Furthermore, the algorithm is discussed for the extended case where the upper bidiagonal matrix is of Hessenberg type.