{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T19:16:55Z","timestamp":1782933415017,"version":"3.54.5"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T00:00:00Z","timestamp":1478217600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T00:00:00Z","timestamp":1478217600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["N66001-13-1-4050"],"award-info":[{"award-number":["N66001-13-1-4050"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1320652"],"award-info":[{"award-number":["1320652"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0748488"],"award-info":[{"award-number":["0748488"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10444-016-9494-8","type":"journal-article","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T18:36:25Z","timestamp":1478284585000},"page":"495-516","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":62,"title":["Efficient algorithms for cur and interpolative matrix decompositions"],"prefix":"10.1007","volume":"43","author":[{"given":"Sergey","family":"Voronin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Per-Gunnar","family":"Martinsson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,11,4]]},"reference":[{"key":"9494_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users\u2019 Guide, 3rd edn. Society for Industrial and Applied Mathematics, Philadelphia, PA (1999)","DOI":"10.1137\/1.9780898719604"},{"key":"9494_CR2","doi-asserted-by":"crossref","unstructured":"Bodor, A., Csabai, I., Mahoney, M., Solymosi, N.: rCUR: an R package for CUR matrix decomposition. BMC Bioinformatics, 13(1) (2012)","DOI":"10.1186\/1471-2105-13-103"},{"key":"9494_CR3","doi-asserted-by":"crossref","unstructured":"Boutsidis, C., Woodruff, D.P.: Optimal cur matrix decompositions. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp 353\u2013362 (2014)","DOI":"10.1145\/2591796.2591819"},{"key":"9494_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0024-3795(87)90103-0","volume":"88\/89","author":"TF Chan","year":"1987","unstructured":"Chan, T.F.: Rank revealing QR factorizations. Linear Algebra Appl. 88\/89, 67\u201382 (1987)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"9494_CR5","doi-asserted-by":"publisher","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(2), 844\u2013881 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"9494_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02288367","volume":"1","author":"C Eckart","year":"1936","unstructured":"Eckart, C., Young, G.: The approximation of one matrix by another of lower rank. Psychometrika 1(3), 211\u2013218 (1936)","journal-title":"Psychometrika"},{"key":"9494_CR7","volume-title":"Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences, 4th edn. Johns Hopkins University Press, Baltimore (2013)","edition":"4"},{"issue":"1","key":"9494_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0024-3795(96)00301-1","volume":"261","author":"SA Goreinov","year":"1997","unstructured":"Goreinov, S.A., Tyrtyshnikov, E.E., Zamarashkin, N.L.: A theory of pseudoskeleton approximations. Linear Algebra Appl. 261(1), 1\u201321 (1997)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"9494_CR9","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1137\/0917055","volume":"17","author":"G Ming","year":"1996","unstructured":"Ming, G., Eisenstat, S.C.: Efficient algorithms for computing a strong rank-revealing qr factorization. SIAM J. Sci Comput. 17(4), 848\u2013869 (1996)","journal-title":"SIAM J. Sci Comput."},{"issue":"2","key":"9494_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko, N., Martinsson, P.G., Tropp, J.A.: Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. 53(2), 217\u2013288 (2011)","journal-title":"SIAM Rev."},{"issue":"1","key":"9494_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1080\/00031305.1978.10479237","volume":"32","author":"DC Hoaglin","year":"1978","unstructured":"Hoaglin, D.C., Welsch, R.E.: The Hat matrix in regression and ANOVA. Am. Stat. 32(1), 17\u201322 (1978)","journal-title":"Am. Stat."},{"issue":"51","key":"9494_CR12","doi-asserted-by":"publisher","first-page":"20167","DOI":"10.1073\/pnas.0709640104","volume":"104","author":"E Liberty","year":"2007","unstructured":"Liberty, E., Woolfe, F., Martinsson, P.-G., Rokhlin, V., Tygert, M.: Randomized algorithms for the low-rank approximation of matrices. Proc. Natl. Acad. Sci. 104(51), 20167\u201320172 (2007)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"9494_CR13","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1073\/pnas.0803205106","volume":"106","author":"MW Mahoney","year":"2009","unstructured":"Mahoney, M.W., Drineas, P.: CUR matrix decompositions for improved data analysis. Proc. Natl. Acad. Sci. USA 106(3), 697\u2013702 (2009). With supplementary material available online","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"9494_CR14","doi-asserted-by":"crossref","unstructured":"Martinsson, P.-G., Rokhlin, V., Tygert, M.: A Randomized Algorithm for the Approximation of Matrices. Technical Report Yale CS Research Report YALEU\/DCS\/RR-1361, Yale University, Computer Science Department (2006)","DOI":"10.21236\/ADA458927"},{"key":"9494_CR15","doi-asserted-by":"crossref","unstructured":"Mitrovic, N., Asif, M.T., Rasheed, U., Dauwels, J., Jaillet, P.: CUR decomposition for compression and compressed sensing of large-scale traffic data Proceedings of the 16th International IEEE Annual Conference on Intelligent Transportation Systems (2013)","DOI":"10.1109\/ITSC.2013.6728438"},{"issue":"3","key":"9494_CR16","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/080736417","volume":"31","author":"V Rokhlin","year":"2009","unstructured":"Rokhlin, V., Szlam, A., Tygert, M.: A randomized algorithm for principal component analysis. SIAM J. Matrix Anal. Appl. 31(3), 1100\u20131124 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9494_CR17","doi-asserted-by":"crossref","unstructured":"Sarlos, T.: Improved approximation algorithms for large matrices via random projections. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), pp 143\u2013152 (2006)","DOI":"10.1109\/FOCS.2006.37"},{"key":"9494_CR18","doi-asserted-by":"crossref","unstructured":"Sorensen, D.C., Embree, M.: A DEIM Induced CUR Factorization ArXiv e-prints (2014)","DOI":"10.21236\/ADA625637"},{"issue":"4","key":"9494_CR19","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s006070070031","volume":"64","author":"E Tyrtyshnikov","year":"2000","unstructured":"Tyrtyshnikov, E.: Incomplete cross approximation in the mosaic-skeleton method. Computing 64(4), 367\u2013380 (2000)","journal-title":"Computing"},{"key":"9494_CR20","unstructured":"Voronin, S., Martinsson, P.-G.: Rsvdpack: Subroutines for computing partial singular value decompositions via randomized sampling on single core, multi core, and gpu architectures. arXiv: 1502.05366 (2015)"},{"key":"9494_CR21","first-page":"2729","volume":"14","author":"S Wang","year":"2013","unstructured":"Wang, S., Zhang, Z.: Improving CUR matrix decomposition and the Nystr\u00f6m approximation via adaptive sampling. J. Mach. Learn Res. 14, 2729\u20132769 (2013)","journal-title":"J. Mach. Learn Res."},{"issue":"3","key":"9494_CR22","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.acha.2007.12.002","volume":"25","author":"F Woolfe","year":"2008","unstructured":"Woolfe, F., Liberty, E., Rokhlin, V., Tygert, M.: A fast randomized algorithm for the approximation of matrices. Appl. Comput. Harmon. Anal. 25(3), 335\u2013366 (2008)","journal-title":"Appl. Comput. Harmon. Anal."}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-016-9494-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-016-9494-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-016-9494-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T10:53:27Z","timestamp":1718880807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-016-9494-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,4]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["9494"],"URL":"https:\/\/doi.org\/10.1007\/s10444-016-9494-8","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,4]]},"assertion":[{"value":"11 September 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}