Computing {2,4} and {2,3}-inverses by using the Sherman–Morrison formula

Predrag S. Stanimirović, Vasilios N. Katsikis and Dimitrios Pappas

Applied Mathematics and Computation, 2016, vol. 273, issue C, 584-603

Abstract: A finite recursive procedure for computing {2,4} generalized inverses and the analogous recursive procedure for computing {2,3} generalized inverses of a given complex matrix are presented. The starting points of both introduced methods are general representations of these classes of generalized inverses. These representations are formed using certain matrix products which include the Moore–Penrose inverse or the usual inverse of a symmetric matrix product and the Sherman–Morrison formula for the inverse of a symmetric rank-one matrix modification. The computational complexity of the methods is analyzed. Defined algorithms are tested on randomly generated matrices as well as on test matrices from the Matrix Computation Toolbox.

Keywords: Moore–Penrose inverse; {2,3}-inverses; {2,4}-inverses; Sherman–Morrison formula; Rank-one update (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031501365X
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:273:y:2016:i:c:p:584-603

DOI: 10.1016/j.amc.2015.10.023

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 ().