{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T20:52:18Z","timestamp":1773867138817,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,10,2]],"date-time":"2010-10-02T00:00:00Z","timestamp":1285977600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s00211-010-0331-6","type":"journal-article","created":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T14:24:52Z","timestamp":1285943092000},"page":"219-249","source":"Crossref","is-referenced-by-count":237,"title":["Faster least squares approximation"],"prefix":"10.1007","volume":"117","author":[{"given":"Petros","family":"Drineas","sequence":"first","affiliation":[]},{"given":"Michael W.","family":"Mahoney","sequence":"additional","affiliation":[]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[]},{"given":"Tam\u00e1s","family":"Sarl\u00f3s","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,10,2]]},"reference":[{"key":"331_CR1","doi-asserted-by":"crossref","unstructured":"Ailon, N., Chazelle, B.: Approximate nearest neighbors and the fast Johnson\u2013Lindenstrauss transform. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 557\u2013563 (2006)","DOI":"10.1145\/1132516.1132597"},{"key":"331_CR2","doi-asserted-by":"crossref","unstructured":"Ailon, N., Liberty, E.: Fast dimension reduction using Rademacher series on dual BCH codes. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1\u20139, (2008)","DOI":"10.21236\/ADA471857"},{"key":"331_CR3","doi-asserted-by":"crossref","unstructured":"Arora, S., Hazan, E., Kale, S.: A fast random sampling algorithm for sparsifying matrices. In: Proceedings of the 10th International Workshop on Randomization and Computation, pp. 272\u2013279 (2006)","DOI":"10.1007\/11830924_26"},{"key":"331_CR4","doi-asserted-by":"crossref","unstructured":"Avron, H., Maymounkov, P., Toledo, S.: Blendenpik: Supercharging LAPACK\u2019s least-squares solver. Manuscript (2009)","DOI":"10.1137\/090767911"},{"key":"331_CR5","doi-asserted-by":"crossref","unstructured":"Avron, H., Maymounkov, P., Toledo, S.: Blendenpik: Supercharging LAPACK\u2019s least-squares solver. SIAM J. Scientific Comput. (2010, to appear)","DOI":"10.1137\/090767911"},{"key":"331_CR6","volume-title":"Generalized Inverses: Theory and Applications","author":"A. Ben-Israel","year":"2003","unstructured":"Ben-Israel A., Greville T.N.E.: Generalized Inverses: Theory and Applications. Springer, New York (2003)"},{"key":"331_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix Analysis","author":"R. Bhatia","year":"1997","unstructured":"Bhatia R.: Matrix Analysis. Springer-Verlag, New York (1997)"},{"key":"331_CR8","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Numerical linear algebra in the streaming model. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 205\u2013214 (2009)","DOI":"10.1145\/1536414.1536445"},{"issue":"3","key":"331_CR9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith D., Winograd S.: Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9(3), 251\u2013280 (1990)","journal-title":"J. Symbolic Comput."},{"issue":"104","key":"331_CR10","first-page":"833","volume":"22","author":"G. Dahlquist","year":"1968","unstructured":"Dahlquist G., Sj\u00f6berg B., Svensson P.: Comparison of the method of averages with the method of least squares. Math. Comput. 22(104), 833\u2013845 (1968)","journal-title":"Math. Comput."},{"key":"331_CR11","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1137\/S0097539704442684","volume":"36","author":"P. Drineas","year":"2006","unstructured":"Drineas P., Kannan R., Mahoney M.W.: Fast Monte Carlo algorithms for matrices I: approximating matrix multiplication. SIAM J. Comput. 36, 132\u2013157 (2006)","journal-title":"SIAM J. Comput."},{"key":"331_CR12","doi-asserted-by":"crossref","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S.: Sampling algorithms for \u2113 2 regression and applications. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1127\u20131136 (2006)","DOI":"10.1145\/1109557.1109682"},{"key":"331_CR13","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1137\/07070471X","volume":"30","author":"P. Drineas","year":"2008","unstructured":"Drineas P., Mahoney M.W., Muthukrishnan S.: Relative-error CUR matrix decompositions. SIAM J. Matrix Anal. Appl. 30, 844\u2013881 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"331_CR14","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S., Sarl\u00f3s, T.: Faster least squares approximation. Technical report. Preprint: arXiv:0710.1435 (2007)"},{"issue":"2","key":"331_CR15","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1002\/rsa.20089","volume":"27","author":"U. Feige","year":"2005","unstructured":"Feige U., Ofek E.: Spectral techniques applied to sparse random graphs. Random Struct. Algorithms 27(2), 251\u2013275 (2005)","journal-title":"Random Struct. Algorithms"},{"key":"331_CR16","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1996","unstructured":"Golub G.H., Van Loan C.F.: Matrix Computations. Johns Hopkins University Press, Baltimore (1996)"},{"key":"331_CR17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0196-6774(82)90007-4","volume":"3","author":"O.H. Ibarra","year":"1982","unstructured":"Ibarra O.H., Moran S., Hui R.: A generalization of the fast LUP matrix decomposition algorithm and applications. J. Algorithms 3, 45\u201356 (1982)","journal-title":"J. Algorithms"},{"issue":"2","key":"331_CR18","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1002\/rsa.20218","volume":"33","author":"J. Matou\u0161ek","year":"2008","unstructured":"Matou\u0161ek J.: On variants of the Johnson\u2013Lindenstrauss lemma. Random Struct. Algorithms 33(2), 142\u2013156 (2008)","journal-title":"Random Struct. Algorithms"},{"key":"331_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani R., Raghavan P.: Randomized Algorithms. Cambridge University Press, New York (1995)"},{"key":"331_CR20","doi-asserted-by":"crossref","unstructured":"Nguyen, N.H., Do, T.T., Tran, T.D.: A fast and efficient algorithm for low-rank approximation of a matrix. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 215\u2013224 (2009)","DOI":"10.1145\/1536414.1536446"},{"key":"331_CR21","doi-asserted-by":"crossref","unstructured":"Oliveira, R.I.: Sums of random Hermitian matrices and an inequality by Rudelson. arXiv:1004.3821v1 (2010)","DOI":"10.1214\/ECP.v15-1544"},{"issue":"36","key":"331_CR22","doi-asserted-by":"crossref","first-page":"13212","DOI":"10.1073\/pnas.0804869105","volume":"105","author":"V. Rokhlin","year":"2008","unstructured":"Rokhlin V., Tygert M.: A fast randomized algorithm for overdetermined linear least-squares regression. Proc. Natl. Acad. Sci. USA 105(36), 13212\u201313217 (2008)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"331_CR23","doi-asserted-by":"crossref","unstructured":"Rudelson, M., Vershynin, R.: Sampling from large matrices: an approach through geometric functional analysis. J. ACM, 54(4):Article 21 (2007)","DOI":"10.1145\/1255443.1255449"},{"key":"331_CR24","doi-asserted-by":"crossref","unstructured":"Sarl\u00f3s, T.: Improved approximation algorithms for large matrices via random projections. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 143\u2013152 (2006)","DOI":"10.1109\/FOCS.2006.37"},{"key":"331_CR25","volume-title":"Matrix Perturbation Theory","author":"G.W. Stewart","year":"1990","unstructured":"Stewart G.W., Sun J.G.: Matrix Perturbation Theory. Academic Press, New York (1990)"},{"key":"331_CR26","volume-title":"The History of Statistics: The Measurement of Uncertainty before 1900","author":"S.M. Stigler","year":"1986","unstructured":"Stigler S.M.: The History of Statistics: The Measurement of Uncertainty before 1900. Harvard University Press, Cambridge (1986)"}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-010-0331-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00211-010-0331-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-010-0331-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T05:14:44Z","timestamp":1559711684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00211-010-0331-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,2]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["331"],"URL":"https:\/\/doi.org\/10.1007\/s00211-010-0331-6","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,2]]}}}