Generalized Schultz iterative methods for the computation of outer inverses
We consider a general matrix iterative method of the type Xk+1=Xkp(AXk) X k + 1 = X k p ( A X k ) for computing an outer inverse A R ( G ) , N ( G ) ( 2 ) , for given matrices A?Cmn A ? C m  n and G?Cnm G ? C n  m such that AR(G)?N(G)=Cm A R ( G ) ? N ( G ) = C m . Here p(x) p ( x ) is an arbitrary polynomial of degree d d . The convergence of the method is proven under certain necessary conditions and the characterization of all methods having order r r is given. The obtained results provide a direct generalization of all known iterative methods of the same type. Moreover, we introduce one new method and show a procedure how to improve the convergence order of existing methods. This procedure is demonstrated on one concrete method and the improvement is confirmed by numerical examples.
iterative methods outer inverse convergence moorepenrose inverse drazin inverse schultz method