Fast computing of the Moore-Penrose inverse matrix

38Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.

Abstract

In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m X n matrices and of square matrices with at least one zero row or column. Sufficient conditions are also given for special type products of square matrices so that the reverse order law for the Moore-Penrose inverse is satisfied.

Cite

CITATION STYLE

APA

Katsikis, V. N., & Pappas, D. (2008). Fast computing of the Moore-Penrose inverse matrix. Electronic Journal of Linear Algebra, 17, 637–650. https://doi.org/10.13001/1081-3810.1287

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free