Computation and Uses of the Semidiscrete Matrix Decomposition
| dc.contributor.author | Kolda, Tamara G. | en_US |
| dc.contributor.author | O'Leary, Dianne P. | en_US |
| dc.date.accessioned | 2004-05-31T22:56:53Z | |
| dc.date.available | 2004-05-31T22:56:53Z | |
| dc.date.created | 1999-04 | en_US |
| dc.date.issued | 1999-04-06 | en_US |
| dc.description.abstract | 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 plus or minus $1$ or $0$, so the storage required by the approximation is quite small. We also present a related algorithm for approximation of a tensor. Applications of the algorithms are presented to data compression, filtering, and information retrieval; and software is provided in C and in Matlab. (Also cross-referenced as UMIACS-TR-99-22) | en_US |
| dc.format.extent | 322500 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/1004 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-4012 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-99-22 | en_US |
| dc.title | Computation and Uses of the Semidiscrete Matrix Decomposition | en_US |
| dc.type | Technical Report | en_US |