期刊
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据