Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.amc.2014.07.082 | Applied Mathematics and Computation |
Keywords | Field | DocType |
computational complexity,gauss-jordan elimination,moore-penrose inverse,gauss jordan elimination,moore penrose inverse | Inverse,Mathematical optimization,Elementary matrix,Mathematical analysis,Matrix (mathematics),Row equivalence,Moore–Penrose pseudoinverse,Pure mathematics,Augmented matrix,Invertible matrix,Gaussian elimination,Mathematics | Journal |
Volume | Issue | ISSN |
245 | C | 0096-3003 |
Citations | PageRank | References |
6 | 0.51 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jun Ji | 1 | 41 | 6.82 |
| Xuzhou Chen | 2 | 18 | 3.55 |