{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:07:24Z","timestamp":1772294844314,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T00:00:00Z","timestamp":1581897600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T00:00:00Z","timestamp":1581897600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s11075-020-00874-0","type":"journal-article","created":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T05:06:26Z","timestamp":1581915986000},"page":"1411-1430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Krylov subspace projection method for Sylvester tensor equation with low rank right-hand side"],"prefix":"10.1007","volume":"84","author":[{"given":"A. H.","family":"Bentbib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8978-8687","authenticated-orcid":false,"given":"S.","family":"El-Halouy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"El M.","family":"Sadek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,17]]},"reference":[{"issue":"3","key":"874_CR1","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1002\/nla.2033","volume":"23","author":"FP Ali Beik","year":"2016","unstructured":"Ali Beik, F.P., Movahed, F.S., Ahmadi-Asl, S.: On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations. Numer. Linear Algebra Appl. 23(3), 444\u2013466 (2016)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"1","key":"874_CR2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/nla.1818","volume":"20","author":"J Ballani","year":"2013","unstructured":"Ballani, J., Grasedyck, L.: A projection method to solve linear systems in tensor format. Numer. Linear Algebra Appl. 20(1), 27\u201343 (2013)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"6","key":"874_CR3","doi-asserted-by":"crossref","first-page":"2133","DOI":"10.1137\/040604959","volume":"26","author":"G Beylkin","year":"2005","unstructured":"Beylkin, G., Mohlenkamp, M.J.: Algorithms for numerical analysis in high dimensions. SIAM J. Sci. Comput. 26(6), 2133\u20132159 (2005)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"874_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1137\/S0895479894273687","volume":"17","author":"D Calvetti","year":"1996","unstructured":"Calvetti, D., Reichel, L.: Application of ADI iterative methods to the restoration of noisy images. SIAM J. Matrix Anal. Appl. 17(1), 165\u2013186 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"874_CR5","doi-asserted-by":"crossref","unstructured":"Chen, M., Kressner, D.: Recursive blocked algorithms for linear systems with Kronecker product structure. arXiv:1905.09539 (2019)","DOI":"10.1007\/s11075-019-00797-5"},{"issue":"6","key":"874_CR6","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1007\/s11425-012-4363-5","volume":"55","author":"Z Chen","year":"2012","unstructured":"Chen, Z., Lu, L.: A projection method and Kronecker product pre-conditioner for solving Sylvester tensor equations. Sci. Chin. Math. 55(6), 1281\u20131292 (2012)","journal-title":"Sci. Chin. Math."},{"key":"874_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Z., Lu, L.: A gradient based iterative solutions for sylvester tensor equations. Math. Probl. Eng., 2013 (2013)","DOI":"10.1155\/2013\/819479"},{"key":"874_CR8","doi-asserted-by":"crossref","unstructured":"Cichocki, A., Zdunek, R., Phan, A.H., Amari, S.i.: Non-Negative Matrix and Tensor Factorizations: Applications to Exploratory Multi-Way Data Analysis and Blind Source Separation. Wiley (2009)","DOI":"10.1002\/9780470747278"},{"issue":"8","key":"874_CR9","doi-asserted-by":"crossref","first-page":"1216","DOI":"10.1109\/TAC.2005.852558","volume":"50","author":"F Ding","year":"2005","unstructured":"Ding, F., Chen, T.: Gradient based iterative algorithms for solving a class of matrix equations. IEEE Trans. Autom. Control 50(8), 1216\u20131221 (2005)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1\u20133","key":"874_CR10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1023\/A:1014807923223","volume":"29","author":"A El Guennouni","year":"2002","unstructured":"El Guennouni, A., Jbilou, K., Riquet, A.: Block Krylov subspace methods for solving large Sylvester equations. Numer. Algor. 29(1\u20133), 75\u201396 (2002)","journal-title":"Numer. Algor."},{"issue":"3-4","key":"874_CR11","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s00607-003-0037-z","volume":"72","author":"L Grasedyck","year":"2004","unstructured":"Grasedyck, L.: Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure. Computing 72(3-4), 247\u2013265 (2004)","journal-title":"Computing"},{"issue":"1","key":"874_CR12","first-page":"365","volume":"177","author":"K Jbilou","year":"2006","unstructured":"Jbilou, K.: Low rank approximate solutions to large Sylvester matrix equations. Appl. Math. Comput. 177(1), 365\u2013376 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"874_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0168-9274(98)00094-4","volume":"31","author":"K Jbilou","year":"1999","unstructured":"Jbilou, K., Messaoudi, A., Sadok, H.: Global FOM and GMRES algorithms for matrix equations. Appl. Numer. Math. 31(1), 49\u201363 (1999)","journal-title":"Appl. Numer. Math."},{"issue":"7","key":"874_CR14","doi-asserted-by":"crossref","first-page":"2378","DOI":"10.1177\/0142331217702711","volume":"40","author":"S Karimi","year":"2018","unstructured":"Karimi, S., Dehghan, M.: Global least squares method based on tensor form to solve linear systems in Kronecker format. Trans. Instit. Measur. Control 40(7), 2378\u20132386 (2018)","journal-title":"Trans. Instit. Measur. Control"},{"issue":"1","key":"874_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.chemolab.2011.09.001","volume":"110","author":"BN Khoromskij","year":"2012","unstructured":"Khoromskij, B.N.: Tensors-structured numerical methods in scientific computing: Survey on recent advances. Chemom. Intell. Lab. Syst. 110(1), 1\u201319 (2012)","journal-title":"Chemom. Intell. Lab. Syst."},{"issue":"3","key":"874_CR16","doi-asserted-by":"crossref","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":"874_CR17","doi-asserted-by":"crossref","first-page":"1688","DOI":"10.1137\/090756843","volume":"31","author":"D Kressner","year":"2010","unstructured":"Kressner, D., Tobler, C.: Krylov subspace methods for linear systems with tensor product structure. SIAM J. Matrix Anal. Appl. 31(4), 1688\u20131714 (2010)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"874_CR18","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1007\/s11045-017-0481-0","volume":"29","author":"N Lee","year":"2018","unstructured":"Lee, N., Cichocki, A.: Fundamental tensor operations for large-scale data analysis using tensor network formats. Multidim. Syst. Sign. Process. 29(3), 921\u2013960 (2018)","journal-title":"Multidim. Syst. Sign. Process."},{"issue":"4","key":"874_CR19","doi-asserted-by":"crossref","first-page":"1198","DOI":"10.1016\/j.jcp.2009.10.025","volume":"229","author":"BW Li","year":"2010","unstructured":"Li, B.W., Tian, S., Sun, Y.S., Hu, Z.M.: Schur decomposition for 3d matrix equations and its application in solving radiative discrete ordinates equations discretized by chebyshev collocation spectral method. J. Comput. Phys. 229(4), 1198\u20131212 (2010)","journal-title":"J. Comput. Phys."},{"issue":"7","key":"874_CR20","doi-asserted-by":"crossref","first-page":"1540","DOI":"10.1016\/j.patcog.2011.01.004","volume":"44","author":"H Lu","year":"2011","unstructured":"Lu, H., Plataniotis, K.N., Venetsanopoulos, A.N.: A survey of multi-linear subspace learning for tensor data. Pattern Recogn. 44(7), 1540\u20131551 (2011)","journal-title":"Pattern Recogn."},{"issue":"1","key":"874_CR21","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.cam.2007.06.023","volume":"217","author":"A Malek","year":"2008","unstructured":"Malek, A., Momeni-Masuleh, S.H.: A mixed collocation finite difference method for 3d microscopic heat transport problems. J. Comput. Appl. Math. 217(1), 137\u2013147 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"874_CR22","unstructured":"Penzl, T., et al.: A Matlab toolbox for large Lyapunov and Riccati equations, model reduction problems, and linear quadratic optimal control problems. Software available at https:\/\/www.tu-chemnitz.de\/sfb393\/lyapack\/ (2000)"},{"key":"874_CR23","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, vol. 82. SIAM (2003)","DOI":"10.1137\/1.9780898718003"},{"issue":"9","key":"874_CR24","doi-asserted-by":"crossref","first-page":"092701","DOI":"10.1115\/1.4006596","volume":"134","author":"YS Sun","year":"2012","unstructured":"Sun, Y.S., Ma, J., Li, B.W.: Chebyshev collocation spectral method for three-dimensional transient coupled radiative conductive heat transfer. J. Heat Transfer 134(9), 092701 (2012)","journal-title":"J. Heat Transfer"},{"key":"874_CR25","doi-asserted-by":"crossref","unstructured":"Trefethen, L.N., Bau, D. III: Numerical Linear Algebra, vol. 50. SIAM (1997)","DOI":"10.1137\/1.9780898719574"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00874-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-020-00874-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00874-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,18]],"date-time":"2021-02-18T23:41:41Z","timestamp":1613691701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-020-00874-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,17]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["874"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-00874-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,17]]},"assertion":[{"value":"23 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}