Symbolic computation of the Moore–Penrose inverse using a partitioning method

Abstract

We propose an extension of the Greville’s partitioning method for computing the Moore–Penrose inverse of two-variable rational and polynomial complex matrices. In addition, we developed corresponding effective algorithm, applicable in the case when there are only few degrees in A(s ₁, s ₂) corresponding to non-zero coefficient matrices. These algorithms are implemented using symbolic and functional possibilities of the package ^MATHEMATICA.

Keywords:

• Pseudoinverse
• MATHEMATICA
• Partitioning method
• Rational and polynomial matrices