{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T09:56:53Z","timestamp":1775123813925,"version":"3.50.1"},"reference-count":87,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T00:00:00Z","timestamp":1771372800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T00:00:00Z","timestamp":1771372800000},"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":["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":["InnoHK Project CIMDA"],"award-info":[{"award-number":["InnoHK Project CIMDA"]}],"id":[{"id":"10.13039\/501100007156","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s10915-026-03208-9","type":"journal-article","created":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T19:49:34Z","timestamp":1771444174000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Randomized Algorithms for Computing an Approximation of the Tensor Train Decomposition"],"prefix":"10.1007","volume":"107","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":[[2026,2,18]]},"reference":[{"key":"3208_CR1","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"},{"issue":"1","key":"3208_CR2","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/060673096","volume":"39","author":"N Ailon","year":"2009","unstructured":"Ailon, N., Chazelle, B.: The fast Johnson-Lindenstrauss transform and approximate nearest neighbors. SIAM J. Comput. 39(1), 302\u2013322 (2009)","journal-title":"SIAM J. Comput."},{"key":"3208_CR3","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, 2525\u20132534 (2016)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"3208_CR4","doi-asserted-by":"publisher","first-page":"A74","DOI":"10.1137\/21M1451191","volume":"45","author":"H Al Daas","year":"2023","unstructured":"Al Daas, H., Ballard, G., Cazeaux, P., Hallman, E., Mi\u0229dlar, A., Pasha, M., Reid, T.W., Saibaba, A.K.: Randomized algorithms for rounding in the tensor-train format. SIAM J. Sci. Comput. 45(1), A74\u2013A95 (2023)","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"3208_CR5","doi-asserted-by":"publisher","first-page":"A3516","DOI":"10.1137\/20M131936X","volume":"42","author":"N Alger","year":"2020","unstructured":"Alger, N., Chen, P., Ghattas, O.: Tensor train construction from tensor actions, with application to compression of large high order derivative tensors. SIAM J. Sci. Comput. 42(5), A3516\u2013A3539 (2020)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"3208_CR6","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1137\/090767911","volume":"32","author":"H Avron","year":"2010","unstructured":"Avron, H., Maymounkov, P., Toledo, S.: Blendenpik: Supercharging lapack\u2019s least-squares solver. SIAM J. Sci. Comput. 32(3), 1217\u20131236 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"3208_CR7","unstructured":"Bader, B.W., Kolda, T.G., et\u00a0al.: Matlab tensor toolbox version 3.0-dev. Available online (2017). https:\/\/www.tensortoolbox.org"},{"issue":"2","key":"3208_CR8","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/j.laa.2011.08.010","volume":"438","author":"J Ballani","year":"2013","unstructured":"Ballani, J., Grasedyck, L., Kluge, M.: Black box approximation of tensors in Hierarchical Tucker format. Linear Algebra Appl. 438(2), 639\u2013657 (2013)","journal-title":"Linear Algebra Appl."},{"key":"3208_CR9","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1137\/17M1112303","volume":"39","author":"C Battaglino","year":"2018","unstructured":"Battaglino, C., Ballard, G., Kolda, T.G.: A practical randomized CP tensor decomposition. SIAM J. Matrix Anal. Appl. 39, 876\u2013901 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"3208_CR10","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1109\/TIP.2017.2672439","volume":"26","author":"JA Bengua","year":"2017","unstructured":"Bengua, J.A., Phien, H.N., Tuan, H.D., Do, M.N.: Efficient tensor completion for color image and video recovery: Low-rank tensor train. IEEE Trans. Image Process. 26(5), 2466\u20132479 (2017)","journal-title":"IEEE Trans. Image Process."},{"key":"3208_CR11","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.jcp.2014.10.009","volume":"281","author":"D Biagioni","year":"2015","unstructured":"Biagioni, D., Beylkin, D.J., Beylkin, G.: Randomized interpolative decomposition of separated representations. J. Comput. Phys. 281, 116\u2013134 (2015)","journal-title":"J. Comput. Phys."},{"issue":"4","key":"3208_CR12","doi-asserted-by":"publisher","first-page":"A2355","DOI":"10.1137\/18M118966X","volume":"41","author":"EK Bjarkason","year":"2019","unstructured":"Bjarkason, E.K.: Pass-efficient randomized algorithms for low-rank matrix approximation using any number of views. SIAM J. Sci. Comput. 41(4), A2355\u2013A2383 (2019)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"3208_CR13","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1137\/120874540","volume":"34","author":"C Boutsidis","year":"2013","unstructured":"Boutsidis, C., Gittens, A.: Improved matrix algorithms via the subsampled randomized Hadamard transform. SIAM J. Matrix Anal. Appl. 34(3), 1301\u20131340 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3208_CR14","unstructured":"Cai, J.F., Huang, W., Wang, H., Wei, K.: Tensor completion via tensor train based low-rank quotient geometry under a preconditioned metric. arXiv preprint arXiv:2209.04786 (2022)"},{"issue":"3","key":"3208_CR15","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":"3","key":"3208_CR16","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF02310791","volume":"35","author":"JD Carroll","year":"1970","unstructured":"Carroll, J.D., Chang, 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":"1","key":"3208_CR17","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."},{"issue":"2","key":"3208_CR18","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 for 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":"3208_CR19","doi-asserted-by":"crossref","unstructured":"Che, M., Wei, Y., Yan, H.: Randomized algorithms for the low multilinear rank approximations of tensors. Journal of Computational and Applied Mathematics 390 (2021). Article no. 113380","DOI":"10.1016\/j.cam.2020.113380"},{"issue":"3","key":"3208_CR20","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s10444-025-10232-0","volume":"51","author":"M Che","year":"2025","unstructured":"Che, M., Wei, Y., Yan, H.: Efficient algorithms for Tucker decomposition via approximate matrix multiplication. Adv. Comput. Math. 51(3), 20 (2025)","journal-title":"Adv. Comput. Math."},{"issue":"1","key":"3208_CR21","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/23M1594066","volume":"46","author":"M Che","year":"2025","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)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3208_CR22","doi-asserted-by":"crossref","unstructured":"Chen, C., Batselier, K., Ko, C.Y., Wong, N.: A support tensor train machine. In: 2019 International Joint Conference on Neural Networks (IJCNN), pp. 1\u20138. IEEE (2019)","DOI":"10.1109\/IJCNN.2019.8851985"},{"key":"3208_CR23","doi-asserted-by":"crossref","unstructured":"Chen, C., Batselier, K., Yu, W., Wong, N.: Kernelized support tensor train machines. Pattern Recognition 122, Article no. 108337 (2022)","DOI":"10.1016\/j.patcog.2021.108337"},{"key":"3208_CR24","doi-asserted-by":"crossref","unstructured":"Cichocki, A., Zdunek, R., Phan, A.H., Amari, S.i.: Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation. John Wiley & Sons (2009)","DOI":"10.1002\/9780470747278"},{"key":"3208_CR25","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Low rank approximation and regression in input sparsity time. in: Proceedings of the 45th Annual ACM Symposium on Theory of Computing pp. 81\u201390 (2013)","DOI":"10.1145\/2488608.2488620"},{"issue":"1","key":"3208_CR26","doi-asserted-by":"publisher","first-page":"C25","DOI":"10.1137\/20M1387158","volume":"44","author":"HA Daas","year":"2022","unstructured":"Daas, H.A., Ballard, G., Benner, P.: Parallel algorithms for tensor train arithmetic. SIAM J. Sci. Comput. 44(1), C25\u2013C53 (2022)","journal-title":"SIAM J. Sci. Comput."},{"issue":"9","key":"3208_CR27","doi-asserted-by":"publisher","first-page":"2672","DOI":"10.1109\/TNNLS.2018.2885616","volume":"30","author":"R Dian","year":"2019","unstructured":"Dian, R., Li, S., Fang, L.: Learning a low tensor-train rank representation for hyperspectral image super-resolution. IEEE Transactions on Neural Networks and Learning Systems 30(9), 2672\u20132683 (2019)","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"2","key":"3208_CR28","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1007\/s10915-019-01044-8","volume":"81","author":"M Ding","year":"2019","unstructured":"Ding, M., Huang, T.Z., Ji, T.Y., Zhao, X.L., Yang, J.H.: Low-rank tensor completion using matrix factorization based on tensor train rank and total variation. J. Sci. Comput. 81(2), 941\u2013964 (2019)","journal-title":"J. Sci. Comput."},{"key":"3208_CR29","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1137\/120882597","volume":"2","author":"S Dolgov","year":"2013","unstructured":"Dolgov, S., Khoromskij, B.: Two-level QTT-Tucker format for optimized tensor calculus. SIAM J. Matrix Anal. Appl. 2, 593\u2013623 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"3208_CR30","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1016\/j.cpc.2013.12.017","volume":"185","author":"SV Dolgov","year":"2014","unstructured":"Dolgov, S.V., Khoromskij, B.N., Oseledets, I.V., Savostyanov, D.V.: Computation of extreme eigenvalues in higher dimensions using block tensor train format. Comput. Phys. Commun. 185(4), 1207\u20131216 (2014)","journal-title":"Comput. Phys. Commun."},{"issue":"6","key":"3208_CR31","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/2842602","volume":"59","author":"P Drineas","year":"2016","unstructured":"Drineas, P., Mahoney, M.W.: RandNLA: randomized numerical linear algebra. Comm. ACM 59(6), 80\u201390 (2016)","journal-title":"Comm. ACM"},{"issue":"1","key":"3208_CR32","doi-asserted-by":"publisher","first-page":"A139","DOI":"10.1137\/19M128689X","volume":"43","author":"V Ehrlacher","year":"2021","unstructured":"Ehrlacher, V., Grigori, L., Lombardi, D., Song, H.: Adaptive hierarchical subtensor partitioning for tensor compression. SIAM J. Sci. Comput. 43(1), A139\u2013A163 (2021)","journal-title":"SIAM J. Sci. Comput."},{"key":"3208_CR33","unstructured":"Epperly, E.N., Tropp, J.A.: Efficient error and variance estimation for randomized matrix computations. arXiv preprint arXiv:2207.06342 (2022)"},{"key":"3208_CR34","doi-asserted-by":"crossref","unstructured":"Erichson, N.B., Manohar, K., Brunton, S.L., Kutz, J.N.: Randomized CP tensor decomposition. Machine Learning: Science and Technology (2020). Article 025012","DOI":"10.1088\/2632-2153\/ab8240"},{"issue":"4","key":"3208_CR35","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":"1","key":"3208_CR36","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":"3208_CR37","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1007\/s00041-009-9094-9","volume":"15","author":"W Hackbusch","year":"2009","unstructured":"Hackbusch, W., K\u00fchn, S.: A new scheme for the tensor representation. The Journal of Fourier Analysis and Applications 15(5), 706\u2013722 (2009)","journal-title":"The Journal of Fourier Analysis and Applications"},{"issue":"2","key":"3208_CR38","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":"4","key":"3208_CR39","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1016\/j.cam.2010.06.016","volume":"235","author":"ME Hochstenbach","year":"2010","unstructured":"Hochstenbach, M.E., Reichel, L.: Subspace-restricted singular value decompositions for linear discrete ill-posed problems. J. Comput. Appl. Math. 235(4), 1053\u20131064 (2010)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"3208_CR40","doi-asserted-by":"publisher","first-page":"A683","DOI":"10.1137\/100818893","volume":"34","author":"S Holtz","year":"2012","unstructured":"Holtz, S., Rohwedder, T., Schneider, R.: The alternating linear scheme for tensor optimization in the tensor train format. SIAM J. Sci. Comput. 34(2), A683\u2013A713 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"3208_CR41","doi-asserted-by":"crossref","unstructured":"Huber, B., Schneider, R., Wolf, S.: A randomized tensor train singular value decomposition. In: Compressed Sensing and its Applications: Second International MATHEON Conference 2015, pp. 261\u2013290. Springer (2017)","DOI":"10.1007\/978-3-319-69802-1_9"},{"issue":"11","key":"3208_CR42","doi-asserted-by":"publisher","first-page":"4204","DOI":"10.1016\/j.laa.2013.01.009","volume":"438","author":"V Kazeer","year":"2013","unstructured":"Kazeer, V., Reichmann, O., Schwab, C.: Low-rank tensor structure of linear diffusion operators in the TT and QTT formats. Linear Algebra Appl. 438(11), 4204\u20134221 (2013)","journal-title":"Linear Algebra Appl."},{"key":"3208_CR43","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00365-011-9131-1","volume":"34","author":"BN Khoromskij","year":"2011","unstructured":"Khoromskij, B.N.: $${O}(d\\log n)$$-quantics approximation of n-d tensors in high-dimensional numerical modeling. Constr. Approx. 34, 257\u2013280 (2011)","journal-title":"Constr. Approx."},{"key":"3208_CR44","doi-asserted-by":"publisher","first-page":"6918","DOI":"10.1109\/TIP.2020.2995061","volume":"29","author":"CY Ko","year":"2020","unstructured":"Ko, C.Y., Batselier, K., Daniel, L., Yu, W., Wong, N.: Fast and accurate tensor completion with total variation regularized tensor trains. IEEE Trans. Image Process. 29, 6918\u20136931 (2020)","journal-title":"IEEE Trans. Image Process."},{"issue":"3","key":"3208_CR45","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":"4","key":"3208_CR46","first-page":"1","volume":"24","author":"K Kour","year":"2023","unstructured":"Kour, K., Dolgov, S., Stoll, M., Benner, P.: Efficient structure-preserving support tensor train machine. J. Mach. Learn. Res. 24(4), 1\u201322 (2023)","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"3208_CR47","doi-asserted-by":"publisher","first-page":"A1879","DOI":"10.1137\/16M1093896","volume":"39","author":"D Kressner","year":"2017","unstructured":"Kressner, D., Perisa, L.: Recompression of Hadamard products of tensors in Tucker format. SIAM J. Sci. Comput. 39(5), A1879\u2013A1902 (2017)","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"3208_CR48","doi-asserted-by":"publisher","first-page":"A2346","DOI":"10.1137\/130949919","volume":"36","author":"D Kressner","year":"2014","unstructured":"Kressner, D., Steinlechner, M., Uschmajew, A.: Low-rank tensor methods with subspace correction for symmetric eigenvalue problems. SIAM J. Sci. Comput. 36(5), A2346\u2013A2368 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"3208_CR49","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10543-013-0455-z","volume":"54","author":"D Kressner","year":"2014","unstructured":"Kressner, D., Steinlechner, M., Vandereycken, B.: Low-rank tensor completion by Riemannian optimization. BIT Numer. Math. 54, 447\u2013468 (2014)","journal-title":"BIT Numer. Math."},{"issue":"5","key":"3208_CR50","doi-asserted-by":"publisher","first-page":"A2610","DOI":"10.1137\/22M1515045","volume":"45","author":"D Kressner","year":"2023","unstructured":"Kressner, D., Vandereycken, B., Voorhaar, R.: Streaming tensor train approximation. SIAM J. Sci. Comput. 45(5), A2610\u2013A2631 (2023)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"3208_CR51","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1137\/140983410","volume":"36","author":"N Lee","year":"2015","unstructured":"Lee, N., Cichocki, A.: Estimating a few extreme singular values and vectors for large-scale matrices in tensor train format. SIAM J. Matrix Anal. Appl. 36(3), 994\u20131014 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3208_CR52","doi-asserted-by":"crossref","unstructured":"Lestandi, L.: Numerical study of low rank approximation methods for mechanics data and analysis. Journal of Scientific Computing 87 (2021). Article no. 14","DOI":"10.1007\/s10915-021-01421-2"},{"key":"3208_CR53","doi-asserted-by":"crossref","unstructured":"Li, L., Yu, W., Batselier, K.: Faster tensor train decomposition for sparse data. Journal of Computational and Applied Mathematics 405, Article no. 113972 (2022)","DOI":"10.1016\/j.cam.2021.113972"},{"issue":"2","key":"3208_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., Tomczak-Jaegermann, N.: Smallest singular value of random matrices and geometry of random polytopes. Adv. Math. 195(2), 491\u2013523 (2005)","journal-title":"Adv. Math."},{"key":"3208_CR55","unstructured":"Lopes, M.E., Erichson, N.B., Mahoney, M.W.: Error estimation for sketched svd via the bootstrap. In: International Conference on Machine Learning, pp. 6382\u20136392. PMLR (2020)"},{"key":"3208_CR56","unstructured":"Lopes, M.E., Wang, S., Mahoney, M.W.: Error estimation for randomized least-squares algorithms via the bootstrap. In: International Conference on Machine Learning, pp. 3217\u20133226. PMLR (2018)"},{"issue":"1","key":"3208_CR57","first-page":"1434","volume":"20","author":"ME Lopes","year":"2019","unstructured":"Lopes, M.E., Wang, S., Mahoney, M.W.: A bootstrap method for error estimation in randomized matrix multiplication. The Journal of Machine Learning Research 20(1), 1434\u20131473 (2019)","journal-title":"The Journal of Machine Learning Research"},{"key":"3208_CR58","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1561\/2200000035","volume":"3","author":"MW Mahoney","year":"2011","unstructured":"Mahoney, M.W.: Randomized algorithms for matrices and data. Foundations and Trends in Machine Learning 3, 123\u2013224 (2011)","journal-title":"Foundations and Trends in Machine Learning"},{"key":"3208_CR59","doi-asserted-by":"crossref","unstructured":"Malik, O.A., Becker, S.: Fast randomized matrix and tensor interpolative decomposition using CountSketch. Advances in Computational Mathematics 46 (2020). Article 76","DOI":"10.1007\/s10444-020-09816-9"},{"issue":"1","key":"3208_CR60","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.acha.2010.02.003","volume":"30","author":"PG Martinsson","year":"2011","unstructured":"Martinsson, P.G., Rokhlin, V., Tygert, M.: A randomized algorithm for the decomposition of matrices. Appl. Comput. Harmon. Anal. 30(1), 47\u201368 (2011)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"5","key":"3208_CR61","doi-asserted-by":"publisher","first-page":"S485","DOI":"10.1137\/15M1026080","volume":"38","author":"PG 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), S485\u2013S507 (2016)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"3208_CR62","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 Journal on Mathematics of Data Science 2(1), 189\u2013215 (2020)","journal-title":"SIAM Journal on Mathematics of Data Science"},{"key":"3208_CR63","volume-title":"Columbia object image library (COIL-100)","author":"SA Nene","year":"1996","unstructured":"Nene, S.A., Nayar, S.K., Murase, H.: Columbia object image library (COIL-100). Columbia University, New York, NY, USA, Tech. Rep (1996)"},{"issue":"5","key":"3208_CR64","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."},{"key":"3208_CR65","unstructured":"Oseledets, I.V.: TT-toolbox 2.2. Available online (2012). http:\/\/github.com\/oseledets\/TT-toolbox"},{"issue":"5","key":"3208_CR66","doi-asserted-by":"publisher","first-page":"A2718","DOI":"10.1137\/110833142","volume":"34","author":"IV Oseledets","year":"2012","unstructured":"Oseledets, I.V., Dolgov, S.V.: Solution of linear systems and matrix inversion in the TT-format. SIAM J. Sci. Comput. 34(5), A2718\u2013A2739 (2012)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"3208_CR67","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.laa.2009.07.024","volume":"432","author":"IV Oseledets","year":"2010","unstructured":"Oseledets, I.V., Tyrtyshnikov, E.E.: TT-cross approximation for multidimensional arrays. Linear Algebra Appl. 432(1), 70\u201388 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"3208_CR68","doi-asserted-by":"publisher","first-page":"C287","DOI":"10.1137\/21M1395545","volume":"44","author":"M R\u00f6hrig-Z\u00f6llner","year":"2022","unstructured":"R\u00f6hrig-Z\u00f6llner, M., Thies, J., Basermann, A.: Performance of the low-rank TT-SVD for large dense tensors on modern multicore CPUs. SIAM J. Sci. Comput. 44(4), C287\u2013C309 (2022)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"3208_CR69","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":"12","key":"3208_CR70","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":"3208_CR71","doi-asserted-by":"crossref","unstructured":"Savostyanov, D., Oseledets, I.V.: Fast adaptive interpolation of multi-dimensional arrays in tensor train format. In: the 2011 International Workshop on Multidimensional (nD) Systems, pp. 1\u20138 (2011)","DOI":"10.1109\/nDS.2011.6076873"},{"key":"3208_CR72","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. Harm. Anal. 44, 246\u2013272 (2016)","journal-title":"Appl. Comput. Harm. Anal."},{"issue":"3","key":"3208_CR73","doi-asserted-by":"publisher","first-page":"C101","DOI":"10.1137\/21M146079X","volume":"45","author":"T Shi","year":"2023","unstructured":"Shi, T., Ruth, M., Townsend, A.: Parallel algorithms for computing the tensor-train decomposition. SIAM J. Sci. Comput. 45(3), C101\u2013C130 (2023)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"3208_CR74","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1137\/19M1257718","volume":"2","author":"Y Sun","year":"2020","unstructured":"Sun, Y., Guo, Y., Luo, C., Tropp, J.A., Udell, M.: Low-rank Tucker approximation of a tensor from streaming data. SIAM Journal on Mathematics of Data Science 2(4), 1123\u20131150 (2020)","journal-title":"SIAM Journal on Mathematics of Data Science"},{"issue":"3","key":"3208_CR75","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":"2","key":"3208_CR76","doi-asserted-by":"publisher","first-page":"A1027","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), A1027\u2013A1052 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"3208_CR77","doi-asserted-by":"crossref","unstructured":"Vershynin, R.: Introduction to the non-asymptotic analysis of random matrices. In: Y.C. Eldar, G.\u00a0Kutyniok (eds.) Compressed Sensing: Theory and Practice, pp. 210\u2013268. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511794308.006"},{"issue":"2","key":"3208_CR78","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/JSTSP.2015.2503260","volume":"10","author":"N Vervliet","year":"2016","unstructured":"Vervliet, N., De Lathauwer, L.: A randomized block sampling approach to canonical polyadic decomposition of large-scale tensors. IEEE Journal of Selected Topics in Signal Processing 10(2), 284\u2013295 (2016)","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"issue":"4","key":"3208_CR79","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3323926","volume":"3","author":"X Wang","year":"2019","unstructured":"Wang, X., Yang, L.T., Wang, Y., Liu, X., Zhang, Q., Deen, M.J.: A distributed tensor-train decomposition method for cyber-physical-social services. ACM Transactions on Cyber-Physical Systems 3(4), 1\u201315 (2019)","journal-title":"ACM Transactions on Cyber-Physical Systems"},{"issue":"3","key":"3208_CR80","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1109\/TII.2020.2967768","volume":"17","author":"X Wang","year":"2020","unstructured":"Wang, X., Yang, L.T., Wang, Y., Ren, L., Deen, M.J.: ADTT: A highly efficient distributed tensor-train decomposition method for IIoT big data. IEEE Trans. Industr. Inf. 17(3), 1573\u20131582 (2020)","journal-title":"IEEE Trans. Industr. Inf."},{"key":"3208_CR81","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000060","volume":"10","author":"DP Woodruff","year":"2014","unstructured":"Woodruff, D.P.: Sketching as a tool for numerical linear algebra. Foundations and Trends in Theoretical Computer Science 10, 1\u2013157 (2014)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"issue":"3","key":"3208_CR82","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."},{"key":"3208_CR83","first-page":"448","volume":"3","author":"C Yin","year":"2021","unstructured":"Yin, C., Acun, B., Wu, C.J., Liu, X.: TT-rec: Tensor train compression for deep learning recommendation models. Proceedings of Machine Learning and Systems 3, 448\u2013462 (2021)","journal-title":"Proceedings of Machine Learning and Systems"},{"issue":"3","key":"3208_CR84","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":"3208_CR85","first-page":"53","volume":"73","author":"L Yuan","year":"2019","unstructured":"Yuan, L., Zhao, Q., Gui, L., Cao, J.: High-order tensor completion via gradient-based optimization under tensor train format. Signal Processing: Image Communication 73, 53\u201361 (2019)","journal-title":"Signal Processing: Image Communication"},{"key":"3208_CR86","unstructured":"Zhou, G., Cichocki, A., Xie, S.: Decomposition of big tensors with low multilinear rank. arXiv preprint arXiv:1412.1885v1 (2014)"},{"issue":"6","key":"3208_CR87","doi-asserted-by":"publisher","first-page":"3991","DOI":"10.1109\/TIT.2022.3152733","volume":"68","author":"Y Zhou","year":"2022","unstructured":"Zhou, Y., Zhang, A.R., Zheng, L., Wang, Y.: Optimal high-order tensor SVD via tensor-train orthogonal iteration. IEEE Trans. Inf. Theory 68(6), 3991\u20134019 (2022)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03208-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-026-03208-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03208-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T09:02:35Z","timestamp":1775120555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-026-03208-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,18]]},"references-count":87,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["3208"],"URL":"https:\/\/doi.org\/10.1007\/s10915-026-03208-9","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,18]]},"assertion":[{"value":"26 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2026","order":4,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"2"}}