{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T18:47:28Z","timestamp":1776883648493,"version":"3.51.2"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["1952735"],"award-info":[{"award-number":["1952735"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["2012606"],"award-info":[{"award-number":["2012606"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0022251"],"award-info":[{"award-number":["DE-SC0022251"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-18-1-2354"],"award-info":[{"award-number":["N00014-18-1-2354"]}],"id":[{"id":"10.13039\/100000006","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":[[2023,8]]},"DOI":"10.1007\/s10444-023-10061-z","type":"journal-article","created":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T06:02:16Z","timestamp":1691388136000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions"],"prefix":"10.1007","volume":"49","author":[{"given":"Yijun","family":"Dong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1048-5270","authenticated-orcid":false,"given":"Per-Gunnar","family":"Martinsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,7]]},"reference":[{"issue":"1","key":"10061_CR1","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). https:\/\/doi.org\/10.1016\/S0024-3795(96)00301-1","journal-title":"Linear Algebra Appl."},{"key":"10061_CR2","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. JHU press, Baltimore, MD, USA (2013)"},{"key":"10061_CR3","volume-title":"Numerical Linear Algebra","author":"LN Trefethen","year":"2022","unstructured":"Trefethen, L.N., Bau, D.: Numerical Linear Algebra, vol. 181. Siam, Philadelphia, PA, USA (2022)"},{"key":"10061_CR4","doi-asserted-by":"publisher","unstructured":"Kezhong Zhao, Vouvakis, M.N., Jin-Fa Lee: The adaptive cross approximation algorithm for accelerated method of moments computations of emc problems. IEEE Trans. Electromagn. Compatibility 47(4), 763\u2013773 (2005). https:\/\/doi.org\/10.1109\/TEMC.2005.857898","DOI":"10.1109\/TEMC.2005.857898"},{"issue":"4","key":"10061_CR5","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1137\/0917055","volume":"17","author":"M Gu","year":"1996","unstructured":"Gu, M., Eisenstat, S.C.: Efficient algorithms for computing a strong rankrevealing qr factorization. SIAM J. Sci. Comput. 17(4), 848\u2013869 (1996). https:\/\/doi.org\/10.1137\/0917055","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"10061_CR6","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). https:\/\/doi.org\/10.1137\/090771806","journal-title":"SIAM Rev."},{"key":"10061_CR7","doi-asserted-by":"publisher","unstructured":"Liberty, E., Woolfe, F., Martinsson, P.-G., Rokhlin, V., Tygert, M.: Randomized algorithms for the low-rank approximation of matrices. Proceedings of the National Academy of Sciences 104(51), 20167\u201320172 (2007) https:\/\/arxiv.org\/abs\/https:\/\/www.pnas.org\/content\/104\/51\/20167.full.pdf. https:\/\/doi.org\/10.1073\/pnas.0709640104","DOI":"10.1073\/pnas.0709640104"},{"key":"10061_CR8","doi-asserted-by":"publisher","unstructured":"Drma\u010d, Z., Gugercin, S.: A new selection operator for the discrete empirical interpolation method\u2013improved a priori error bound and extensions. SIAM J. Sci. Comput. 38(2), 631\u2013648 (2016). https:\/\/arxiv.org\/abs\/https:\/\/doi.org\/10.1137\/15M1019271. https:\/\/doi.org\/10.1137\/15M1019271","DOI":"10.1137\/15M1019271"},{"key":"10061_CR9","doi-asserted-by":"publisher","unstructured":"Sorensen, D.C., Embree, M.: A deim induced cur factorization. SIAM J. Sci. Comput. 38(3), 1454\u20131482 (2016). https:\/\/arxiv.org\/abs\/https:\/\/doi.org\/10.1137\/140978430. https:\/\/doi.org\/10.1137\/140978430","DOI":"10.1137\/140978430"},{"key":"10061_CR10","unstructured":"Anderson, D., Gu, M.: An efficient, sparsity-preserving, online algorithm for low-rank approximation. In: International Conference on Machine Learning, pp. 156\u2013165 (2017). PMLR"},{"key":"10061_CR11","unstructured":"Chen, C., Gu, M., Zhang, Z., Zhang, W., Yu, Y.: Efficient spectrum-revealing cur matrix decomposition. In: International Conference on Artificial Intelligence and Statistics, pp. 766\u2013775 (2020). PMLR"},{"key":"10061_CR12","doi-asserted-by":"publisher","unstructured":"Cohen, M.B., Lee, Y.T., Musco, C., Musco, C., Peng, R., Sidford, A.: Uniform sampling for matrix approximation. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science. ITCS \u201915, pp. 181\u2013190. Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2688073.2688113","DOI":"10.1145\/2688073.2688113"},{"key":"10061_CR13","doi-asserted-by":"crossref","unstructured":"Derezinski, M., Khanna, R., Mahoney, M.W.: Improved guarantees and a multiple-descent curve for the column subset selection problem and the nystr\u00f6m method. arXiv:2002.09073 (2020)","DOI":"10.24963\/ijcai.2021\/647"},{"key":"10061_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/noti2202","volume":"68","author":"M Derezi\u0144ski","year":"2021","unstructured":"Derezi\u0144ski, M., Mahoney, M.: Determinantal point processes in randomized numerical linear algebra. Notices Am. Math. Soc. 68, 1 (2021). https:\/\/doi.org\/10.1090\/noti2202","journal-title":"Notices Am. Math. Soc."},{"issue":"1","key":"10061_CR15","first-page":"3475","volume":"13","author":"P Drineas","year":"2012","unstructured":"Drineas, P., Magdon-Ismail, M., Mahoney, M.W., Woodruff, D.P.: Fast approximation of matrix coherence and statistical leverage. J. Mach. Learn. Res. 13(1), 3475\u20133506 (2012)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"10061_CR16","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. Proceedings of the National Academy of Sciences 106(3), 697\u2013702 (2009)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"3","key":"10061_CR17","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10444-016-9494-8","volume":"43","author":"S Voronin","year":"2017","unstructured":"Voronin, S., Martinsson, P.-G.: Efficient algorithms for cur and interpolative matrix decompositions. Adv. Computat. Math. 43(3), 495\u2013516 (2017). https:\/\/doi.org\/10.1007\/s10444-016-9494-8","journal-title":"Adv. Computat. Math."},{"key":"10061_CR18","doi-asserted-by":"publisher","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. STOC \u201998, pp. 604\u2013613. Association for Computing Machinery, New York, NY, USA (1998). https:\/\/doi.org\/10.1145\/276698.276876","DOI":"10.1145\/276698.276876"},{"key":"10061_CR19","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0962492920000021","volume":"29","author":"P-G Martinsson","year":"2020","unstructured":"Martinsson, P.-G., Tropp, J.A.: Randomized numerical linear algebra: foundations and algorithms. Acta Numerica 29, 403\u2013572 (2020). https:\/\/doi.org\/10.1017\/S0962492920000021","journal-title":"Acta Numerica"},{"key":"10061_CR20","doi-asserted-by":"publisher","unstructured":"Woodruff, D.P.: Sketching as a tool for numerical linear algebra. Found. Trends Theor. Comput. Sci. 10(1\u20132), 1\u2013157 (2014). https:\/\/doi.org\/10.1561\/0400000060","DOI":"10.1561\/0400000060"},{"key":"10061_CR21","doi-asserted-by":"publisher","unstructured":"Boutsidis, C., Gittens, A.: Improved matrix algorithms via the subsampled randomized hadamard transform. SIAM J. Matrix Anal. Appl. 34(3), 1301\u20131340 (2013). https:\/\/doi.org\/10.1137\/120874540","DOI":"10.1137\/120874540"},{"key":"10061_CR22","doi-asserted-by":"publisher","unstructured":"Rokhlin, V., Tygert, M.: A fast randomized algorithm for overdetermined linear least-squares regression. Proceedings of the National Academy of Sciences 105(36), 13212\u201313217 (2008) https:\/\/arxiv.org\/abs\/https:\/\/www.pnas.org\/content\/105\/36\/13212.full.pdf. https:\/\/doi.org\/10.1073\/pnas.0804869105","DOI":"10.1073\/pnas.0804869105"},{"key":"10061_CR23","doi-asserted-by":"publisher","unstructured":"Tropp, J.A.: Improved analysis of the subsampled randomized hadamard transform. Adv. Adaptive Data Anal. 03(01n02), 115\u2013126 (2011). https:\/\/doi.org\/10.1142\/S1793536911000787","DOI":"10.1142\/S1793536911000787"},{"key":"10061_CR24","doi-asserted-by":"publisher","unstructured":"Woolfe, F., Liberty, E., Rokhlin, V., Tygert, M.: A fast randomized algorithm for the approximation of matrices. Appl. Computat. Harmonic Anal. 25(3), 335\u2013366 (2008). https:\/\/doi.org\/10.1016\/j.acha.2007.12.002","DOI":"10.1016\/j.acha.2007.12.002"},{"key":"10061_CR25","doi-asserted-by":"publisher","unstructured":"Clarkson, K.L., Woodruff, D.P.: Low-rank approximation and regression in input sparsity time. J. ACM 63(6) (2017). https:\/\/doi.org\/10.1145\/3019134","DOI":"10.1145\/3019134"},{"key":"10061_CR26","doi-asserted-by":"publisher","unstructured":"Meng, X., Mahoney, M.W.: Low-distortion subspace embeddings in inputsparsity time and applications to robust linear regression. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing. STOC \u201913, pp. 91\u2013100. Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2488608.2488621","DOI":"10.1145\/2488608.2488621"},{"key":"10061_CR27","doi-asserted-by":"publisher","unstructured":"Nelson, J., Nguy\u00ean, H.L.: Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 117\u2013126 (2013). https:\/\/doi.org\/10.1109\/FOCS.2013.21","DOI":"10.1109\/FOCS.2013.21"},{"key":"10061_CR28","unstructured":"Tropp, J.A., Yurtsever, A., Udell, M., Cevher, V.: Fixed-rank approximation of a positive-semidefinite matrix from streaming data. Adv. Neural Inf. Process. Syst. 30 (2017)"},{"issue":"5","key":"10061_CR29","doi-asserted-by":"publisher","first-page":"757","DOI":"10.4153\/CMB-1966-083-2","volume":"9","author":"W Kahan","year":"1966","unstructured":"Kahan, W.: Numerical linear algebra. Canadian Math. Bull. 9(5), 757\u2013801 (1966). https:\/\/doi.org\/10.4153\/CMB-1966-083-2","journal-title":"Numerical linear algebra. Canadian Math. Bull."},{"issue":"3","key":"10061_CR30","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). https:\/\/doi.org\/10.1007\/BF02288367","journal-title":"Psychometrika"},{"key":"10061_CR31","unstructured":"Anderson, D., Du, S., Mahoney, M., Melgaard, C., Wu, K., Gu, M.: Spectral gap error bounds for improving CUR matrix decomposition and the Nystr\u00f6m method. In: Lebanon, G., Vishwanathan, S.V.N. (eds.) Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, 38, pp. 19\u201327. PMLR, San Diego, California, USA (2015). https:\/\/proceedings.mlr.press\/v38\/anderson15.html"},{"issue":"1","key":"10061_CR32","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00453-011-9582-6","volume":"65","author":"A Civril","year":"2013","unstructured":"Civril, A., Magdon-Ismail, M.: Exponential inapproximability of selecting a maximum volume sub-matrix. Algorithmica 65(1), 159\u2013176 (2013)","journal-title":"Algorithmica"},{"issue":"47","key":"10061_CR33","doi-asserted-by":"publisher","first-page":"4801","DOI":"10.1016\/j.tcs.2009.06.018","volume":"410","author":"A \u00c7ivril","year":"2009","unstructured":"\u00c7ivril, A., Magdon-Ismail, M.: On selecting a maximum volume sub-matrix of a matrix and related problems. Theor. Comput. Sci. 410(47), 4801\u20134811 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.06.018","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"10061_CR34","doi-asserted-by":"publisher","first-page":"225","DOI":"10.4086\/toc.2006.v002a012","volume":"2","author":"A Deshpande","year":"2006","unstructured":"Deshpande, A., Rademacher, L., Vempala, S., Wang, G.: Matrix approximation and projective clustering via volume sampling. Theory Comput. 2(12), 225\u2013247 (2006). https:\/\/doi.org\/10.4086\/toc.2006.v002a012","journal-title":"Theory Comput."},{"key":"10061_CR35","doi-asserted-by":"publisher","unstructured":"Deshpande, A., Rademacher, L.: Efficient volume sampling for row\/column subset selection. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 329\u2013338 (2010). https:\/\/doi.org\/10.1109\/FOCS.2010.38","DOI":"10.1109\/FOCS.2010.38"},{"issue":"4","key":"10061_CR36","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1137\/19M1281848","volume":"41","author":"A Cortinovis","year":"2020","unstructured":"Cortinovis, A., Kressner, D.: Low-rank approximation in the frobenius norm by column and row subset selection. SIAM J. Matrix Anal. Appl. 41(4), 1651\u20131673 (2020)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"10061_CR37","doi-asserted-by":"publisher","first-page":"2430","DOI":"10.1137\/18M1201068","volume":"41","author":"JA Tropp","year":"2019","unstructured":"Tropp, J.A., Yurtsever, A., Udell, M., Cevher, V.: Streaming low-rank matrix approximation with an application to scientific simulation. SIAM J. Sci. Comput. 41(4), 2430\u20132463 (2019). https:\/\/doi.org\/10.1137\/18M1201068","journal-title":"SIAM J. Sci. Comput."},{"key":"10061_CR38","unstructured":"Musco, C., Musco, C.: Randomized block krylov methods for stronger and faster approximate singular value decomposition. In: Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1. NIPS\u201915, pp. 1396\u20131404. MIT Press, Cambridge, MA, USA (2015)"},{"issue":"317\u2013366","key":"10061_CR39","first-page":"131","volume":"1","author":"KR Davidson","year":"2001","unstructured":"Davidson, K.R., Szarek, S.J.: Local operator theory, random matrices and Banach spaces. Handbook of the Geometry of Banach Spaces 1(317\u2013366), 131 (2001)","journal-title":"Handbook of the Geometry of Banach Spaces"},{"key":"10061_CR40","doi-asserted-by":"crossref","unstructured":"Rudelson, M.: Invertibility of random matrices: norm of the inverse. Annal. Math. 168(2), 575\u2013600 (2008). Accessed 2022-08-09","DOI":"10.4007\/annals.2008.168.575"},{"issue":"4","key":"10061_CR41","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/320941.320947","volume":"5","author":"AS Householder","year":"1958","unstructured":"Householder, A.S.: Unitary triangularization of a nonsymmetric matrix. J. ACM 5(4), 339\u2013342 (1958). https:\/\/doi.org\/10.1145\/320941.320947","journal-title":"J. ACM"},{"issue":"3","key":"10061_CR42","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1137\/0611023","volume":"11","author":"LN Trefethen","year":"1990","unstructured":"Trefethen, L.N., Schreiber, R.S.: Average-case stability of gaussian elimination. SIAM Journal on Matrix Analysis and Applications 11(3), 335\u2013360 (1990). https:\/\/doi.org\/10.1137\/0611023","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"10061_CR43","doi-asserted-by":"publisher","unstructured":"Chan, T.F.: Rank revealing QR factorizations. Linear Algebra and its Applications 88\u201389, 67\u201382 (1987). https:\/\/doi.org\/10.1016\/0024-3795(87)90103-0","DOI":"10.1016\/0024-3795(87)90103-0"},{"issue":"197","key":"10061_CR44","first-page":"213","volume":"58","author":"YP Hong","year":"1992","unstructured":"Hong, Y.P., Pan, C.-T.: Rank-revealing QR factorizations and the singular value decomposition. Math. Computat. 58(197), 213\u2013232 (1992)","journal-title":"Math. Computat."},{"issue":"1","key":"10061_CR45","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/360569.360653","volume":"18","author":"G Peters","year":"1975","unstructured":"Peters, G., Wilkinson, J.H.: On the stability of Gauss-Jordan elimination with pivoting. Commun. ACM 18(1), 20\u201324 (1975). https:\/\/doi.org\/10.1145\/360569.360653","journal-title":"Commun. ACM"},{"issue":"4","key":"10061_CR46","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1137\/0909042","volume":"9","author":"GA Geist","year":"1988","unstructured":"Geist, G.A., Romine, C.H.: $$lu$$ factorization algorithms on distributed memory multiprocessor architectures. SIAM J. Sci. Stat. Comput. 9(4), 639\u2013649 (1988). https:\/\/doi.org\/10.1137\/0909042","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"8","key":"10061_CR47","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1109\/TPDS.2012.242","volume":"24","author":"J Kurzak","year":"2013","unstructured":"Kurzak, J., Luszczek, P., Faverge, M., Dongarra, J.: Lu factorization with partial pivoting for a multicore system with accelerators. IEEE Trans. Parallel Distribut. Syst. 24(8), 1613\u20131621 (2013). https:\/\/doi.org\/10.1109\/TPDS.2012.242","journal-title":"IEEE Trans. Parallel Distribut. Syst."},{"key":"10061_CR48","doi-asserted-by":"publisher","unstructured":"Grigori, L., Demmel, J.W., Xiang, H.: Calu: A communication optimal LU factorization algorithm. SIAM J. Matrix Anal. Appl. 32(4), 1317\u20131350 (2011). https:\/\/doi.org\/10.1137\/100788926","DOI":"10.1137\/100788926"},{"key":"10061_CR49","doi-asserted-by":"crossref","unstructured":"Solomonik, E., Demmel, J.: Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms. In: Jeannot, E., Namyst, R., Roman, J. (eds.) Euro-Par 2011 Parallel Processing, pp. 90\u2013109. Springer, Berlin, Heidelberg (2011)","DOI":"10.1007\/978-3-642-23397-5_10"},{"key":"10061_CR50","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.laa.2015.04.021","volume":"481","author":"VY Pan","year":"2015","unstructured":"Pan, V.Y., Qian, G., Yan, X.: Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation. Linear Algebra Appl. 481, 202\u2013234 (2015). https:\/\/doi.org\/10.1016\/j.laa.2015.04.021","journal-title":"Linear Algebra Appl."},{"key":"10061_CR51","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.laa.2017.04.007","volume":"527","author":"VY Pan","year":"2017","unstructured":"Pan, V.Y., Zhao, L.: Numerically safe Gaussian elimination with no pivoting. Linear Algebra Appl. 527, 349\u2013383 (2017). https:\/\/doi.org\/10.1016\/j.laa.2017.04.007","journal-title":"Linear Algebra Appl."},{"key":"10061_CR52","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/PL00005410","volume":"86","author":"M Bebendorf","year":"2000","unstructured":"Bebendorf, M.: Approximation of boundary element matrices. Numerische Mathematik 86, 565\u2013589 (2000)","journal-title":"Numerische Mathematik"},{"issue":"4","key":"10061_CR53","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). https:\/\/doi.org\/10.1007\/s006070070031","journal-title":"Computing"},{"key":"10061_CR54","doi-asserted-by":"publisher","unstructured":"Pan, C.-T.: On the existence and computation of rank-revealing LU factorizations. Linear Algebra and its Applications 316(1), 199\u2013222 (2000). https:\/\/doi.org\/10.1016\/S0024-3795(00)00120-8. Special Issue: Conference celebrating the 60th birthday of Robert J. Plemmons","DOI":"10.1016\/S0024-3795(00)00120-8"},{"key":"10061_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0024-3795(02)00572-4","volume":"367","author":"L Miranian","year":"2003","unstructured":"Miranian, L., Gu, M.: Strong rank revealing LU factorizations. Linear Algebra Appl. 367, 1\u201316 (2003). https:\/\/doi.org\/10.1016\/S0024-3795(02)00572-4","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"10061_CR56","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."},{"key":"10061_CR57","unstructured":"Bien, J., Xu, Y., Mahoney, M.: Cur from a sparse optimization viewpoint. Annual Advances in Neural Information Processing Systems 24: Proceedings of the 2010 Conference (2010)"},{"key":"10061_CR58","unstructured":"Wang, S., Zhang, Z.: A scalable cur matrix decomposition algorithm: Lower time complexity and tighter bound. In: Proceedings of the 25th International Conference on Neural Information Processing Systems - 1. NIPS\u201912, pp. 647\u2013655. Curran Associates Inc., Red Hook, NY, USA (2012)"},{"key":"10061_CR59","doi-asserted-by":"publisher","unstructured":"Boutsidis, C., Woodruff, D.P.: Optimal cur matrix decompositions. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing. STOC \u201914, pp. 353\u2013362. Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2591796.2591819","DOI":"10.1145\/2591796.2591819"},{"issue":"2","key":"10061_CR60","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1137\/12086755X","volume":"43","author":"C Boutsidis","year":"2014","unstructured":"Boutsidis, C., Drineas, P., Magdon-Ismail, M.: Near-optimal column-based matrix reconstruction. SIAM J. Comput. 43(2), 687\u2013717 (2014)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"10061_CR61","doi-asserted-by":"publisher","first-page":"2525","DOI":"10.1016\/j.camwa.2016.09.014","volume":"72","author":"Y Aizenbud","year":"2016","unstructured":"Aizenbud, Y., Shabat, G., Averbuch, A.: Randomized LU decomposition using sparse projections. Comput. & Math. Appl. 72(9), 2525\u20132534 (2016). https:\/\/doi.org\/10.1016\/j.camwa.2016.09.014","journal-title":"Comput. & Math. Appl."},{"issue":"2","key":"10061_CR62","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.acha.2016.04.006","volume":"44","author":"G Shabat","year":"2018","unstructured":"Shabat, G., Shmueli, Y., Aizenbud, Y., Averbuch, A.: Randomized LU decomposition. Appl. Computat. Harmonic Anal. 44(2), 246\u2013272 (2018). https:\/\/doi.org\/10.1016\/j.acha.2016.04.006","journal-title":"Appl. Computat. Harmonic Anal."},{"key":"10061_CR63","doi-asserted-by":"publisher","unstructured":"Batson, J.D., Spielman, D.A., Srivastava, N.: Twice-ramanujan sparsifiers. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing. STOC \u201909, pp. 255\u2013262. Association for Computing Machinery, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1536414.1536451","DOI":"10.1145\/1536414.1536451"},{"key":"10061_CR64","unstructured":"Ho, K., Olver, S., Kelman, T., Jarlebring, E., TagBot, J., Slevinsky, M.: LowRankApprox,jl: v0.4.3. GitHub (2020)"},{"key":"10061_CR65","unstructured":"Meszaros, C.: Meszaros\/large, LP sequence: large000 to large036. http:\/\/old.sztaki.hu\/~meszaros\/public_ftp\/lptestset\/ (2004)"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-023-10061-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10444-023-10061-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-023-10061-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T07:13:32Z","timestamp":1692688412000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10444-023-10061-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":65,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["10061"],"URL":"https:\/\/doi.org\/10.1007\/s10444-023-10061-z","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"30 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"66"}}