Approximating the inverse of a square matrix with application in computation of the Moore-Penrose inverse

DOI10.1155/2014/731562MaRDI QIDQ1714732zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Fazlollah Soleymani, S. Shateyi, Mahdi Sharifi

Publication date 1 February 2019

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2014/731562

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Iterative numerical methods for linear systems (65F10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Review text

Summary: 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.

Recommendations

• An iterative method for computing the approximate inverse of a square matrix and the Moore-Penrose inverse of a non-square matrix
• Approximating the inverse and the Moore-Penrose inverse of complex matrices
• An improved method for the computation of the Moore-Penrose inverse matrix
• A computing method for the Moore-Penrose inverse of some special matrices
• A new method for computing Moore-Penrose inverse matrices
• An efficient matrix iterative method for computing Moore-Penrose inverse
• A Note On Another Method Of Computing The Moore-Penrose Inverse Of A Matrix
• A family of iterative methods for computing Moore-Penrose inverse of a matrix
• scientific article; zbMATH DE number 1210785

Cited in

(17)

• Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
• A new iterative method for finding approximate inverses of complex matrices
• New mono- and biaccelerator iterative methods with memory for nonlinear equations
• A family of iterative methods for computing Moore-Penrose inverse of a matrix
• An efficient matrix iterative method for computing Moore-Penrose inverse
• Multipoint iterative methods for finding all the simple zeros in an interval
• An iterative method for computing the approximate inverse of a square matrix and the Moore-Penrose inverse of a non-square matrix
• An approach to the approximation of the inverse of a square matrix by He's homotopy perturbation method
• scientific article; zbMATH DE number 6342037 (Why is no real title available?)
• scientific article; zbMATH DE number 5072492 (Why is no real title available?)
• Finding generalized inverses by a fast and efficient numerical method
• An efficient quadratically convergent iterative method to find the Moore-Penrose inverse
• Approximating the inverse and the Moore-Penrose inverse of complex matrices
• The CEPGD-inverse for square matrices
• GIBS: a general and efficient iterative method for computing the approximate inverse and Moore–Penrose inverse of sparse matrices based on the Schultz iterative method with applications
• Low-complexity inverse square root approximation for baseband matrix operations
• A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix

This page was built for publication: Approximating the inverse of a square matrix with application in computation of the Moore-Penrose inverse

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1714732)