A new extension of Leverrier's algorithm
A recursion derived by \textit{S.Barnett} [SIAM J. Matrix Anal. Appl. 10, No. 4, 551-556 (1989; Zbl 0682.65022)], for computing the inverse of a matrix polynomial by means of a Leverrier type recursion, is extended to the case of a singular leading term.
scientific article; zbMATH DE number 179141