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

This item is provided by the institution :
/aggregator-openarchives/portal/institutions/uoa   

Repository :
Pergamos Digital Library   

see the original item page
in the repository's web site and access all digital files if the item*



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

Stanimirović, P.S. Katsikis, V.N. Pappas, D.

scientific_publication_article
Επιστημονική δημοσίευση - Άρθρο Περιοδικού (EL)
Scientific publication - Journal Article (EN)

2016


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. © 2015 Elsevier Inc. All rights reserved. (EN)

English

Ερευνητικό υλικό ΕΚΠΑ

https://creativecommons.org/licenses/by-nc/4.0/




*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)