{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:04:08Z","timestamp":1757617448858,"version":"3.44.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T00:00:00Z","timestamp":1739923200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T00:00:00Z","timestamp":1739923200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the NSF of China","award":["11801430"],"award-info":[{"award-number":["11801430"]}]},{"DOI":"10.13039\/501100017596","name":"Natural Science Basic Research Program of Shaanxi Province","doi-asserted-by":"publisher","award":["2023-JC-YB-056","2024JC-YBMS-003"],"award-info":[{"award-number":["2023-JC-YB-056","2024JC-YBMS-003"]}],"id":[{"id":"10.13039\/501100017596","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s12190-024-02351-6","type":"journal-article","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T18:28:31Z","timestamp":1739989711000},"page":"4875-4895","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A hybrid Newton\u2019s method for solving tensor square root problem"],"prefix":"10.1007","volume":"71","author":[{"given":"Lixia","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yongjuan","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Xuefeng","family":"Duan","sequence":"additional","affiliation":[]},{"given":"Chunfeng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Sanyang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,19]]},"reference":[{"key":"2351_CR1","unstructured":"Kolda, T., Bader, B.: The Tophits model for higher-order web link analysis. Workshop on link analysis counterterrorism and security. 7, 26\u201329 (2006)"},{"issue":"2","key":"2351_CR2","first-page":"146","volume":"5","author":"H Heydari","year":"2005","unstructured":"Heydari, H., Bjsrk, G.: Entanglement tensor for a general pure multipartite quantum state. Quantum. Inf. Comput. 5(2), 146\u2013155 (2005)","journal-title":"Quantum. Inf. Comput."},{"key":"2351_CR3","doi-asserted-by":"crossref","unstructured":"Koniusz, P., Cherian, A.: Sparse coding for third-order super-symmetric tensor descriptors with application to texture recognition. IEEE Conf. Comput. Vis. Pattern Recognit, pp. 5395\u20135403 (2016)","DOI":"10.1109\/CVPR.2016.582"},{"issue":"2","key":"2351_CR4","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1137\/100804577","volume":"34","author":"M Brazell","year":"2013","unstructured":"Brazell, M., Li, N., Navasca, C.: Solving multilinear systems via tensor inversion. SIAM J. Matrix. Anal. A. 34(2), 542\u2013570 (2013)","journal-title":"SIAM J. Matrix. Anal. A."},{"issue":"4","key":"2351_CR5","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1080\/03081087.2018.1500993","volume":"67","author":"M Liang","year":"2019","unstructured":"Liang, M., Zheng, B., Zhao, R.: Tensor inversion and its application to the tensor equations with Einstein product. Linear. Multilinear. A. 67(4), 843\u2013870 (2019)","journal-title":"Linear. Multilinear. A."},{"key":"2351_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2021.107636","volume":"124","author":"J Yan","year":"2022","unstructured":"Yan, J., Xu, Y., Huang, Z.: A homotopy method for solving multilinear systems with strong completely positive tensors. Appl. Math. Lett. 124, 107636 (2022)","journal-title":"Appl. Math. Lett."},{"key":"2351_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/s40314-024-02602-z","volume":"43","author":"R Erfanifar","year":"2024","unstructured":"Erfanifar, R., Hajarian, M.: Several efficient iterative algorithms for solving non-linear tensor equation $${\\cal{X} }+{\\cal{A} }^t\\ast _N{\\cal{X} }^{-1}\\ast _N{\\cal{A} }={\\cal{I} }$$ with einstein product. Comput. Appl. Math. 43, 84 (2024)","journal-title":"Comput. Appl. Math."},{"key":"2351_CR8","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. Hina. Math. 55, 1281\u20131292 (2012)","journal-title":"Sci. Hina. Math."},{"key":"2351_CR9","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2019.112560","volume":"369","author":"B Huang","year":"2020","unstructured":"Huang, B., Ma, C.: Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations. Appl. Math. Comput. 369, 124892 (2020)","journal-title":"Appl. Math. Comput."},{"key":"2351_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s40314-023-02374-y","volume":"42","author":"J Hu","year":"2023","unstructured":"Hu, J., Ke, Y., Changfeng, M.: Efficient iterative method for generalized Sylvester quaternion tensor equation. Comput. Appl. Math. 42, 237 (2023)","journal-title":"Comput. Appl. Math."},{"issue":"10","key":"2351_CR11","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1080\/03081087.2020.1777248","volume":"70","author":"Y Miao","year":"2022","unstructured":"Miao, Y., Wei, Y., Chen, Z.: Fourth-order tensor Riccati equations with the Einstein product. J. Linear Multilinear A. 70(10), 1831\u20131853 (2022)","journal-title":"J. Linear Multilinear A."},{"key":"2351_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.aml.2019.05.031","volume":"98","author":"XF Duan","year":"2019","unstructured":"Duan, X.F., Wang, C.Y., Li, C.M.: Newton\u2019s method for solving the tensor square root problem. Appl. Math. Lett. 98, 57\u201362 (2019)","journal-title":"Appl. Math. Lett."},{"key":"2351_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.neucom.2021.03.011","volume":"445","author":"C Mo","year":"2021","unstructured":"Mo, C., Gerontitis, D., Stanimirovi\u0107, P.S.: Solving the time-varying tensor square root equation by varying-parameters finite-time Zhang neural network. Neurocomputing 445, 309\u2013325 (2021)","journal-title":"Neurocomputing"},{"key":"2351_CR14","doi-asserted-by":"publisher","unstructured":"Gao YJ, Liu LX., Zhang ZC., Liu SY.: Two fixed-point iteration algorithms for solving tensor square root problem. J. Ind. Manag. Optim.21(3), 2091\u20132106 (2025). https:\/\/doi.org\/10.3934\/jimo.2024164","DOI":"10.3934\/jimo.2024164"},{"key":"2351_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1137\/0727004","volume":"57","author":"BA Schmitt","year":"1990","unstructured":"Schmitt, B.A.: An algebraic approximation for the matrix exponential in singularly perturbed boundary value problems. SIAM J. Numer. Analys. 57, 51\u201366 (1990)","journal-title":"SIAM J. Numer. Analys."},{"key":"2351_CR16","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1137\/S0895479899364015","volume":"22","author":"SH Cheng","year":"2001","unstructured":"Cheng, S.H., Higham, N.J., Kenney, C.S.: Approximating the logarithm of a matrix to specified accuracy. SIAM J. Matrix Anal. Appl. 22, 1112\u20131125 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2351_CR17","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1021253906202","volume":"66","author":"CS Jog","year":"2002","unstructured":"Jog, C.S.: On the explicit determination of the polar decomposition in n-dimensional vector spaces. J. Elasticity. 66, 159\u2013169 (2002)","journal-title":"J. Elasticity."},{"key":"2351_CR18","first-page":"24","volume":"38","author":"P Zielinski","year":"1995","unstructured":"Zielinski, P., Zietak, K.: The polar decomposition-properties applications and algorithms. Appl. Math. 38, 24\u201349 (1995)","journal-title":"Appl. Math."},{"key":"2351_CR19","doi-asserted-by":"crossref","unstructured":"Bj$$\\ddot{o}$$rck, A., Hammarling, S.: A schur method for the square root of a matrix. Linear Algebra Appl. 52, 127-140 (1983)","DOI":"10.1016\/0024-3795(83)80010-X"},{"key":"2351_CR20","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1006\/jmaa.1997.5517","volume":"213","author":"MA Hasan","year":"1997","unstructured":"Hasan, M.A.: A power method for computing square roots of complex matrices. J. Math. Anal. Appl. 213, 393\u2013405 (1997)","journal-title":"J. Math. Anal. Appl."},{"key":"2351_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0025-5718-1958-0099107-4","volume":"12","author":"P Laasonen","year":"1958","unstructured":"Laasonen, P.: On the iterative solution of the matrix equation $$AX^2 - I = O$$. Math. Comput. 12, 109\u2013116 (1958)","journal-title":"Math. Comput."},{"key":"2351_CR22","first-page":"537","volume":"46","author":"NJ Higham","year":"1986","unstructured":"Higham, N.J.: Newton\u2019s method for the matrix square root. Math. Comput. 46, 537\u2013549 (1986)","journal-title":"Math. Comput."},{"key":"2351_CR23","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s00521-010-0445-x","volume":"21","author":"YN Zhang","year":"2012","unstructured":"Zhang, Y.N., Yang, Y.W., Cai, B.H.: Zhang neural network and its application to Newton iteration for matrix square root estimation. Neural Comput. Appl. 21, 453\u2013460 (2012)","journal-title":"Neural Comput. Appl."},{"key":"2351_CR24","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.crme.2015.07.002","volume":"343","author":"B Desmorat","year":"2015","unstructured":"Desmorat, B., Desmorat, R.: Tensorial Polar Decomposition of 2D fourth-order tensors. C. R. Mecanique. 343, 471\u2013475 (2015)","journal-title":"C. R. Mecanique."},{"issue":"1","key":"2351_CR25","doi-asserted-by":"publisher","first-page":"69","DOI":"10.4208\/nmtma.OA-2023-0065","volume":"17","author":"E Raziyeh","year":"2024","unstructured":"Raziyeh, E., Masoud, H., Khosro, S.: On polar decomposition of tensors with Einstein product and a novel iterative parametric method. J. Numer. Math. Theor. Meth. Appl. 17(1), 69\u201392 (2024)","journal-title":"J. Numer. Math. Theor. Meth. Appl."},{"key":"2351_CR26","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/S0045-7825(99)00472-7","volume":"189","author":"M Itskov","year":"2000","unstructured":"Itskov, M.: On the theory of fourth-order tensors and their applications in computational mechanics. Comput. Meth. Appl. Mech. Eng. 189, 419\u2013438 (2000)","journal-title":"Comput. Meth. Appl. Mech. Eng."},{"key":"2351_CR27","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/zamm.200410242","volume":"86","author":"O Kintzel","year":"2006","unstructured":"Kintzel, O., Basar, Y.: Fourth-order tensors-tensor differentiation with applications to continuum mechanics. Part I: classical tensor analysis. ZAMM J. Appl. Math. Mech. 86, 291\u2013311 (2006)","journal-title":"ZAMM J. Appl. Math. Mech."},{"issue":"7","key":"2351_CR28","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1016\/j.laa.2010.05.025","volume":"433","author":"K Braman","year":"2010","unstructured":"Braman, K.: Third-order tensors as linear operators on a space of matrices. Linear Algebra Appl. 433(7), 1241\u20131253 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"2351_CR29","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.laa.2010.09.020","volume":"435","author":"ME Kilmer","year":"2011","unstructured":"Kilmer, M.E., Martin, C.D.: Factorization strategies for third-order tensors. Linear Algebra Appl. 435(3), 641\u2013658 (2011)","journal-title":"Linear Algebra Appl."},{"key":"2351_CR30","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: IEEE Conf. Comput. Vis. Pattern Recognit. 44(9), 3842\u20133849 (2014)","DOI":"10.1109\/CVPR.2014.485"},{"issue":"1","key":"2351_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., Hoover, R.C.: Facial recognition using tensor decompositions. SIAM J. Imaging Sci. 6(1), 437\u2013463 (2013)","journal-title":"SIAM J. Imaging Sci."},{"key":"2351_CR32","doi-asserted-by":"crossref","unstructured":"Zhou, P., Feng, J.: Outlier-robust tensor PCA. IEEE Conf. Comput. Vis. Pattern Recognit. 3938-3946 (2017)","DOI":"10.1109\/CVPR.2017.419"},{"issue":"3","key":"2351_CR33","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1109\/TIP.2017.2762595","volume":"27","author":"P Zhou","year":"2018","unstructured":"Zhou, P., Lu, C., Lin, Z., Zhang, C.: Tensor factorization for low-rank tensor completion. IEEE T. Image Process. 27(3), 1152\u20131163 (2018)","journal-title":"IEEE T. Image Process."},{"issue":"4","key":"2351_CR34","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1080\/03081087.2015.1083933","volume":"64","author":"L Sun","year":"2016","unstructured":"Sun, L., Zheng, B., Bu, C.: Moore-Penrose inverse of tensors via Einstein product. J. Linear Multilinear A. 64(4), 686\u2013698 (2016)","journal-title":"J. Linear Multilinear A."},{"issue":"7","key":"2351_CR35","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1080\/03081087.2018.1452889","volume":"67","author":"QW Wang","year":"2019","unstructured":"Wang, Q.W., Xu, X.: Iterative algorithms for solving some tensor equations. J. Linear Multilinear A. 67(7), 1325\u20131349 (2019)","journal-title":"J. Linear Multilinear A."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02351-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-024-02351-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02351-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T06:11:12Z","timestamp":1757139072000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-024-02351-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,19]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2351"],"URL":"https:\/\/doi.org\/10.1007\/s12190-024-02351-6","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2025,2,19]]},"assertion":[{"value":"30 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential Conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}