Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- 1 January 2006
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 36 (1), 158-183
- https://doi.org/10.1137/s0097539704442696
Abstract
No abstract availableKeywords
This publication has 12 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 I: Approximating Matrix MultiplicationSIAM Journal on Computing, 2006
- Fast monte-carlo algorithms for finding low-rank approximationsJournal of the ACM, 2004
- Singular value decomposition for genome-wide expression data processing and modelingProceedings of the National Academy of Sciences of the United States of America, 2000
- Matrices, Vector Spaces, and Information RetrievalSIAM Review, 1999
- Matrix AnalysisPublished by Springer Science and Business Media LLC ,1997
- Using Linear Algebra for Intelligent Information RetrievalSIAM Review, 1995
- Visual learning and recognition of 3-d objects from appearanceInternational Journal of Computer Vision, 1995
- Indexing by latent semantic analysisJournal of the American Society for Information Science, 1990
- Matrix AnalysisPublished by Cambridge University Press (CUP) ,1985