Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication

SIAM Journal on Computing

Volumn 36, Issue 1, 2006, Pages 132-157

  Drineas, Petros ^a   Kannan, Ravi ^b   Mahoney, Michael W ^c  

^a Rensselaer Polytechnic Institute   (United States)

^b Yale University   (United States)

^c YALE UNIVERSITY   (United States)

Author keywords

Massive data sets; Matrix multiplication; Monte Carlo methods; Randomized algorithms; Streaming models

Indexed keywords

MASSIVE DATA SETS; MATRIX MULTIPLICATION; RANDOMIZED ALGORITHMS; STREAMING MODELS;

APPROXIMATION ALGORITHMS; DATA REDUCTION; MONTE CARLO METHODS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RANDOM ACCESS STORAGE;

MATRIX ALGEBRA;

EID: 33751115359     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704442684     Document Type: Article

References (28)

1. D. ACHLIOPTAS AND F. MCSHERRY, Fast computation of low rank matrix approximations, J. ACM, to appear.
2. D. ACHLIOPTAS AND F. MCSHERRY, Fast computation of low rank matrix approximations, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 611-618.
3. N. ALON, Y. MATIAS, AND M. SZEGEDY, The space complexity of approximating the frequency moments, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 20-29.
4. Z. BAR-YOSSEF, Sampling lower bounds via information theory, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 335-344.
5. D. BARBARA, C. FALOUTSOS, J. HELLERSTEIN, Y. IOANNIDIS, H. V. JAGADISH, T. JOHNSON, R. NG, V. POOSALA, K. ROSS, AND K. C. SEVCIK, The New Jersey data reduction report, Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 1997.
6. R. BHATIA, Matrix Analysis, Springer-Verlag, New York, 1997.
7. E. COHEN AND D. D. LEWIS, Approximating matrix multiplication for pattern recognition tasks, J. Algorithms, 30 (1999), pp. 211-252.
8. D. COPPERSMITH AND S. WINOGRAD, Matrix multiplication via arithmetic progressions, J. Symbolic Comput., 9 (1990), pp. 251-280.
9. P. DRINEAS AND R. KANNAN, Fast Monte-Carlo algorithms for approximate matrix multiplication, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 452-459.
10. P. DRINEAS AND R. KANNAN, Pass efficient algorithms for approximating large matrices, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 223-232.
11. P. DRINEAS, R. KANNAN, AND M. W. MAHONEY, Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix, SIAM J. Comput., 36 (2006), pp. 158-183.
12. P. DRINEAS, R. KANNAN, AND M. W. MAHONEY, Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition, SIAM J. Comput., 36 (2006), pp. 184-206.
13. P. DRINEAS, R. KANNAN, AND M. W. MAHONEY, Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication, Tech. Report YALEU/DCS/TR-1269, Department of Computer Science, Yale University, New Haven, CT, 2004.
14. 1difference algorithm for massive data sets, in Proceedings of the 40th Annual IEEE Symposium on the Foundations of Computer Science, 1999, pp. 501-511.
15. A. FRIEZE, R. KANNAN, AND S. VEMPALA, Fast Monte-Carlo algorithms for finding low-rank approximations, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 1998, pp. 370-378.
16. Z. FÜREDI AND J. KOMLOS, The eigenvalues of random symmetric matrices, Combinatorica, 1 (1981), pp. 233-241.
17. A. C. GILBERT, S. GUHA, P. INDYK, Y. KOTIDIS, S. MUTHUKRISHNAN, AND M. STRAUSS, Fast, small-space algorithms for approximate histogram maintenance, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 389-398.
18. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, Johns Hopkins University Press, Baltimore, MD, 1989.
19. M. R. HENZINGER, P. RAGHAVAN, AND S. RAJAGOPALAN, Computing on Data Streams, Tech. Report 1998-011, Digital Systems Research Center, Palo Alto, CA, 1998.
20. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, New York, 1985.
21. M. KRIVELEVICH AND V. H. VU, On the Concentration of Eigenvalues of Random Symmetric Matrices, Tech. Report MSR-TR-2000-60, Microsoft Research, Redmond, WA, 2000.
22. C. MCDIARMID, On the method of bounded differences, in Surveys in Combinatorics, 1989, J. Siemons, ed., London Math. Soc. Lecture Notes Ser., Cambridge University Press, Cambridge, UK, 1989, pp. 148-188.
23. J. I. MUNRO AND M. S. PATERSON, Selection and sorting with limited storage, in Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, 1978, pp. 253-258.
24. M. RUDELSON AND R. VERSHYNIN, Approximation of Matrices, manuscript.
25. G. W. STEWART AND J. G. SUN, Matrix Perturbation Theory, Academic Press, New York, 1990.
26. V. STRASSEN, Gaussian elimination is not optimal, Numer. Math., 14 (1969), pp. 354-356.
27. n, manuscript; available online from http://arxiv.org/abs/math/0011232.
28. J. S. VITTER, Random sampling with a reservoir, ACM Trans. Math. Softw., 11 (1985), pp. 37-57.