Advanced
HIGHER ORDER ITERATIONS FOR MOORE-PENROSE INVERSES
HIGHER ORDER ITERATIONS FOR MOORE-PENROSE INVERSES
Journal of applied mathematics & informatics. 2014. Jan, 32(1_2): 171-184
  • Received : March 10, 2013
  • Published : January 30, 2014
Download
PDF
e-PUB
PubReader
PPT
Export by style
Article
Author
Metrics
Cited by
TagCloud
About the Authors
Srivastava Shwetabh
Gupta D.K.

Abstract
A higher order iterative method to compute the Moore-Penrose inverses of arbitrary matrices using only the Penrose equation (ii) is developed by extending the iterative method described in [1]. Convergence properties as well as the error estimates of the method are studied. The efficacy of the method is demonstrated by working out four numerical examples, two involving a full rank matrix and an ill-conditioned Hilbert matrix, whereas, the other two involving randomly generated full rank and rank deficient matrices. The performance measures are the number of iterations and CPU time in seconds used by the method. It is observed that the number of iterations always decreases as expected and the CPU time first decreases gradually and then increases with the increase of the order of the method for all examples considered.
Keywords
References