Blendenpik: Supercharging lapack's least-squares solver

SIAM Journal on Scientific Computing

Volumn 32, Issue 3, 2010, Pages 1217-1236

  Avron, Haim ^a   Maymounkov, Petar ^b   Toledo, Sivan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Dense linear least squares; Randomized numerical linear algebra; Randomized preconditioners

Indexed keywords

DENSE LINEAR LEAST SQUARE; LEAST SQUARE; LINEAR LEAST SQUARES; MIXING TECHNIQUES; NUMERICAL LINEAR ALGEBRA; PRECONDITIONERS; RANDOM MIXING; RANDOM SAMPLING; RANDOMIZED NUMERICAL LINEAR ALGEBRA; RANDOMIZED PRECONDITIONER;

LINEAR ALGEBRA;

EID: 77953821242     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/090767911     Document Type: Article

References (26)

1. N. Ailon and B. Chazelle, Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, New York, 2006, pp. 557-563.
2. N. Ailon and E. Liberty, Fast dimension reduction using Rademacher series on dual BCH codes, in Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2008, pp. 1-9.
3. H. Avron, E. Ng, and S. Toledo, Using perturbed QR factorizations to solve linear leastsquares problems, SIAM J. Matrix Anal. Appl., 31 (2009), pp. 674-693.
4. H. Avron, Efficient and Robust Hybrid Iterative-Direct Multipurpose Linear Solvers, Ph.D. thesis, Tel-Aviv University, Israel, expected October 2010.
5. C. Boutsidis and P. Drineas, Random projections for the nonnegative least-squares problem, Linear Algebra Appl., 431 (2009), pp. 760-771.
6. E. J. Candès and B. Recht, Exact matrix completion via convex optimization, Tecnical report CoRR, abs/0805.4471 (2008).
7. X.-W. Chang, C. C. Paige, and D. Titley-Peloquin, Stopping criteria for the iterative solution of linear least squares problems, SIAM J. Matrix Anal. Appl., 31 (2009), pp. 831-852.
8. p regression, SIAM J. Comput., 38 (2009), pp. 2060-2078.
9. J. Demmel, I. Dumitriu, and O. Holtz, Fast linear algebra is stable, Numer. Math., 108 (2007), pp. 59-91.
10. P. Drineas, M. W. Mahoney, S. Muthukrishnan, and T. Sarlós, Faster least squares approximation, Tecnical report, CoRR, abs/0710.1435 (2007).
11. P. Drineas, M. W. Mahoney, and S. Muthukrishnan, Sampling algorithms for l2 regression and applications, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, 2006, pp. 1127-1136.
12. P. Drineas, M. W. Mahoney, and S. Muthukrishnan, Relative-error CUR matrix decompositions, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 844-881.
13. J. Johnson and M. Puschel, In search of the optimal Walsh-Hadamard transform, in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Washington, DC, 2000, pp. 3347-3350.
14. M. Kac, Probability and Related Topics in Physical Science, Wiley Interscience, New York, 1959.
15. M. W. Mahoney and P. Drineas, CUR matrix decompositions for improved data analysis, Proc. Nat. Acad. Sci., USA, 106 (2009), pp. 697-702.
16. MATLAB, version 7.7, software package, The MathWorks, 2008.
17. N. H. Nguyen, T. T. Do, and T. D. Tran, A fast and efficient algorithm for low-rank approximation of a matrix, in Proceedings of the 41st ACM Symposium on Theory of Computing, New York, 2009, pp. 215-224.
18. C. C. Paige and M. A. Saunders, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software, 8 (1982), pp. 43-71.
19. C. C. Paige, The Computation of Eigenvalues and Eigenvectors of Very Large Sparse Matrices, Ph.D. thesis, University of London, 1971.
20. B. N. Parlett and D. S. Scott, The Lanczos algorithm with selective orthogonalization, Math. Comp., 33 (1979), pp. 217-238.
21. V. Rokhlin, A. Szlam, and M. Tygert, A randomized algorithm for principal component analysis, SIAM J. Matrix Anal. Appl., 31 (2009), pp. 1100-1124.
22. V. Rokhlin and M. Tygert, A fast randomized algorithm for overdetermined linear leastsquares regression, Proc. Nat. Acad. Sci., USA, 105 (2008), pp. 13212-13217.
23. T. Sarlos, Improved approximation algorithms for large matrices via random projections, in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, 2006, pp. 143-152.
24. H. V. Sorensen and C. S. Burrus, Efficient computation of the DFT with only a subset of input or output points, IEEE Trans. Signal Proces., 41 (1993), pp. 1184-1200.
25. G. W. Stewart, Matrix Algorithms Volume II: Eigensystems, SIAM, Philadelphia, 2001.
26. R. C. Whaley and A. Petitet, Minimizing development and maintenance costs in supporting persistently optimized BLAS, Software: Practice and Experience, 35 (2005), pp. 101-121, also online at http://www.cs.utsa.edu/whaley/papers/ spercw04.ps.