A Cubic Class of Iterative Procedures for Finding the Generalized Inverses

This article considers the iterative approach for finding the Moore–Penrose inverse of a matrix. A convergence analysis is presented under certain conditions, demonstrating that the scheme attains third-order convergence. Moreover, theoretical discussions suggest that selecting a particular parameter could further improve the convergence order. The proposed scheme defines the special cases of third-order methods for β=0,1/2, and 1/4. Various large sparse, ill-conditioned, and rectangular matrices obtained from real-life problems were included from the Matrix-Market Library to test the presented scheme. The scheme’s performance was measured on randomly generated complex and real matrices, to verify the theoretical results and demonstrate its superiority over the existing methods. Furthermore, a large number of distinct approaches derived using the proposed family were tested numerically, to determine the optimal parametric value, leading to a successful conclusion.