R. M. Corless
D. J. Jeffrey
Abstract
The Turing factorization is a generalization of the standard LU factoring of a square matrix. Among other advantages, it allows us to meet demands that arise in a symbolic context. For a rectangular matrix A, the generalized factors are written PA = LDU R, where R is the row-echelon form of A. For matrices with symbolic entries, the LDU R factoring is superior to the standard reduction to row-echelon form, because special case information can be recorded in a natural way. Special interest attaches to the continuity properties of the factors, and it is shown that conditions for discontinuous behaviour can be given using the factor D. We show that this is important, for example, in computing the Moore-Penrose inverse of a matrix containing symbolic entries.We also give a separate generalization of LU factoring to fraction-free Gaussian elimination.
Index Terms
- The Turing factorization of a rectangular matrix
Recommendations
Symmetric nonnegative matrix factorization: A systematic review
AbstractIn recent years, symmetric non-negative matrix factorization (SNMF), a variant of non-negative matrix factorization (NMF), has emerged as a promising tool for data analysis. This paper mainly focuses on the theoretical idea, the basic ...
Highlights- This paper reviews symmetric non-negative matrix factorization (SNMF).
- We ...
Heuristics for exact nonnegative matrix factorization
The exact nonnegative matrix factorization (exact NMF) problem is the following: given an m-by-n nonnegative matrix X and a factorization rank r, find, if possible, an m-by-r nonnegative matrix W and an r-by-n nonnegative matrix H such that $$X = WH$$X=...
Quadratic nonnegative matrix factorization
In Nonnegative Matrix Factorization (NMF), a nonnegative matrix is approximated by a product of lower-rank factorizing matrices. Most NMF methods assume that each factorizing matrix appears only once in the approximation, thus the approximation is ...
Comments