Classical orthogonal polynomials and Leverrier-Faddeev algorithm for the matrix pencils \(sE - A\) (Q885645)

The authors describe an extension of the classical Leverrier-Faddeev algorithm using families of orthogonal polynomials following the ideas of the previous paper [\textit{J. Hernández, F. Marcellán}, and \textit{C. Rodríguez}, ''Leverrier-Faddeev algorithm and classical orthogonal polynomials,'' Rev. Acad. Colomb. Cienc. Exactas, Fis. Nat. 28, No.106, 39-47 (2004; Zbl 1105.65039)] by themselves. It generalizes the contribution [\textit{G. Wang, L. Qiu}, ''Leverrier-Chebyshev algorithm for the singular pencils,'' Linear Algebra Appl. 345, No.1-3, 1-8 (2002; Zbl 0994.65051)] of Wang and Qiu based on the Chebyshev polynomials. The algorithm gives the adjoint matrix \(B(s)\) of a pencil \(sE-A\), where \(E\) is a singular matrix as well as the determinant of the regular pencil. Finally, a numerical example is presented.