{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T08:22:16Z","timestamp":1771662136556,"version":"3.50.1"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T00:00:00Z","timestamp":1658966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T00:00:00Z","timestamp":1658966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901471"],"award-info":[{"award-number":["11901471"]}],"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":["11771099"],"award-info":[{"award-number":["11771099"]}],"id":[{"id":"10.13039\/501100001809","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":[[2022,9]]},"DOI":"10.1007\/s10915-022-01956-y","type":"journal-article","created":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T15:28:35Z","timestamp":1659022115000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["An Efficient Algorithm for Computing the Approximate t-URV and its Applications"],"prefix":"10.1007","volume":"92","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":[]}],"member":"297","published-online":{"date-parts":[[2022,7,28]]},"reference":[{"key":"1956_CR1","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, 302\u2013322 (2009)","journal-title":"SIAM J. Comput."},{"key":"1956_CR2","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."},{"key":"1956_CR3","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."},{"key":"1956_CR4","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, 1301\u20131340 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1956_CR5","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1137\/140977898","volume":"46","author":"C Boutsidis","year":"2017","unstructured":"Boutsidis, C., Woodruff, D.: Optimal CUR matrix decompositions. SIAM J. Comput. 46, 543\u2013589 (2017)","journal-title":"SIAM J. Comput."},{"key":"1956_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM (JACM) 58, 1\u201337 (2011)","journal-title":"J. ACM (JACM)"},{"key":"1956_CR7","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"key":"1956_CR8","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, 283\u2013319 (1970)","journal-title":"Psychometrika"},{"key":"1956_CR9","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1137\/S0895479891223781","volume":"15","author":"S Chandrasekaran","year":"1994","unstructured":"Chandrasekaran, S., Ipsen, I.: On rank revealing QR factorizations. SIAM J. Matrix Anal. Appl. 15, 592\u2013622 (1994)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1956_CR10","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, 395\u2013428 (2019)","journal-title":"Adv. Comput. Math."},{"key":"1956_CR11","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, 605\u2013636 (2020)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1956_CR12","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."},{"key":"1956_CR13","doi-asserted-by":"publisher","unstructured":"Che, M., Wei, Y., Yan, H.: Randomized algorithms for the computation of multilinear rank-($$\\mu _1,\\mu _2,\\mu _3$$) approximations. J. Global Optim. (2022). https:\/\/doi.org\/10.1007\/s10898-022-01182-8","DOI":"10.1007\/s10898-022-01182-8"},{"key":"1956_CR14","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1109\/JSTSP.2018.2873148","volume":"12","author":"Y Chen","year":"2018","unstructured":"Chen, Y., Wang, S., Zhou, Y.: Tensor nuclear norm-based low-rank approximation with total variation regularization. IEEE J. Sel. Top. Signal Processing 12, 1364\u20131377 (2018)","journal-title":"IEEE J. Sel. Top. Signal Processing"},{"key":"1956_CR15","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. Foundations and Trends in Machine. Learning 9, 249\u2013429 (2016)","journal-title":"Foundations and Trends in Machine. Learning"},{"key":"1956_CR16","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. Foundations and Trends in Machine. Learning 9, 431\u2013673 (2017)","journal-title":"Foundations and Trends in Machine. Learning"},{"key":"1956_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3019134","volume":"63","author":"KL Clarkson","year":"2017","unstructured":"Clarkson, K.L., Woodruff, D.P.: Low-rank approximation and regression in input sparsity time. J. ACM (JACM) 63, 1\u201345 (2017)","journal-title":"J. ACM (JACM)"},{"key":"1956_CR18","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, 1253\u20131278 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1956_CR19","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1137\/07070471X","volume":"30","author":"P Drineas","year":"2008","unstructured":"Drineas, P., Mahoney, M., Muthukrishnan, S.: Relative-error CUR matrix decompositions. SIAM J. Matrix Anal. Appl. 30, 844\u2013881 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1956_CR20","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. Commun. ACM 59, 80\u201390 (2016)","journal-title":"Commun. ACM"},{"key":"1956_CR21","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, 211\u2013218 (1936)","journal-title":"Psychometrika"},{"issue":"2","key":"1956_CR22","first-page":"025012","volume":"1","author":"NB Erichson","year":"2020","unstructured":"Erichson, N.B., Manohar, K., Brunton, S.L., Kutz, J.N.: Randomized CP tensor decomposition, Machine Learning. Sci. Technol. 1(2), 025012 (2020)","journal-title":"Sci. Technol."},{"key":"1956_CR23","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1019112103049","volume":"20","author":"RD Fierro","year":"1999","unstructured":"Fierro, R.D., Hansen, P.C., Hansen, P.S.K.: UTV tools: Matlab templates for rank-revealing UTV decompositions. Numerical Algorithms 20, 165\u2013194 (1999)","journal-title":"Numerical Algorithms"},{"key":"1956_CR24","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, 643\u2013660 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1956_CR25","unstructured":"Golub, G., Van\u00a0Loan, C.: Matrix Computations, Johns Hopkins University Press, Baltimore, MD, fourth\u00a0ed. (2013)"},{"key":"1956_CR26","unstructured":"Gopal, A., Martinsson, P.: The powerURV algorithm for computing rank-revealing full factorizations, arXiv preprint arXiv: 1812.06007v1 (2018)"},{"issue":"1","key":"1956_CR27","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 survery of low-rank tensor approximation techniques. GAMM-Mitteilungen 36(1), 53\u201378 (2013)","journal-title":"GAMM-Mitteilungen"},{"key":"1956_CR28","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, 2029\u20132054 (2010)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1956_CR29","doi-asserted-by":"publisher","first-page":"A1139","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, A1139\u2013A1173 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"1956_CR30","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.: Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. 53, 217\u2013288 (2011)","journal-title":"SIAM Rev."},{"key":"1956_CR31","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1137\/110842570","volume":"6","author":"N Hao","year":"2013","unstructured":"Hao, N., Kilmer, M.E., Braman, K.S., Hoover, R.C.: Facial recognition using Tensor-Tensor decompositions. SIAM J. Imag. Sci. 6, 437\u2013463 (2013)","journal-title":"SIAM J. Imag. Sci."},{"key":"1956_CR32","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-69802-1_9","volume-title":"Compressed Sensing and its Applications","author":"B Huber","year":"2017","unstructured":"Huber, B., Schneider, R., Wolf, S.: A randomized tensor train singular value decomposition. In: Boche, H., Caire, G., Calderbank, R., M\u00e4rz, M., Kutyniok, G., Mathar, R. (eds.) Compressed Sensing and its Applications, pp. 261\u2013290. Applied and Numerical Harmonic Analysis. Birkh\u00e4user, Cham (2017)"},{"key":"1956_CR33","doi-asserted-by":"publisher","first-page":"7233","DOI":"10.1109\/TIP.2020.3000349","volume":"29","author":"T-X Jiang","year":"2020","unstructured":"Jiang, T.-X., Ng, M.K., Zhao, X.-L., Huang, T.-Z.: Framelet representation of tensor nuclear norm for third-order tensor completion. IEEE Trans. Image Process. 29, 7233\u20137244 (2020)","journal-title":"IEEE Trans. Image Process."},{"key":"1956_CR34","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1109\/JSTSP.2018.2867448","volume":"12","author":"M Kaloorazi","year":"2018","unstructured":"Kaloorazi, M., De Lamare, R.: Compressed randomized UTV decompositions for low-rank matrix approximations. IEEE J. Selected Top. Signal Processing 12, 1155\u20131169 (2018)","journal-title":"IEEE J. Selected Top. Signal Processing"},{"key":"1956_CR35","doi-asserted-by":"publisher","first-page":"4409","DOI":"10.1109\/TSP.2018.2853137","volume":"66","author":"M Kaloorazi","year":"2018","unstructured":"Kaloorazi, M., De Lamare, R.: Subspace-orbit randomized decomposition for low-rank matrix approximations. IEEE Trans. Signal Process. 66, 4409\u20134424 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"1956_CR36","doi-asserted-by":"publisher","first-page":"2218","DOI":"10.1109\/TSP.2021.3066258","volume":"69","author":"MF Kaloorazi","year":"2021","unstructured":"Kaloorazi, M.F., Chen, J.: Projection-based QLP algorithm for efficiently computing low-rank approximation of matrices. IEEE Trans. Signal Process. 69, 2218\u20132232 (2021)","journal-title":"IEEE Trans. Signal Process."},{"key":"1956_CR37","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.laa.2015.07.021","volume":"485","author":"E Kernfeld","year":"2015","unstructured":"Kernfeld, E., Kilmer, M., Aeron, S.: Tensor-tensor products with invertible linear transforms. Linear Algebra Appl. 485, 545\u2013570 (2015)","journal-title":"Linear Algebra Appl."},{"key":"1956_CR38","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.laa.2010.09.020","volume":"435","author":"M Kilmer","year":"2011","unstructured":"Kilmer, M., Martin, C.: Factorization strategies for third-order tensors. Linear Algebra Appl. 435, 641\u2013658 (2011)","journal-title":"Linear Algebra Appl."},{"key":"1956_CR39","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1137\/110837711","volume":"34","author":"ME Kilmer","year":"2013","unstructured":"Kilmer, M.E., Braman, K.S., Hao, N., Hoover, R.C.: Third-order tensors as operators on matrices: A theoretical and computational framework with applications in imaging. SIAM J. Matrix Anal. Appl. 34, 148\u2013172 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1956_CR40","doi-asserted-by":"crossref","unstructured":"Kilmer, M.\u00a0E., Horesh, L., Avron, H., Newman, E.: Tensor-tensor algebra for optimal representation and compression of multiway data, Proceedings of the National Academy of Sciences 118(28), e2015851118 (2021)","DOI":"10.1073\/pnas.2015851118"},{"key":"1956_CR41","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"T Kolda","year":"2009","unstructured":"Kolda, T., Bader, B.: Tensor decompositions and applications. SIAM Rev. 51, 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"key":"1956_CR42","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1007\/s10994-021-05987-8","volume":"110","author":"H Kong","year":"2021","unstructured":"Kong, H., Lu, C., Lin, Z.: Tensor q-rank: New data dependent definition of tensor rank. Mach. Learn. 110, 1867\u20131900 (2021)","journal-title":"Mach. Learn."},{"key":"1956_CR43","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, A1879\u2013A1902 (2017)","journal-title":"SIAM J. Sci. Comput."},{"key":"1956_CR44","unstructured":"Lu, C.: Tensor-Tensor Product Toolbox, Carnegie Mellon University, June 2018. https:\/\/github.com\/canyilu\/tproduct"},{"key":"1956_CR45","doi-asserted-by":"crossref","unstructured":"Lu, C., Feng, J., Chen, Y., Liu, W., Lin, Z., Yan, S.: Tensor robust principal component analysis: Exact recovery of corrupted low-rank tensors via convex optimization. In: Proceedings of the IEEE conference on computer vision and pattern recognition 5249\u20135257 (2016)","DOI":"10.1109\/CVPR.2016.567"},{"key":"1956_CR46","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TPAMI.2019.2891760","volume":"42","author":"C Lu","year":"2020","unstructured":"Lu, C., Feng, J., Chen, Y., Liu, W., Lin, Z., Yan, S.: Tensor robust principal component analysis with a new tensor nuclear norm. IEEE Trans. Pattern Analysis Mach. Intell. 42, 925\u2013938 (2020)","journal-title":"IEEE Trans. Pattern Analysis Mach. Intell."},{"key":"1956_CR47","first-page":"123","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":"1956_CR48","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/s10444-020-09816-9","volume":"46","author":"OA Malik","year":"2020","unstructured":"Malik, O.A., Becker, S.: Fast randomized matrix and tensor interpolative decomposition using CountSketch. Adv. Comput. Math. 46, 76 (2020)","journal-title":"Adv. Comput. Math."},{"key":"1956_CR49","doi-asserted-by":"publisher","first-page":"A474","DOI":"10.1137\/110841229","volume":"35","author":"CD Martin","year":"2013","unstructured":"Martin, C.D., Shafer, R., Larue, B.: An order-$$p$$ tensor factorization with applications in imaging. SIAM J. Sci. Comput. 35, A474\u2013A490 (2013)","journal-title":"SIAM J. Sci. Comput."},{"key":"1956_CR50","unstructured":"Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proc. 8th Int\u2019l Conf. Computer Vision, 2, 416\u2013423 (2001)"},{"key":"1956_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3242670","volume":"45","author":"P Martinsson","year":"2019","unstructured":"Martinsson, P., Quintanaorti, G., Heavner, N.: randUTV: A blocked randomized algorithm for computing a rank-revealing UTV factorization. ACM Trans. Math. Software 45, 1\u201326 (2019)","journal-title":"ACM Trans. Math. Software"},{"key":"1956_CR52","doi-asserted-by":"crossref","unstructured":"Meng, X., Mahoney, M.\u00a0W.: Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression. In: Proceedings of the forty-fifth annual ACM symposium on Theory of computing 91\u2013100 (2013)","DOI":"10.1145\/2488608.2488621"},{"key":"1956_CR53","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.laa.2019.12.035","volume":"590","author":"Y Miao","year":"2020","unstructured":"Miao, Y., Wei, Y., Qi, L.: Generalized tensor function via the tensor singular value decomposition based on the T-product. Linear Algebra Appl. 590, 258\u2013303 (2020)","journal-title":"Linear Algebra Appl."},{"key":"1956_CR54","first-page":"201","volume":"3","author":"Y Miao","year":"2021","unstructured":"Miao, Y., Wei, Y., Qi, L.: T-Jordan canonical form and T-Drazin inverse based on the T-product, Communications on. Appl. Math. Comput. 3, 201\u2013220 (2021)","journal-title":"Appl. Math. Comput."},{"key":"1956_CR55","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.: Randomized algorithms for low-rank tensor decompositions in the Tucker format. SIAM J. Math. Data Sci. 2, 189\u2013215 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"key":"1956_CR56","first-page":"1396","volume":"28","author":"C Musco","year":"2015","unstructured":"Musco, C., Musco, C.: Randomized block krylov methods for stronger and faster approximate singular value decomposition. Adv. Neural. Inf. Process. Syst. 28, 1396\u20131404 (2015)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"1956_CR57","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, 2295\u20132317 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"1956_CR58","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1109\/TIP.2014.2305840","volume":"23","author":"O Semerci","year":"2014","unstructured":"Semerci, O., Hao, N., Kilmer, M., Miller, E.: Tensor-based formulation and nuclear norm regularization for multienergy computed tomography. IEEE Trans. Image Process. 23, 1678\u20131693 (2014)","journal-title":"IEEE Trans. Image Process."},{"key":"1956_CR59","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2299","volume":"27","author":"G Song","year":"2020","unstructured":"Song, G., Ng, M.K., Zhang, X.: Robust tensor completion using transformed tensor singular value decomposition. Numer. Linear Algebra Appl. 27, e2299 (2020)","journal-title":"Numer. Linear Algebra Appl."},{"key":"1956_CR60","doi-asserted-by":"publisher","first-page":"1535","DOI":"10.1109\/78.139256","volume":"40","author":"G Stewart","year":"1992","unstructured":"Stewart, G.: An updating algorithm for suspace tracking. IEEE Trans. Signal Process. 40, 1535\u20131541 (1992)","journal-title":"IEEE Trans. Signal Process."},{"key":"1956_CR61","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1137\/0614034","volume":"14","author":"G Stewart","year":"1993","unstructured":"Stewart, G.: Updating a rank-revealing ULV decomposition. SIAM J. Matrix Anal. Appl. 14, 494\u2013499 (1993)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1956_CR62","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1137\/S1064827597319519","volume":"20","author":"G Stewart","year":"1999","unstructured":"Stewart, G.: The QLP approximation to the singular value decomposition. SIAM J. Sci. Comput. 20, 1336\u20131348 (1999)","journal-title":"SIAM J. Sci. Comput."},{"key":"1956_CR63","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., Udell, M.: Low-rank Tucker decomposition of a tensor from streaming data. SIAM J. Math. Data Sci 2, 1123\u20131150 (2020)","journal-title":"SIAM J. Math. Data Sci"},{"key":"1956_CR64","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1137\/17M1159932","volume":"11","author":"DA Tarzanagh","year":"2018","unstructured":"Tarzanagh, D.A., Michailidis, G.: Fast randomized algorithms for t-product based tensor operations and decompositions with applications to imaging data. SIAM J. Imag. Sci. 11, 2629\u20132664 (2018)","journal-title":"SIAM J. Imag. Sci."},{"key":"1956_CR65","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, 279\u2013311 (1966)","journal-title":"Psychometrika"},{"key":"1956_CR66","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 J. Sel. Top. Signal Process. 10, 284\u2013295 (2016)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"1956_CR67","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."},{"key":"1956_CR68","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. Found. Trends Theor. Comput. Sci. 10, 1\u2013157 (2014)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"1956_CR69","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, 335\u2013366 (2008)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1956_CR70","doi-asserted-by":"publisher","first-page":"1","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, 1\u201324 (2018)","journal-title":"Numer. Linear Algebra Appl."},{"key":"1956_CR71","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1109\/TSP.2016.2639466","volume":"65","author":"Z Zhang","year":"2017","unstructured":"Zhang, Z., Aeron, S.: Exact tensor completion using t-SVD. IEEE Trans. Signal Process. 65, 1511\u20131526 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"1956_CR72","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Ely, G., Aeron, S., Hao, N., Kilmer, M.: Novel methods for multilinear data completion and de-noising based on tensor-SVD. In: Proceedings of the IEEE conference on computer vision and pattern recognition 3842\u20133849 (2014)","DOI":"10.1109\/CVPR.2014.485"},{"key":"1956_CR73","unstructured":"Zhou, G., Cichocki, A., Xie, S.: Decomposition of big tensors with low multilinear rank, arXiv preprint arXiv:1412.1885v1 (2014)"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-01956-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-022-01956-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-01956-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,24]],"date-time":"2022-10-24T12:29:39Z","timestamp":1666614579000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-022-01956-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,28]]},"references-count":73,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["1956"],"URL":"https:\/\/doi.org\/10.1007\/s10915-022-01956-y","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,28]]},"assertion":[{"value":"14 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2022","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 have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"93"}}