摘要
This paper presents an explicit representation for M-P inverse A(& DAG);. Based on this, we can use Gauss-Jordan elimination to compute it, and get the upper bound of the total number of arithmetic operations about 21/4n(3). Finally, a numerical example is demonstrated.