4.7 Article

A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination

期刊

APPLIED MATHEMATICS AND COMPUTATION
卷 245, 期 -, 页码 271-278

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2014.07.082

关键词

Moore-Penrose inverse; Gauss-Jordan elimination; Computational complexity

向作者/读者索取更多资源

Performing elementary row operations on [A vertical bar 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 At of a general matrix A(dagger) 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. (C) 2014 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据