On the inverse's computation of a real, upper Hessenberg matrix
The computation of the inverse of an upper Hessenberg matrix, which is regular and irreducible, is investigated. Two methods, the QR factorization and a generalization of \textit{Y. Ikebe's} method [Linear Algebra Appl. 24, 93-97 (1979; Zbl 0397.15005)], are proposed. The methods are described in detail including the comparison of the costs of calculations. Two numerical tests show advantages for the generalized Ikebe method.
scientific article; zbMATH DE number 580044