Affordable Access

Access to the full text

An efficient method to compute the Moore–Penrose inverse

Authors
  • Esmaeili, Hamid
  • Erfanifar, Raziyeh
  • Rashidi, Mahdis
Type
Published Article
Journal
Advances in Pure and Applied Mathematics
Publisher
De Gruyter
Publication Date
Sep 27, 2017
Volume
9
Issue
2
Pages
143–152
Identifiers
DOI: 10.1515/apam-2016-0064
Source
De Gruyter
Keywords
License
Yellow

Abstract

A new Schulz-type method to compute the Moore–Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method always converge with fourth-order. A wide set of numerical comparisons of the proposed method with nine higher order methods shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods. For each of sizes n × n {n\times n} and n × ( n + 10 ) {n\times(n+10)} , n = 200 , 400 , 600 , 800 , 1000 , 1200 {n=200,400,600,800,1000,1200} , ten random matrices were chosen to make these comparisons.

Report this publication

Statistics

Seen <100 times