A finite algorithm for generalized inverses of polynomial and rational matrices

摘要

There are proposed two types of finite algorithms for symbolic computation of outer inverses of a given polynomial or rational matrix, based on the extension of the Leverrier–Faddeev algorithm. The implementation of the algorithm corresponding to rational matrices is developed in the symbolic package MATHEMATICA.