DFT calculation for the \(\{2\}\)-inverse of a polynomial matrix with prescribed image and kernel (Q1044447): Difference between revisions

A finite algorithm for a calculation of the generalized inverse of a polynomial matrix \(A(x)\) is presented and studied. For the purpose of the study, necessary and sufficient conditions for existence of a generalized inverse matrix of a constant matrix \(A\), over an integral domain, are given in the beginning. A finite algorithm is deduced for it and, based on the Fourier transform, an algorithm for calculating the generalized inverse of a polynomial matrix \(A(x)\) is presented. It can be used to compute the Moore-Penrose inverse, the group inverse, and the Drazin inverse of a polynomial matrix. The algorithm is implemented in the Mathematica programming language (The Matematica code is given as Appendix). Four examples are provided to illustrate the implementation of the presented algorithm. Some comparison tests using random matrices are performed to confirm its efficiency.