An efficient computation of generalized inverse of a matrix

V.Y. Pan, F. Soleymani and L. Zhao

Applied Mathematics and Computation, 2018, vol. 316, issue C, 89-101

Abstract: We propose a hyperpower iteration for numerical computation of the outer generalized inverse of a matrix which achieves 18th order of convergence by using only seven matrix multiplications per iteration loop. This yields a high efficiency index for that computational task. The algorithm has a relatively mild numerical instability, and we stabilize it at the price of adding two extra matrix multiplications per iteration loop. This implies an efficiency index that exceeds the known record for numerically stable iterations for this task, which means substantial acceleration of the long standing algorithms for an important problem of numerical linear algebra. Our numerical tests cover a variety of examples in the category of generalized inverses, such as Drazin case, rectangular case, and preconditioning of linear systems. The test results are in good accordance with our formal study.

Keywords: Generalized inverses; Hyperpower method; Moore–Penrose inverse; Convergence analysis; Drazin inverse (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317305611
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:316:y:2018:i:c:p:89-101

DOI: 10.1016/j.amc.2017.08.010

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().