An Efficient Matrix Iterative Method for Computing Moore–Penrose Inverse

The aim of this article is to develop and analyze the matrix iterative method for computing the Moore–Penrose inverse of a given complex matrix. The theoretical analysis of the presented method is established, which indicates that the method achieves at least ninth order of convergence. The effectiv...

Full description

Saved in:
Bibliographic Details
Published in:Mediterranean journal of mathematics 2021-04, Vol.18 (2), Article 42
Main Authors: Kaur, Manpreet, Kansal, Munish, Kumar, Sanjeev
Format: Article
Language:English
Subjects:
Convergence
Elliptic functions
Iterative methods
Mathematical analysis
Mathematics
Mathematics and Statistics
Partial differential equations
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The aim of this article is to develop and analyze the matrix iterative method for computing the Moore–Penrose inverse of a given complex matrix. The theoretical analysis of the presented method is established, which indicates that the method achieves at least ninth order of convergence. The effectiveness of the developed method is tested via computational efficiency index, and the number of iterations required for convergence. Besides it, numerical reports are provided on a variety of problems arising from different fields of science and engineering. In particular, we study the linear system of equations originated from the statically determinate truss problems, elliptic partial differential equations, and balancing chemical equations. It is demonstrated that the performance of the presented method is significantly better than its existing counterparts.
ISSN:1660-5446
1660-5454
DOI:10.1007/s00009-020-01675-4