A Family of Arbitrary High-Order Iterative Methods for Approximating Inverse and the Moore–Penrose Inverse

Abstract

In this work, a family of iterative algorithms for approximating the inverse of a square matrix and the Moore-Penrose inverse of a non-square one is proposed. These methods are based on arbitrary high-order iterative techniques which are used for computing roots of a nonlinear function. Therefore the presented techniques occupy any high-order convergence. The proposed methods are convenient and self-explanatory, achieve satisfactory results, and also require less and easy computations compared to some current schemes. Experimental results are provided to illustrate the reliability and robustness of the techniques.

Keywords

• iterative method
• moore–penrose
• approximate inverse