Extensions of Faddeev's algorithms to polynomial matrices (Q2391309)

The authors derive two new algorithms: one for computing the Drazin inverse of a singular \(n \times n\) one-variable polynomial matrix, the other for computing the Moore-Penrose inverse of a singular \(n \times m\) one-variable polynomial matrix. These two algorithms are alternatives to known algorithms for computing the Drazin inverse and the Moore-Penrose inverse based on the Leverrier-Faddeev method; this approach uses derivative of the matrix powers and was initiated by the third author [An extension of the Faddeev's algorithms, in: Proceedings of the IEEE Multi-conference on Systems and Control on September 3--5th, 2008, San Antonio, TX. (2008)]. The authors compare the computational complexity and the memory space requirements of the two new introduced algorithms versus some known alternative algorithms using \texttt{MATHEMATICA 5.2}; illustrative test examples are presented. The \texttt{MATHEMATICA} code for the two new algorithms is presented in Appendix.