Computing generalized inverse of polynomial matrices by interpolation

We investigated an interpolation algorithm for computing the Moore–Penrose inverse of a given polynomial matrix, based on the Leverrier–Faddeev method. Also, a method for estimating the degrees of polynomial matrices arising from the Leverrier–Faddeev algorithm is given as the improvement of the interpolation algorithm. Algorithms are implemented in the symbolic programming language MATHEMATICA, and tested on several different classes of test examples.