{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T13:36:34Z","timestamp":1780407394187,"version":"3.54.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"8-9","license":[{"start":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T00:00:00Z","timestamp":1718409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T00:00:00Z","timestamp":1718409600000},"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":["U1911401"],"award-info":[{"award-number":["U1911401"]}],"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":["62073087"],"award-info":[{"award-number":["62073087"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SIViP"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11760-024-03315-w","type":"journal-article","created":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T10:01:41Z","timestamp":1718445701000},"page":"6287-6297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Towards efficient and accurate approximation: tensor decomposition based on randomized block Krylov iteration"],"prefix":"10.1007","volume":"18","author":[{"given":"Yichun","family":"Qiu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weijun","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guoxu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qibin","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,6,15]]},"reference":[{"key":"3315_CR1","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, 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"key":"3315_CR2","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., Lathauwer, L.D., Zhou, G., Zhao, Q., Caiafa, C.F., Phan, A.: Tensor decompositions for signal processing applications: from two-way to multiway component analysis. IEEE Signal Process. Mag. 32, 145\u2013163 (2015)","journal-title":"IEEE Signal Process. Mag."},{"key":"3315_CR3","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"},{"issue":"1","key":"3315_CR4","first-page":"84","volume":"16","author":"RA Harshman","year":"1970","unstructured":"Harshman, R.A., et al.: Foundations of the parafac procedure: models and conditions for an \u201cexplanatory\u2019\u2019 multi-modal factor analysis. UCLA Working Papers Phonet. 16(1), 84 (1970)","journal-title":"UCLA Working Papers Phonet."},{"key":"3315_CR5","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"I Oseledets","year":"2011","unstructured":"Oseledets, I.: Tensor-train decomposition. SIAM J. Sci. Comput. 33, 2295\u20132317 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"3315_CR6","unstructured":"Zhao, Q., Zhou, G., Xie, S., Zhang, L., Cichocki, A.: Tensor ring decomposition. arXiv:1606.05535 (2016)"},{"key":"3315_CR7","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Huang, T., Zhao, X., Zhao, Q., Jiang, T.-X.: Fully-connected tensor network decomposition and its application to higher-order tensor completion. In: Proceedings of the AAAI conference on artificial intelligence, vol. 35, pp. 11071\u201311078 (2021)","DOI":"10.1609\/aaai.v35i12.17321"},{"key":"3315_CR8","unstructured":"Novikov, A., Podoprikhin, D., Osokin, A., Vetrov, D.P.: Tensorizing neural networks. In: Proceedings of the 28th international conference on neural information processing systems (2015)"},{"key":"3315_CR9","doi-asserted-by":"publisher","first-page":"3020","DOI":"10.1109\/TNNLS.2020.3009210","volume":"32","author":"J Yu","year":"2021","unstructured":"Yu, J., Zhou, G., Li, C., Zhao, Q., Xie, S.: Low tensor-ring rank completion by parallel matrix factorization. IEEE Trans. Neural Netw. Learn. Syst. 32, 3020\u20133033 (2021)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"3315_CR10","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1007\/s11431-020-1827-0","volume":"64","author":"Y Qiu","year":"2021","unstructured":"Qiu, Y., Sun, W., Zhang, Y., Gu, X., Zhou, G.: Approximately orthogonal nonnegative tucker decomposition for flexible multiway clustering. Sci. China Technol. Sci. 64, 1872\u20131880 (2021)","journal-title":"Sci. China Technol. Sci."},{"key":"3315_CR11","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0895479896305696","volume":"21","author":"LD Lathauwer","year":"2000","unstructured":"Lathauwer, L.D., Moor, B.D., Vandewalle, J.: A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21, 1253\u20131278 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3315_CR12","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1137\/S0895479898346995","volume":"21","author":"LD Lathauwer","year":"2000","unstructured":"Lathauwer, L.D., Moor, B.D., Vandewalle, J.: On the best rank-1 and rank-(r1 , r2, ... , rn) approximation of higher-order tensors. SIAM J. Matrix Anal. Appl. 21, 1324\u20131342 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3315_CR13","unstructured":"Wang, S.: A practical guide to randomized matrix computations with matlab implementations. CoRR arXiv:1505.07570 (2015)"},{"issue":"4","key":"3315_CR14","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":"3315_CR15","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":"2","key":"3315_CR16","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1137\/16M1064556","volume":"38","author":"A Szlam","year":"2017","unstructured":"Szlam, A., Tulloch, A., Tygert, M.: Accurate low-rank approximations via a few iterations of alternating least squares. SIAM J. Matrix Anal. Appl. 38(2), 425\u2013433 (2017)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3315_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.-M.: 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":"3315_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1049\/iet-cvi.2018.5764","volume":"14","author":"Y Feng","year":"2020","unstructured":"Feng, Y., Zhou, G.: Orthogonal random projection for tensor completion. IET Comput. Vis. 14, 233\u2013240 (2020)","journal-title":"IET Comput. Vis."},{"issue":"15","key":"3315_CR19","doi-asserted-by":"publisher","first-page":"22987","DOI":"10.1007\/s11042-020-08711-1","volume":"80","author":"Y Qiu","year":"2020","unstructured":"Qiu, Y., Zhou, G., Zhang, Y., Cichocki, A.: Canonical polyadic decomposition (cpd) of big tensors with low multilinear rank. Multimed. Tools Appl. 80(15), 22987\u201323007 (2020)","journal-title":"Multimed. Tools Appl."},{"key":"3315_CR20","doi-asserted-by":"crossref","unstructured":"Yuan, L., Li, C., Cao, J., Zhao, Q.: Randomized tensor ring decomposition and its application to large-scale data reconstruction. In: IEEE international conference on acoustics, speech and signal processing (ICASSP), pp. 2127\u20132131 (2019)","DOI":"10.1109\/ICASSP.2019.8682197"},{"key":"3315_CR21","unstructured":"Malik, O.A., Becker, S.: Low-rank tucker decomposition of large tensors using tensorsketch. In: Proceedings of the 32nd international conference on neural information processing systems. NIPS\u201918, pp. 10117\u201310127. Curran Associates Inc., Red Hook, NY, USA (2018)"},{"key":"3315_CR22","unstructured":"Wang, Y., Tung, H.-Y., Smola, A., Anandkumar, A.: Fast and guaranteed tensor decomposition via sketching. In: Proceedings of the 28th international conference on neural information processing systems - Volume 1. NIPS\u201915, pp. 991\u2013999. MIT Press, Cambridge, MA, USA (2015)"},{"key":"3315_CR23","doi-asserted-by":"crossref","unstructured":"Larsen, B.W., Kolda, T.G.: Practical leverage-based sampling for low-rank tensor decomposition. arXiv:2006.16438 (2022)","DOI":"10.1137\/21M1441754"},{"key":"3315_CR24","unstructured":"Malik, O.A.: More efficient sampling for tensor decomposition with worst-case guarantees. In: International conference on machine learning, pp. 14887\u201314917 (2022). PMLR"},{"key":"3315_CR25","first-page":"24299","volume":"34","author":"L Ma","year":"2021","unstructured":"Ma, L., Solomonik, E.: Fast and accurate randomized algorithms for low-rank tensor decompositions. Adv. Neural. Inf. Process. Syst. 34, 24299\u201324312 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"2","key":"3315_CR26","volume":"1","author":"NB Erichson","year":"2020","unstructured":"Erichson, N.B., Manohar, K., Brunton, S.L., Kutz, J.N.: Randomized cp tensor decomposition. Mach. Learn.: Sci. Technol. 1(2), 025012 (2020)","journal-title":"Mach. Learn.: Sci. Technol."},{"key":"3315_CR27","doi-asserted-by":"publisher","first-page":"28684","DOI":"10.1109\/ACCESS.2021.3058103","volume":"9","author":"S Ahmadi-Asl","year":"2021","unstructured":"Ahmadi-Asl, S., Abukhovich, S., Asante-Mensah, M.G., Cichocki, A., Phan, A., Tanaka, T., Oseledets, I.: Randomized algorithms for computation of tucker decomposition and higher order svd (hosvd). IEEE Access 9, 28684\u201328706 (2021)","journal-title":"IEEE Access"},{"key":"3315_CR28","doi-asserted-by":"crossref","unstructured":"Minster, R., Saibaba, A.K., Kilmer, M.E.: Randomized algorithms for low-rank tensor decompositions in the tucker format. arXiv:1905.07311 (2020)","DOI":"10.1137\/19M1261043"},{"issue":"1","key":"3315_CR29","volume":"2","author":"S Ahmadi-Asl","year":"2020","unstructured":"Ahmadi-Asl, S., Cichocki, A., Phan, A.H., Asante-Mensah, M.G., Ghazani, M.M., Tanaka, T., Oseledets, I.: Randomized algorithms for fast computation of low rank tensor ring model. Mach. Learn.: Sci. Technol. 2(1), 011001 (2020)","journal-title":"Mach. Learn.: Sci. Technol."},{"key":"3315_CR30","doi-asserted-by":"publisher","first-page":"255","DOI":"10.6028\/jres.045.026","volume":"45","author":"C Lanczos","year":"1950","unstructured":"Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Natl. Bur. Stand. 45, 255\u2013282 (1950)","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"2","key":"3315_CR31","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/0702016","volume":"2","author":"G Golub","year":"1965","unstructured":"Golub, G., Kahan, W.: Calculating the singular values and pseudo-inverse of a matrix. J. Soc. Indus. Appl. Math. Series B Numer. Anal. 2(2), 205\u2013224 (1965)","journal-title":"J. Soc. Indus. Appl. Math. Series B Numer. Anal."},{"key":"3315_CR32","doi-asserted-by":"crossref","unstructured":"Cullum, J., Donath, W.E.: A block lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace of large, sparse, real symmetric matrices. In: 1974 IEEE conference on decision and control including the 13th symposium on adaptive processes, pp. 505\u2013509 (1974). IEEE","DOI":"10.1109\/CDC.1974.270490"},{"issue":"2","key":"3315_CR33","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."},{"key":"3315_CR34","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1007\/s11075-022-01303-0","volume":"91","author":"L Eld\u00e9n","year":"2022","unstructured":"Eld\u00e9n, L., Dehghan, M.: A krylov-schur-like method for computing the best rank-(r1, r2, r3) approximation of large and sparse tensors. Numer. Algorithms 91, 1315\u20131347 (2022)","journal-title":"Numer. Algorithms"},{"key":"3315_CR35","unstructured":"Musco, C., Musco, C.: Randomized block krylov methods for stronger and faster approximate singular value decomposition. In: Proceedings of the 28th international conference on neural information processing systems. NIPS\u201915, pp. 1396\u20131404. MIT Press, Cambridge, MA, USA (2015)"},{"key":"3315_CR36","doi-asserted-by":"crossref","unstructured":"Tropp, J.A.: Randomized block krylov methods for approximating extreme eigenvalues. Numer. Math. 150, 217\u2013255 (2021)","DOI":"10.1007\/s00211-021-01250-3"},{"key":"3315_CR37","doi-asserted-by":"crossref","unstructured":"Wang, C., Yi, Q., Liao, X., Wang, Y.: An improved frequent directions algorithm for low-rank approximation via block krylov iteration. IEEE Transactions on Neural Networks and Learning Systems (2023)","DOI":"10.1109\/TNNLS.2022.3233243"},{"key":"3315_CR38","unstructured":"Yu, G., Feng, J., Chen, Z., Cai, X., Qi, L.: A randomized block krylov method for tensor train approximation. arXiv preprint arXiv:2308.01480 (2023)"},{"key":"3315_CR39","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02288367","volume":"1","author":"C Eckart","year":"1936","unstructured":"Eckart, C., Young, G.M.: The approximation of one matrix by another of lower rank. Psychometrika 1, 211\u2013218 (1936)","journal-title":"Psychometrika"},{"issue":"1\u20132","key":"3315_CR40","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\u20132), 1\u2013157 (2014)","journal-title":"Found. Trends Theor. Comput. Sci."}],"container-title":["Signal, Image and Video Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-024-03315-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11760-024-03315-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-024-03315-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T19:14:59Z","timestamp":1722280499000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11760-024-03315-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,15]]},"references-count":40,"journal-issue":{"issue":"8-9","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["3315"],"URL":"https:\/\/doi.org\/10.1007\/s11760-024-03315-w","relation":{},"ISSN":["1863-1703","1863-1711"],"issn-type":[{"value":"1863-1703","type":"print"},{"value":"1863-1711","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,15]]},"assertion":[{"value":"3 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2024","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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}