Abstract
Motivated by the problems of computing sample covariance matrices, and of transforming a collection of vectors to a basis where they are sparse, we present a simple algorithm that computes an approximation of the product of two n-by-n real matrices A and B.
| Original language | English |
|---|---|
| Article number | 9 |
| Journal | ACM Transactions on Computation Theory |
| Volume | 5 |
| Issue number | 3 |
| ISSN | 1942-3454 |
| Publication status | Published - Aug 2013 |
Keywords
- algorithm
- matrix
- matrix-multiplication