A new method for computing Moore–Penrose inverse through Gauss–Jordan elimination
作者:
Highlights:
•
摘要
Performing elementary row operations on [A|I], we can calculate matrices whose columns form bases for N(A) and N(A∗) easily. These matrices are then used to construct a bordered matrix through which the Moore–Penrose inverse A† of a general matrix A can be obtained through further elementary row operations. Our method is reduced to the classical Gauss–Jordan elimination procedure for the regular inverse when applied to a nonsingular matrix. An example is included to illustrate the new method.
论文关键词:Moore–Penrose inverse,Gauss–Jordan elimination,Computational complexity
论文评审过程:Available online 17 August 2014.
论文官网地址:https://doi.org/10.1016/j.amc.2014.07.082