期刊名称：American Journal of Computational Mathematics
印刷版ISSN：2161-1203
电子版ISSN：2161-1211
出版年度：2011
卷号：1
期号：3
页码：147-151
DOI：10.4236/ajcm.2011.13016
出版社：Scientific Research Publishing
摘要：This paper presents a recursive procedure to compute the Moore-Penrose inverse of a matrix A. The method is based on the expression for the Moore-Penrose inverse of rank-one modified matrix. The computational complexity of the method is analyzed and a numerical example is included. A variant of the algorithm with lower computational complexity is also proposed. Both algorithms are tested on randomly generated matrices. Numerical performance confirms our theoretic results.
