Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2014, Article ID 596049, 6 pages
Research Article

Execute Elementary Row and Column Operations on the Partitioned Matrix to Compute M-P Inverse

School of Mathematics and Computational Science, Fuyang Normal College, Fuyang, Anhui, China

Received 3 November 2013; Revised 23 January 2014; Accepted 23 January 2014; Published 10 March 2014

Academic Editor: Sergei V. Pereverzyev

Copyright © 2014 Xingping Sheng. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We first study the complexity of the algorithm presented in Guo and Huang (2010). After that, a new explicit formula for computational of the Moore-Penrose inverse of a singular or rectangular matrix . This new approach is based on a modified Gauss-Jordan elimination process. The complexity of the new method is analyzed and presented and is found to be less computationally demanding than the one presented in Guo and Huang (2010). In the end, an illustrative example is demonstrated to explain the corresponding improvements of the algorithm.