Faster least squares approximation
Authors:
Top Cited Papers
- 2 October 2010
- journal article
- research article
- Published by Springer Nature in Numerische Mathematik
- Vol. 117 (2) , 219-249
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Blendenpik: Supercharging LAPACK's Least-Squares SolverSIAM Journal on Scientific Computing, 2010
- Sums of random Hermitian matrices and an inequality by RudelsonElectronic Communications in Probability, 2010
- A fast randomized algorithm for overdetermined linear least-squares regressionProceedings of the National Academy of Sciences, 2008
- On variants of the Johnson–Lindenstrauss lemmaRandom Structures & Algorithms, 2008
- Relative-Error $CUR$ Matrix DecompositionsSIAM Journal on Matrix Analysis and Applications, 2008
- Sampling from large matricesJournal of the ACM, 2007
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix MultiplicationSIAM Journal on Computing, 2006
- Spectral techniques applied to sparse random graphsRandom Structures & Algorithms, 2005
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- A generalization of the fast LUP matrix decomposition algorithm and applicationsJournal of Algorithms, 1982