Translator Disclaimer
2014 Execute Elementary Row and Column Operations on the Partitioned Matrix to Compute M-P Inverse A
Xingping Sheng
Abstr. Appl. Anal. 2014: 1-6 (2014). DOI: 10.1155/2014/596049

Abstract

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 A of a singular or rectangular matrix A. 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.

Citation

Download Citation

Xingping Sheng. "Execute Elementary Row and Column Operations on the Partitioned Matrix to Compute M-P Inverse A." Abstr. Appl. Anal. 2014 1 - 6, 2014. https://doi.org/10.1155/2014/596049

Information

Published: 2014
First available in Project Euclid: 2 October 2014

zbMATH: 07022680
MathSciNet: MR3182292
Digital Object Identifier: 10.1155/2014/596049

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
6 PAGES


SHARE
Vol.2014 • 2014
Back to Top