Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- 1 January 2006
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 36 (1), 132-157
- https://doi.org/10.1137/s0097539704442684
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix DecompositionSIAM Journal on Computing, 2006
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a MatrixSIAM Journal on Computing, 2006
- Approximating Matrix Multiplication for Pattern Recognition TasksJournal of Algorithms, 1999
- Matrix AnalysisGraduate Texts in Mathematics, 1997
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Matrix AnalysisPublished by Cambridge University Press (CUP) ,1985
- Random sampling with a reservoirACM Transactions on Mathematical Software, 1985
- The eigenvalues of random symmetric matricesCombinatorica, 1981
- Gaussian elimination is not optimalNumerische Mathematik, 1969