Computation and Uses of the Semidiscrete Matrix Decomposition
Tamara G. Kolda, Dianne Prost O’Leary · 1999
We derive algorithms for computing a semidiscrete approximation to a matrix in the Frobenius and weighted norms. The approximation is formed as a weighted sum of outer products of vectors whose elements are +/=1 or 0, so the storage required by the approximation is quite small.