Finding the MoorePenrose inverse by a new matrix iteration
The aim of this study is to find the MoorePenrose inverse of rectangular matrices numerically. To achieve this, we present a new iteration for matrix inversion in a general framework. The presented method works on both singular and nonsingular matrices or in other words, in cases of square and rectangular matrices. Theoretical details of the study are included to show the behavior of the new scheme analytically. The complexity against the efficiency will also be studied to endorse that, the suggested numerical method is economic.
moorepenrose inverse complexity numerical methods singular matrices sparse matrix dense matrix 15a09 65f30 65f50