Factorizations of hyperpower family of iterative methods via least squares approach

Abstract

A new method for finding proper factorizations of the hyperpower family of iterative methods for computing generalized inverses is proposed. The method is based on numerical optimization of an appropriate least squares problem. An iterative method in a non-normalized form for finding the generalized outer inverses with prescribed range and null space of any given complex matrix is proposed and considered. Computational complexity and convergence of the method are studied. Several numerical experiments are also presented.