Inverses of Multivariable Polynomial Matrices by Discrete Fourier Transforms

The problem of the fast computation of the Moore–Penrose and Drazin inverse of a multi-variable polynomial matrix is addressed. The algorithms proposed, use evaluation-interpolation techniques and the Fast Fourier transform. They proved to be faster than other known algorithms. The efficiency of the algorithms is illustrated via randomly generated examples.