{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T08:38:39Z","timestamp":1771490319216,"version":"3.50.1"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12461055"],"award-info":[{"award-number":["12461055"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271108"],"award-info":[{"award-number":["12271108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007156","name":"Innovation and Technology Commission - Hong Kong","doi-asserted-by":"publisher","award":["CIMDA"],"award-info":[{"award-number":["CIMDA"]}],"id":[{"id":"10.13039\/501100007156","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":[[2025,6]]},"DOI":"10.1007\/s10444-025-10232-0","type":"journal-article","created":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T11:12:33Z","timestamp":1745320353000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient algorithms for Tucker decomposition via approximate matrix multiplication"],"prefix":"10.1007","volume":"51","author":[{"given":"Maolin","family":"Che","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6192-0546","authenticated-orcid":false,"given":"Yimin","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,22]]},"reference":[{"issue":"4\u20135","key":"10232_CR1","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1561\/2200000059","volume":"9","author":"A Cichocki","year":"2016","unstructured":"Cichocki, A., Lee, N., Oseledets, I.V., Phan, A.H., Zhao, Q., Mandic, D.P.: Tensor networks for dimensionality reduction and large-scale optimization: part 1 low-rank tensor decompositions. Found. Trends Mach. Learn. 9(4\u20135), 249\u2013429 (2016)","journal-title":"Found. Trends Mach. Learn."},{"issue":"6","key":"10232_CR2","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1561\/2200000067","volume":"9","author":"A Cichocki","year":"2017","unstructured":"Cichocki, A., Lee, N., Oseledets, I.V., Phan, A.H., Zhao, Q., Mandic, D.P.: Tensor networks for dimensionality reduction and large-scale optimization: part 2 applications and future perspectives. Found. Trends Mach. Learn. 9(6), 431\u2013673 (2017)","journal-title":"Found. Trends Mach. Learn."},{"issue":"2","key":"10232_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/MSP.2013.2297439","volume":"32","author":"A Cichocki","year":"2015","unstructured":"Cichocki, A., Mandic, D.P., De Lathauwer, L., Zhou, G., Zhao, Q., Caiafa, C.F., Phan, H.A.: Tensor decompositions for signal processing applications: from two-way to multiway component analysis. IEEE Signal Process. Mag. 32(2), 145\u2013163 (2015)","journal-title":"IEEE Signal Process. Mag."},{"issue":"1","key":"10232_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/gamm.201310004","volume":"36","author":"L Grasedyck","year":"2013","unstructured":"Grasedyck, L., Kressner, D., Tobler, C.: A literature survey of low-rank tensor approximation techniques. GAMM-Mitteilungen 36(1), 53\u201378 (2013)","journal-title":"GAMM-Mitteilungen"},{"issue":"5","key":"10232_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1109\/MSP.2014.2329429","volume":"31","author":"N Vervliet","year":"2014","unstructured":"Vervliet, N., Debals, O., Sorber, L., De Lathauwer, L.: Breaking the curse of dimensionality using decompositions of incomplete tensors: tensor-based scientific computing in big data analysis. IEEE Signal Process. Mag. 31(5), 71\u201379 (2014)","journal-title":"IEEE Signal Process. Mag."},{"issue":"3","key":"10232_CR6","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF02310791","volume":"35","author":"JD Carroll","year":"1970","unstructured":"Carroll, J.D., Chang, J.-J.: Analysis of individual differences in multidimensional scaling via an n-way generalization of \u201cEckart-Young\u2019\u2019 decomposition. Psychometrika 35(3), 283\u2013319 (1970)","journal-title":"Psychometrika"},{"issue":"3","key":"10232_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker, L.R.: Some mathematical notes on three-mode factor analysis. Psychometrika 31(3), 279\u2013311 (1966)","journal-title":"Psychometrika"},{"issue":"3","key":"10232_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2538688","volume":"40","author":"D Kressner","year":"2014","unstructured":"Kressner, D., Tobler, C.: Algorithm 941: Htucker\u2013a MATLAB toolbox for tensors in hierarchical Tucker format. ACM Trans. Math. Softw. (TOMS) 40(3), 1\u201322 (2014)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"4","key":"10232_CR9","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1137\/090764189","volume":"31","author":"L Grasedyck","year":"2010","unstructured":"Grasedyck, L.: Hierarchical singular value decomposition of tensors. SIAM J. Matrix Anal. Appl. 31(4), 2029\u20132054 (2010)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"10232_CR10","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets, I.V.: Tensor-train decomposition. SIAM J. Sci. Comput. 33(5), 2295\u20132317 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"10232_CR11","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.laa.2010.09.020","volume":"435","author":"ME Kilmer","year":"2011","unstructured":"Kilmer, M.E., Martin, C.D.: Factorization strategies for third-order tensors. Linear Algebra Appl. 435(3), 641\u2013658 (2011)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"10232_CR12","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1109\/JSTSP.2021.3051503","volume":"15","author":"F Sedighin","year":"2021","unstructured":"Sedighin, F., Cichocki, A., Phan, A.-H.: Adaptive rank selection for tensor ring decomposition. IEEE J. Sel. Topics Signal Process. 15(3), 454\u2013463 (2021)","journal-title":"IEEE J. Sel. Topics Signal Process."},{"key":"10232_CR13","unstructured":"Zhao, Q., Zhou, G., Xie, S., Zhang, L., Cichocki, A.: Tensor ring decomposition. arXiv:1606.05535. (2016)"},{"key":"10232_CR14","first-page":"1","volume":"19","author":"W-J Zheng","year":"2021","unstructured":"Zheng, W.-J., Zhao, X.-L., Zheng, Y.-B., Pang, Z.-F.: Nonlocal patch-based fully connected tensor network decomposition for multispectral image inpainting. IEEE Geosci. Remote Sens. Lett. 19, 1\u20135 (2021)","journal-title":"IEEE Geosci. Remote Sens. Lett."},{"issue":"4","key":"10232_CR15","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1137\/S0895479898346995","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: On the best rank-1 and rank-$$(r_1, r_2,\\cdots , r_n)$$ approximation of higher-order tensors. SIAM J. Matrix Anal. Appl. 21(4), 1324\u20131342 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"10232_CR16","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1137\/070688316","volume":"31","author":"L Eld\u00e9n","year":"2009","unstructured":"Eld\u00e9n, L., Savas, B.: A Newton-Grassmann method for computing the best multilinear rank-$$(r_1, r_2, r_3)$$ approximation of a tensor. SIAM J. Matrix Anal. Appl. 31(2), 248\u2013271 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"10232_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1137\/090764827","volume":"32","author":"M Ishteva","year":"2011","unstructured":"Ishteva, M., Absil, P.-A., Van Huffel, S., De Lathauwer, L.: Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme. SIAM J. Matrix Anal. Appl. 32(1), 115\u2013135 (2011)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"6","key":"10232_CR18","doi-asserted-by":"publisher","first-page":"3352","DOI":"10.1137\/090763172","volume":"32","author":"B Savas","year":"2010","unstructured":"Savas, B., Lim, L.-H.: Quasi-Newton methods on Grassmannians and multilinear approximations of tensors. SIAM J. Sci. Comput. 32(6), 3352\u20133393 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"10232_CR19","unstructured":"Navasca, C., De\u00a0Lathauwer, L.: Low multilinear rank tensor approximation via semidefinite programming. In: IEEE 17th European Signal Processing Conference, pp. 520\u2013524 (2009)"},{"issue":"1","key":"10232_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/100792056","volume":"34","author":"SA Goreinov","year":"2012","unstructured":"Goreinov, S.A., Oseledets, I.V., Savostyanov, D.V.: Wedderburn rank reduction and Krylov subspace method for tensor approximation. Part 1: Tucker case. SIAM J. Sci. Comput. 34(1), 1\u201327 (2012)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"10232_CR21","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1016\/j.laa.2011.12.007","volume":"438","author":"B Savas","year":"2013","unstructured":"Savas, B., Eld\u00e9n, L.: Krylov-type methods for tensor computations I. Linear Algebra Appl. 438(2), 891\u2013918 (2013)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"10232_CR22","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0895479896305696","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21(4), 1253\u20131278 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"10232_CR23","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1137\/110836067","volume":"34","author":"N Vannieuwenhoven","year":"2012","unstructured":"Vannieuwenhoven, N., Vandebril, R., Meerbergen, K.: A new truncation strategy for the higher-order singular value decomposition. SIAM J. Sci. Comput. 34(2), 1027\u20131052 (2012)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"10232_CR24","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."},{"key":"10232_CR25","unstructured":"Zhou, G., Cichocki, A., Xie, S.: Decomposition of big tensors with low multilinear rank. arXiv:1412.1885v1 (2014)"},{"issue":"1","key":"10232_CR26","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1137\/19M1261043","volume":"2","author":"R Minster","year":"2020","unstructured":"Minster, R., Saibaba, A.K., Kilmer, M.E.: Randomized algorithms for low-rank tensor decompositions in the Tucker format. SIAM J. Math. Data Sci. 2(1), 189\u2013215 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"issue":"1","key":"10232_CR27","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10444-018-9622-8","volume":"45","author":"M Che","year":"2019","unstructured":"Che, M., Wei, Y.: Randomized algorithms for the approximations of Tucker and the tensor train decompositions. Adv. Comput. Math. 45(1), 395\u2013428 (2019)","journal-title":"Adv. Comput. Math."},{"key":"10232_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-2059-4","volume-title":"Theory and computation of complex tensors and its applications","author":"M Che","year":"2020","unstructured":"Che, M., Wei, Y.: Theory and computation of complex tensors and its applications. Springer, Singapore (2020)"},{"issue":"4","key":"10232_CR29","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1137\/19M1257718","volume":"2","author":"Y Sun","year":"2019","unstructured":"Sun, Y., Guo, Y., Luo, C., Tropp, J.A., Udell, M.: Low-rank Tucker approximation of a tensor from streaming data. SIAM J. Math. Data Sci. 2(4), 1123\u20131150 (2019)","journal-title":"SIAM J. Math. Data Sci."},{"key":"10232_CR30","doi-asserted-by":"publisher","first-page":"28684","DOI":"10.1109\/ACCESS.2021.3058103","volume":"9","author":"S Ahmadiasl","year":"2021","unstructured":"Ahmadiasl, S., Cichocki, A., Phan, A., Oseledets, I., Abukhovich, S., Tanaka, T.: Randomized algorithms for computation of Tucker decomposition and higher order SVD (HOSVD). IEEE Access 9, 28684\u201328706 (2021)","journal-title":"IEEE Access"},{"key":"10232_CR31","doi-asserted-by":"publisher","first-page":"113380","DOI":"10.1016\/j.cam.2020.113380","volume":"390","author":"M Che","year":"2021","unstructured":"Che, M., Wei, Y., Yan, H.: Randomized algorithms for the low multilinear rank approximations of tensors. J. Comput. Appl. Math. 390, 113380 (2021)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"10232_CR32","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/19M1237016","volume":"41","author":"M Che","year":"2020","unstructured":"Che, M., Wei, Y., Yan, H.: The computation of low multilinear rank approximations of tensors via power scheme and random projection. SIAM J. Matrix Anal. Appl. 41(2), 605\u2013636 (2020)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10232_CR33","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/s10915-021-01545-5","volume":"88","author":"M Che","year":"2021","unstructured":"Che, M., Wei, Y., Yan, H.: An efficient randomized algorithm for computing the approximate Tucker decomposition. J. Sci. Comput. 88, 32 (2021)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"10232_CR34","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.acha.2010.02.003","volume":"30","author":"P-G Martinsson","year":"2011","unstructured":"Martinsson, P.-G., Rokhlin, V., Tygert, M.: A randomized algorithm for the decomposition of matrices. Appl. Comput. Harmonic Anal. 30(1), 47\u201368 (2011)","journal-title":"Appl. Comput. Harmonic Anal."},{"issue":"3","key":"10232_CR35","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/080736417","volume":"31","author":"V Rokhlin","year":"2010","unstructured":"Rokhlin, V., Szlam, A., Tygert, M.: A randomized algorithm for principal component analysis. SIAM J. Matrix Anal. Appl. 31(3), 1100\u20131124 (2010)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"10232_CR36","doi-asserted-by":"publisher","first-page":"2179","DOI":"10.1002\/nla.2179","volume":"25","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Saibaba, A.K., Kilmer, M.E., Aeron, S.: A randomized tensor singular value decomposition based on the t-product. Numer. Linear Algebra Appl. 25(5), 2179 (2018)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"3","key":"10232_CR37","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"issue":"6","key":"10232_CR38","doi-asserted-by":"publisher","first-page":"2928","DOI":"10.1109\/TSP.2012.2190410","volume":"60","author":"G Zhou","year":"2012","unstructured":"Zhou, G., Cichocki, A., Xie, S.: Fast nonnegative matrix\/tensor factorization based on low-rank approximation. IEEE Trans. Signal Process. 60(6), 2928\u20132940 (2012)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2\u20133","key":"10232_CR39","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.laa.2006.08.023","volume":"420","author":"P Drineas","year":"2007","unstructured":"Drineas, P., Mahoney, M.W.: A randomized algorithm for a tensor-based generalization of the singular value decomposition. Linear Algebra Appl. 420(2\u20133), 553\u2013571 (2007)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"10232_CR40","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1137\/15M1048628","volume":"37","author":"AK Saibaba","year":"2016","unstructured":"Saibaba, A.K.: HOID: higher order interpolatory decomposition for tensors based on Tucker representation. SIAM J. Matrix Anal. Appl. 37(3), 1223\u20131249 (2016)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10232_CR41","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539704442684","volume":"36","author":"P Drineas","year":"2006","unstructured":"Drineas, P., Kanna, 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":"10232_CR42","doi-asserted-by":"crossref","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S.: Subspace sampling and relative-error matrix approximation: column-based methods. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 316\u2013326. Springer, Barcelona, Spain (2006)","DOI":"10.1007\/11830924_30"},{"issue":"1","key":"10232_CR43","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.S., Wang, G.: Matrix approximation and projective clustering via volume sampling. Theory Comput. 2(1), 225\u2013247 (2006)","journal-title":"Theory Comput."},{"issue":"1","key":"10232_CR44","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(1), 2729\u20132769 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"10232_CR45","doi-asserted-by":"crossref","unstructured":"Chang, W.-T., Tandon, R.: Random sampling for distributed coded matrix multiplication. In: ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 8187\u20138191 (2019)","DOI":"10.1109\/ICASSP.2019.8682895"},{"issue":"4","key":"10232_CR46","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1137\/10080659X","volume":"33","author":"S Eriksson-Bique","year":"2011","unstructured":"Eriksson-Bique, S., Solbrig, M., Stefanelli, M., Warkentin, S., Abbey, R., Ipsen, I.C.: Importance sampling for a Monte Carlo matrix multiplication algorithm, with application to information retrieval. SIAM J. Sci. Comput. 33(4), 1689\u20131706 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"10232_CR47","doi-asserted-by":"publisher","first-page":"115063","DOI":"10.1016\/j.cam.2023.115063","volume":"425","author":"C Niu","year":"2023","unstructured":"Niu, C., Li, H.: Optimal sampling algorithms for block matrix multiplication. J. Comput. Appl. Math. 425, 115063 (2023)","journal-title":"J. Comput. Appl. Math."},{"issue":"5","key":"10232_CR48","doi-asserted-by":"publisher","first-page":"2731","DOI":"10.1137\/19M125604X","volume":"42","author":"Y Wu","year":"2020","unstructured":"Wu, Y., Polydorides, N.: A multilevel Monte Carlo estimator for matrix multiplication. SIAM J. Sci. Comput. 42(5), 2731\u20132749 (2020)","journal-title":"SIAM J. Sci. Comput."},{"key":"10232_CR49","unstructured":"Cohen, M.B., Nelson, J., Woodruff, D.P.: Optimal approximate matrix product in terms of stable rank. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Editors: Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi. Leibniz International Proceedings in Informatics. Article No. 11; pp. 11:1\u201311:14, (2016)"},{"issue":"1","key":"10232_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.acha.2014.02.001","volume":"38","author":"A Eftekhari","year":"2015","unstructured":"Eftekhari, A., Yap, H.L., Rozell, C.J., Wakin, M.B.: The restricted isometry property for random block diagonal matrices. Appl. Comput. Harmonic Anal. 38(1), 1\u201331 (2015)","journal-title":"Appl. Comput. Harmonic Anal."},{"key":"10232_CR51","unstructured":"Srinivasa, R.S., Davenport, M.A., Romberg, J.: Localized sketching for matrix multiplication and ridge regression. arXiv:2003.09097. (2020)"},{"issue":"4","key":"10232_CR52","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1137\/17M1111590","volume":"38","author":"JA Tropp","year":"2017","unstructured":"Tropp, J.A., Yurtsever, A., Udell, M., Cevher, V.: Practical sketching algorithms for low-rank matrix approximation. SIAM J. Matrix Anal. Appl. 38(4), 1454\u20131485 (2017)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"10232_CR53","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/090779656","volume":"33","author":"E Coakley","year":"2011","unstructured":"Coakley, E., Rokhlin, V., Tygert, M.: A fast randomized algorithm for orthogonal projection. SIAM J. Sci. Comput. 33(2), 849\u2013868 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"10232_CR54","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.aim.2004.08.004","volume":"195","author":"AE Litvak","year":"2005","unstructured":"Litvak, A.E., Pajor, A., Rudelson, M., Tomczakjaegermann, N.: Smallest singular value of random matrices and geometry of random polytopes. Adv. Math. 195(2), 491\u2013523 (2005)","journal-title":"Adv. Math."},{"issue":"12","key":"10232_CR55","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1002\/cpa.20294","volume":"62","author":"M Rudelson","year":"2009","unstructured":"Rudelson, M., Vershynin, R.: Smallest singular value of a random rectangular matrix. Commun. Pure Appl. Math. 62(12), 1707\u20131739 (2009)","journal-title":"Commun. Pure Appl. Math."},{"key":"10232_CR56","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.acha.2016.04.006","volume":"44","author":"G Shabat","year":"2016","unstructured":"Shabat, G., Shmueli, Y., Aizenbud, Y., Averbuch, A.: Randomized LU decomposition. Appl. Comput. Harmonic Anal. 44, 246\u2013272 (2016)","journal-title":"Appl. Comput. Harmonic Anal."},{"issue":"2","key":"10232_CR57","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1109\/TIT.2014.2375327","volume":"61","author":"C Boutsidis","year":"2014","unstructured":"Boutsidis, C., Zouzias, A., Mahoney, M.W., Drineas, P.: Randomized dimensionality reduction for $$ k $$-means clustering. IEEE Trans. Inf. Theory 61(2), 1045\u20131062 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"10232_CR58","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)","journal-title":"Comput. Math. Appl."},{"issue":"3","key":"10232_CR59","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. Harmonic Anal. 25(3), 335\u2013366 (2008)","journal-title":"Appl. Comput. Harmonic Anal."},{"issue":"3","key":"10232_CR60","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1137\/130938700","volume":"37","author":"M Gu","year":"2015","unstructured":"Gu, M.: Subspace iteration randomization and singular value problems. SIAM J. Sci. Comput. 37(3), 1139\u20131173 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"10232_CR61","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1145\/1186785.1186794","volume":"32","author":"BW Bader","year":"2006","unstructured":"Bader, B.W., Kolda, T.G.: Algorithm 862: Matlab tensor classes for fast algorithm prototyping. ACM Trans. Math. Softw. (TOMS) 32(4), 635\u2013653 (2006)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"10232_CR62","unstructured":"Bader, B.W., Kolda, T.G.: MATLAB Tensor Toolbox Version 3.2.1. Available online. https:\/\/www.tensortoolbox.org (2021)"},{"key":"10232_CR63","unstructured":"Vervliet, N., Debals, O., Sorber, L., Van\u00a0Barel, M., De\u00a0Lathauwer, L.: Tensorlab 3.0. http:\/\/tensorlab.net (2016)"},{"issue":"3","key":"10232_CR64","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.laa.2010.03.020","volume":"433","author":"CF Caiafa","year":"2010","unstructured":"Caiafa, C.F., Cichocki, A.: Generalizing the column-row matrix decomposition to multi-way arrays. Linear Algebra Appl. 433(3), 557\u2013573 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"6","key":"10232_CR65","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/34.927464","volume":"23","author":"AS Georghiades","year":"2001","unstructured":"Georghiades, A.S., Belhumeur, P.N., Kriegman, D.: From few to many: illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Mach. Intell. 23(6), 643\u2013660 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"10232_CR66","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1137\/15M1026080","volume":"38","author":"P-G Martinsson","year":"2016","unstructured":"Martinsson, P.-G., Voronin, S.: A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices. SIAM J. Sci. Comput. 38(5), 485\u2013507 (2016)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"10232_CR67","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1137\/17M1141977","volume":"39","author":"W Yu","year":"2018","unstructured":"Yu, W., Gu, Y., Li, Y.: Efficient randomized algorithms for the fixed-precision low-rank matrix approximation. SIAM J. Matrix Anal. Appl. 39(3), 1339\u20131359 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10232_CR68","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.apnum.2024.03.004","volume":"201","author":"C Xiao","year":"2024","unstructured":"Xiao, C., Yang, C.: RA-HOOI: Rank-adaptive higher-order orthogonal iteration for the fixed-accuracy low multilinear-rank approximation of tensors. Appl. Numer. Math. 201, 290\u2013300 (2024)","journal-title":"Appl. Numer. Math."},{"key":"10232_CR69","unstructured":"Hashemi, B., Nakatsukasa, Y.: RTSMS: Randomized Tucker with single-mode sketching. arXiv:2311.14873. (2023)"},{"key":"10232_CR70","doi-asserted-by":"crossref","unstructured":"Che, M., Wei, Y., Yan, H.: Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition. SIAM J. Matrix Anal. Appl. 46(1), 256\u2013297 (2025)","DOI":"10.1137\/23M1594066"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-025-10232-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10444-025-10232-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-025-10232-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T04:02:24Z","timestamp":1750737744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10444-025-10232-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,22]]},"references-count":70,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["10232"],"URL":"https:\/\/doi.org\/10.1007\/s10444-025-10232-0","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,22]]},"assertion":[{"value":"31 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2025","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":"20"}}