Approximating the Inverse of a Square Matrix with Application in Computation of the Moore-Penrose Inverse

Abstract

This paper presents a computational iterative method to find approximate inverses for the inverse of matrices. Analysis of convergence reveals that the method reaches ninth-order convergence. The extension of the proposed iterative method for computing Moore-Penrose inverse is furnished. Numerical results including the comparisons with different existing methods of the same type in the literature will also be presented to manifest the superiority of the new algorithm in finding approximate inverses. +1 to keep the approximated inverse sparse. Such a strategy is useful for preconditioning.

Multipoint Iterative Methods for Finding All the Simple Zeros in an Interval

“…We note that keeping tighter conditions will produce fractals with much more quality and reliability. For further application, refer to [4,23,24].…”

A New Family of Second-Order Iterative Methods for Computing the Moore Penrose Inverse Based on Penrose Equations

“…In addition, various iterative methods have been developed based on the matrix equation f (X) = X −1 − A = 0, see e.g. [4,11].…”

New Mono- and Biaccelerator Iterative Methods with Memory for Nonlinear Equations

“…Considering these fundamental methods, many iterative methods without memory possessing optimal convergence order based on the hypothesis of Kung and Traub [5] have been constructed in the literature; see, for example, [6,7] and the references therein. For application, refer to [8,9].…”