Name
Abstract | ||
|---|---|---|
The definition of the LU factoring of a matrix usually requires that the matrix be invertible. Current software systems have extended the definition to non-square and rank-deficient matrices, but each has chosen a different extension. Two new extensions, both of which could serve as useful standards, are proposed here: the first combines LU factoring with full-rank factoring, and the second extension combines full-rank factoring with fraction-free methods. Amongst other applications, the extension to full-rank, fraction-free factoring is the basis for a fractionfree computation of the Moore-Penrose inverse. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1838599.1838602 | ACM Comm. Computer Algebra |
Keywords | Field | DocType |
moore-penrose inverse,rank-deficient matrix,fraction-free method,new extension,different extension,full-rank factoring,combines lu factoring,fraction-free factoring,non-invertible matrix,current software system,lu factoring,software systems,moore penrose inverse,lu factorization | Discrete mathematics,Inverse,Algebra,Matrix (mathematics),Software system,Incomplete LU factorization,Invertible matrix,Mathematics,Factoring,Computation | Journal |
Volume | Issue | Citations |
44 | 1/2 | 5 |
PageRank | References | Authors |
0.70 | 5 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David J. Jeffrey | 1 | 1172 | 132.12 |