Gauss–Jordan elimination method for computing all types of generalized inverses related to the {1}-inverse

作者:

Highlights:

摘要

We derive a unified representation for all types of generalized inverses related to the {1}-inverse. Based on this representation, we propose a unified Gauss–Jordan elimination procedure for the computation of all types of generalized inverses related to the {1}-inverse. Complexity analysis indicates that when applied to compute the Moore–Penrose inverse, our method is more efficient than the existing Gauss–Jordan elimination methods in the literature for a large class of problems. Finally, numerical experiments show our method for Moore–Penrose inverse has good efficiency and accuracy, and especially for computing the Moore–Penrose inverse of m×n matrices with m

论文关键词:15A09,65F05,Generalized inverse,Moore–Penrose inverse,Gauss–Jordan elimination,Computational complexity

论文评审过程:Received 18 February 2016, Revised 11 December 2016, Available online 24 February 2017, Version of Record 8 March 2017.

论文官网地址:https://doi.org/10.1016/j.cam.2017.02.010