PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.)
Vol. 62 (76), pp. 26--40 (1997)
On Moore-Penrose inverse of block matrices and full-rank factorization
G. V. Milovanovi\'c and P. S. Stanimirovi\'cElektronski fakultet, Nis, Yugoslavia
Abstract: We develop a few methods for computing the Moore-Penrose inverse, based on full-rank factorizations which arise from different block decompositions of rectangular matrices. In this way, the paper is a continuation of the previous works given by Noble  and Tewarson . We compare the obtained results with the known block representations of the Moore-Penrose inverse. Moreover, efficient block representations of the weighted Moore-Penrose inverse are introduced using the same principles.
Classification (MSC2000): 15A09; 15A24
Full text of the article:
Electronic fulltext finalized on: 1 Nov 2001. This page was last modified: 16 Nov 2001.
© 2001 Mathematical Institute of the Serbian Academy of Science and Arts