{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T02:21:18Z","timestamp":1770690078792,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T00:00:00Z","timestamp":1585785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T00:00:00Z","timestamp":1585785600000},"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-00911-y","type":"journal-article","created":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T16:19:42Z","timestamp":1585844382000},"page":"1535-1563","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Golub\u2013Kahan bidiagonalization for ill-conditioned tensor equations with applications"],"prefix":"10.1007","volume":"84","author":[{"given":"Fatemeh P. A.","family":"Beik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khalide","family":"Jbilou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Najafi-Kalyani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lothar","family":"Reichel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"key":"911_CR1","unstructured":"Bader, B.W, Kolda, T.G.: MATLAB tensor toolbox version 2.5. http:\/\/www.sandia.gov\/tgkolda\/TensorToolbox"},{"key":"911_CR2","doi-asserted-by":"publisher","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, 27\u201343 (2013)","journal-title":"Numer. Linear Algebra Appl."},{"key":"911_CR3","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1002\/nla.2033","volume":"23","author":"FPA Beik","year":"2016","unstructured":"Beik, F.P.A., 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, 444\u2013466 (2016)","journal-title":"Numer. Linear Algebra Appl."},{"key":"911_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.cam.2015.12.034","volume":"300","author":"AH Bentbib","year":"2016","unstructured":"Bentbib, A.H., El Guide, M., Jbilou, K., Reichel, L.: A global Lanczos method for image restoration. J. Comput. Appl. Math. 300, 233\u2013244 (2016)","journal-title":"J. Comput. Appl. Math."},{"key":"911_CR5","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.cam.2017.03.016","volume":"322","author":"AH Bentbib","year":"2017","unstructured":"Bentbib, A.H., El Guide, M., Jbilou, K, Reichel, L.: Global Golub\u2013Kahan bidiagonalization applied to large discrete ill-posed problems. J. Comput. Appl. Math. 322, 46\u201356 (2017)","journal-title":"J. Comput. Appl. Math."},{"key":"911_CR6","doi-asserted-by":"publisher","first-page":"2078","DOI":"10.1016\/j.cam.2011.09.031","volume":"236","author":"A Bouhamidi","year":"2012","unstructured":"Bouhamidi, A., Jbilou, K., Reichel, L., Sadok, H.: A generalized global Arnoldi method for ill-posed matrix equations. J. Comput. Appl. Math. 236, 2078\u20132089 (2012)","journal-title":"J. Comput. Appl. Math."},{"key":"911_CR7","doi-asserted-by":"publisher","first-page":"112276","DOI":"10.1016\/j.cam.2019.05.024","volume":"373","author":"A Buccini","year":"2020","unstructured":"Buccini, A., Pasha, M., Reichel, L.: Generalized singular value decomposition with iterated Tikhonov regularization. J. Comput. Appl. Math. 373, 112276 (2020)","journal-title":"J. Comput. Appl. Math."},{"key":"911_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/A:1026083619097","volume":"43","author":"D Calvetti","year":"2003","unstructured":"Calvetti, D., Reichel, L.: Tikhonov regularization of large linear problems. BIT 43, 263\u2013283 (2003)","journal-title":"BIT"},{"key":"911_CR9","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1007\/s11425-012-4363-5","volume":"55","author":"Z Chen","year":"2012","unstructured":"Chen, Z., Lu, L.Z.: A projection method and Kronecker product preconditioner for solving Sylvester tensor equations. Sci. China Math. 55, 1281\u20131292 (2012)","journal-title":"Sci. China Math."},{"key":"911_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/9780470747278","volume-title":"Nonnegative matrix and tensor factorizations: Applications to exploratory multi-way data analysis and blind source separation","author":"A Cichocki","year":"2009","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, Chichester (2009)"},{"key":"911_CR11","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BF01932285","volume":"17","author":"L Eld\u00e9n","year":"1977","unstructured":"Eld\u00e9n, L.: Algorithms for the regularization of ill-conditioned least squares problems. BIT 17, 134\u2013145 (1977)","journal-title":"BIT"},{"key":"911_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-1740-8","volume-title":"Regularization of inverse problems","author":"HW Engl","year":"1996","unstructured":"Engl, H.W., Hanke, M., Neubauer, A.: Regularization of inverse problems. Kluwer, Dordrecht (1996)"},{"key":"911_CR13","volume-title":"Matrix computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix computations. The Johns Hopkins University Press, Batimore (1996)"},{"key":"911_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix analysis","author":"RA Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix analysis. Cambridge University Press, Cambridge (1985)"},{"key":"911_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11075-018-0534-y","volume":"81","author":"G Huang","year":"2019","unstructured":"Huang, G., Reichel, L., Yin, F.: On the choice of subspace for large-scale Tikhonov regularization problems in general form. Numer. Algorithms 81, 33\u201355 (2019)","journal-title":"Numer. Algorithms"},{"key":"911_CR16","doi-asserted-by":"crossref","first-page":"e2254","DOI":"10.1002\/nla.2254","volume":"26","author":"B Huang","year":"2019","unstructured":"Huang, B., Xie, Y., Ma, C.: Krylov subspace methods to solve a class of tensor equations via the Einstein product. Numer. Linear Algebra Appl. 26, e2254 (2019)","journal-title":"Numer. Linear Algebra Appl."},{"key":"911_CR17","first-page":"233","volume":"38","author":"S Kindermann","year":"2011","unstructured":"Kindermann, S.: Convergence analysis of minimization-based noise level-freeparameter choice rules for linear ill-posed problems. Electron. Trans. Numer. Anal. 38, 233\u2013257 (2011)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"911_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1553\/etna_vol53s217","volume":"53","author":"S Kindermann","year":"2020","unstructured":"Kindermann, S., Raik, K.: A simplified L-curve method as error estimator. Electron. Trans. Numer. Anal. 53, 217\u2013238 (2020)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"911_CR19","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":"911_CR20","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1080\/03081087.2018.1426714","volume":"67","author":"L Liang","year":"2019","unstructured":"Liang, L., Zheng, B.: Sensitivity analysis of the Lyapunov tensor equation. Linear Multilinear Algebra 67, 555\u2013572 (2019)","journal-title":"Linear Multilinear Algebra"},{"key":"911_CR21","doi-asserted-by":"publisher","first-page":"094504","DOI":"10.1115\/1.4006271","volume":"134","author":"A Malek","year":"2012","unstructured":"Malek, A., Bojdi, Z.K., Golbarg, P.N.N.: Solving fully three-dimensional microscale dual phase lag problem using mixed-collocation finite difference discretization. J. Heat Transf. 134, 094504 (2012)","journal-title":"J. Heat Transf."},{"key":"911_CR22","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.cam.2007.06.023","volume":"217","author":"A Malek","year":"2008","unstructured":"Malek, A., Masuleh, S.H.M.: Mixed collocation-finite difference method for 3D microscopic heat transport problems. J. Comput. Appl. Math. 217, 137\u2013147 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"911_CR23","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1016\/j.compfluid.2003.09.002","volume":"33","author":"SHM Masuleh","year":"2004","unstructured":"Masuleh, S.H.M., Phillips, T.N.: Viscoelastic flow in an undulating tube using spectral methods. Comput. Fluids 33, 1075\u20131095 (2004)","journal-title":"Comput. Fluids"},{"key":"911_CR24","doi-asserted-by":"publisher","first-page":"112216","DOI":"10.1016\/j.cam.2019.03.045","volume":"373","author":"M Najafi-Kalyani","year":"2020","unstructured":"Najafi-Kalyani, M., Beik, F.P.A., Jbilou, K.: On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations. J. Comput. Appl. Math. 373, 112216 (2020)","journal-title":"J. Comput. Appl. Math."},{"key":"911_CR25","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/355984.355989","volume":"8","author":"CC Paige","year":"1982","unstructured":"Paige, C.C., Saunders, M.A.: LSQR: An algorithm for sparse linear equations and sparse least squares problems. ACM Trans. Math. Softw. 8, 43\u201371 (1982)","journal-title":"ACM Trans. Math. Softw."},{"key":"911_CR26","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s10543-008-0179-7","volume":"48","author":"L Reichel","year":"2008","unstructured":"Reichel, L., Shyshkov, A.: A new zero-finder for Tikhonov regularization. BIT 48, 627\u2013643 (2008)","journal-title":"BIT"},{"key":"911_CR27","doi-asserted-by":"publisher","first-page":"092701","DOI":"10.1115\/1.4006596","volume":"134","author":"YS Sun","year":"2012","unstructured":"Sun, Y.S., Jing, M., Li, B.W.: Chebyshev collocation spectral method for three-dimensional transient coupled radiative-conductive heat transfer. J. Heat Transf. 134, 092701\u2013092707 (2012)","journal-title":"J. Heat Transf."},{"key":"911_CR28","doi-asserted-by":"publisher","first-page":"3117","DOI":"10.1016\/j.camwa.2019.01.024","volume":"77","author":"X Xu","year":"2019","unstructured":"Xu, X., Wang, Q.-W.: Extending BiCG and BiCR methods to solve the Stein tensor equation. Comput. Math. Appl. 77, 3117\u20133127 (2019)","journal-title":"Comput. Math. Appl."},{"key":"911_CR29","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.camwa.2013.05.004","volume":"66","author":"MK Zak","year":"2013","unstructured":"Zak, M.K., Toutounian, F.: Nested splitting conjugate gradient method for matrix equation AXB = C and preconditioning. Comput. Math. Appl. 66, 269\u2013278 (2013)","journal-title":"Comput. Math. Appl."},{"key":"911_CR30","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/s10444-013-9330-3","volume":"40","author":"MK Zak","year":"2014","unstructured":"Zak, M.K., Toutounian, F.: Nested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning. Adv. Comput. Math. 40, 865\u2013880 (2014)","journal-title":"Adv. Comput. Math."},{"key":"911_CR31","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1080\/00207160.2015.1120863","volume":"94","author":"MK Zak","year":"2017","unstructured":"Zak, M.K., Toutounian, F.: An iterative method for solving the continuous Sylvester equation by emphasizing on the skew-Hermitian parts of the coefficient matrices. Internat. J. Comput. Math. 94, 633\u2013649 (2017)","journal-title":"Internat. J. Comput. Math."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00911-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-020-00911-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00911-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T12:24:29Z","timestamp":1695990269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-020-00911-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,2]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["911"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-00911-y","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,2]]},"assertion":[{"value":"16 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}