A note of computation for M-P inverse A^†

Abstract

This paper presents an explicit representation for M-P inverse A ^†. 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 ³. Finally, a numerical example is demonstrated.

Keywords:

• Gauss–Jordan elimination
• M-P inverse
• elementary operation
• arithmetic operations

2000 AMS Subject Classification :

• 15A09

Acknowledgements

This project was supported by NSF China (no.10826056), the Shanghai Natural Science Foundation (09ZR1408700), and The University Natural Science Research key Project of Anhui Province (KJ2010A224).