Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- 1 January 2006
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 36 (1), 184-206
- https://doi.org/10.1137/s0097539704442702
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a MatrixSIAM Journal on Computing, 2006
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix MultiplicationSIAM Journal on Computing, 2006
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrixNumerische Mathematik, 1999
- Approximating Matrix Multiplication for Pattern Recognition TasksJournal of Algorithms, 1999
- A theory of pseudoskeleton approximationsLinear Algebra and its Applications, 1997
- Matrix AnalysisPublished by Springer Science and Business Media LLC ,1997
- Matrix AnalysisPublished by Cambridge University Press (CUP) ,1985