A class of numerical algorithms for computing outer inverses

The aim of this study is to present a class of numerical algorithms for finding outer inverses with prescribed range and null space. General convergence theorems are proven. Some particular cases of the general algorithm are introduced and demonstrated. Theoretical convergence speed and computational efficiency will further be supported by employing some numerical tests.