{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:58Z","timestamp":1740142498572,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T00:00:00Z","timestamp":1630627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T00:00:00Z","timestamp":1630627200000},"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":["11771393","11632015"],"award-info":[{"award-number":["11771393","11632015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s40314-021-01628-x","type":"journal-article","created":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T20:35:05Z","timestamp":1630701305000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Lopsided DSS iteration method for solving complex Sylvester matrix equation"],"prefix":"10.1007","volume":"40","author":[{"given":"Yu-Ye","family":"Feng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2706-6264","authenticated-orcid":false,"given":"Qing-Biao","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Zhe-Wei","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,3]]},"reference":[{"issue":"3","key":"1628_CR1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1109\/TCS.1986.1085912","volume":"33","author":"BDO Anderson","year":"1986","unstructured":"Anderson BDO, Agathoklis P, Jury EI, Mansour M (1986) Stability and the matrix Lyapunov equation for discrete 2-dimensional systems. IEEE Trans. Circuits Syst 33(3), 261\u2013267","journal-title":"IEEE Trans Circ Syst"},{"issue":"2","key":"1628_CR2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.4208\/jcm.1009-m3152","volume":"29","author":"Z-Z Bai","year":"2011","unstructured":"Bai Z-Z (2011) On Hermitian and skew-Hermitian splitting iteration methods for continuous Sylvester equations. J Comput Math 29(2), 185\u2013198","journal-title":"J Comput Math"},{"issue":"2","key":"1628_CR3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s00211-003-0454-0","volume":"96","author":"Z-Z Bai","year":"2003","unstructured":"Bai Z-Z, Ng MK (2003) Preconditioners for nonsymmetric block Toeplitz-like-plus-diagonal linear systems. Numer Math 96(2), 197\u2013220","journal-title":"Numer Math"},{"issue":"3","key":"1628_CR4","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1137\/S0895479801395458","volume":"24","author":"Z-Z Bai","year":"2003","unstructured":"Bai Z-Z, Golub GH, Ng MK (2003) Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems. SIAM J Matrix Anal Appl 24(3), 603\u2013626","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"3\u20134","key":"1628_CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s00607-010-0077-0","volume":"87","author":"Z-Z Bai","year":"2010","unstructured":"Bai Z-Z, Benzi M, Chen F (2010) Modified HSS iteration methods for a class of complex symmetric linear systems. Computing 87(3\u20134), 93\u2013111","journal-title":"Computing"},{"issue":"2","key":"1628_CR6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s11075-010-9441-6","volume":"56","author":"Z-Z Bai","year":"2011","unstructured":"Bai Z-Z, Benzi M, Chen F (2011) On preconditioned MHSS iteration methods for complex symmetric linear systems. Numer Algorithms 56(2), 297\u2013317","journal-title":"Numer Algorithms"},{"key":"1628_CR7","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1145\/361573.361582","volume":"15","author":"RH Bartels","year":"1972","unstructured":"Bartels RH, Stewart GW (1972) Algorithm 432: solution of the matrix equation $$AX + XB = C$$. Commun ACM 15:820\u2013826","journal-title":"Commun ACM"},{"issue":"4","key":"1628_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10092-019-0348-x","volume":"56","author":"M Behr","year":"2019","unstructured":"Behr M, Benner P, Heiland J (2019) Solution formulas for differential Sylvester and Lyapunov equations. Calcolo 56(4):51","journal-title":"Calcolo"},{"issue":"1","key":"1628_CR9","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1137\/S0895479894273687","volume":"17","author":"D Calvetti","year":"1996","unstructured":"Calvetti D, Reichel L (1996) Application of ADI iterative methods to the restoration of noisy images. SIAM J Matrix Anal Appl 17(1), 165\u2013186","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"9\u201310","key":"1628_CR10","doi-asserted-by":"crossref","first-page":"1937","DOI":"10.1016\/j.mcm.2008.12.014","volume":"49","author":"M Dehghan","year":"2009","unstructured":"Dehghan M, Hajarian M (2009) Finite iterative algorithms for the reflexive and anti-reflexive solutions of the matrix equation $$A_1X_1B_1+A_2X_2B_2=C$$. Math Comput Model 49(9\u201310), 1937\u20131959","journal-title":"Math Comput Model"},{"issue":"6","key":"1628_CR11","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1080\/00207720903072357","volume":"41","author":"M Dehghan","year":"2010","unstructured":"Dehghan M, Hajarian M (2010) On the reflexive and anti-reflexive solutions of the generalized coupled Sylvester matrix equations. Int J. Syst Sci 41(6), 607\u2013625","journal-title":"Int J Syst Sci"},{"key":"1628_CR12","first-page":"632","volume":"348","author":"M Dehghan","year":"2019","unstructured":"Dehghan M, Shirilord A (2019) A generalized modified Hermitian and skew-Hermitian splitting (GMHSS) method for solving complex Sylvester matrix equation. Appl Math Comput 348:632\u2013651","journal-title":"Appl Math Comput"},{"issue":"3","key":"1628_CR13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/s40314-019-0921-6","volume":"38","author":"M Dehghan","year":"2019","unstructured":"Dehghan M, Shirilord A (2019) The double-step scale splitting method for solving complex Sylvester matrix equation. Comput Appl Math 38(3):146","journal-title":"Comput Appl Math"},{"key":"1628_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-020-01126-4","author":"M Dehghan","year":"2020","unstructured":"Dehghan M, Shirilord A (2020) Two lopsided TSCSP (LTSCSP) iteration methods for solution of complex symmetric positive definite linear systems. Eng Comput. doi: 10.1007\/s00366-020-01126-4","journal-title":"Eng Comput"},{"issue":"1","key":"1628_CR15","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s00366-019-00838-6","volume":"37","author":"M Dehghan","year":"2021","unstructured":"Dehghan M, Shirilord A (2021) Solving complex Sylvester matrix equation by accelerated double-step scale splitting (ADSS) method. Eng Comput 37(1), 489\u2013508","journal-title":"Eng Comput"},{"issue":"5","key":"1628_CR16","doi-asserted-by":"crossref","first-page":"600","DOI":"10.4208\/jcm.1607-m2016-0613","volume":"35","author":"Y-X Dong","year":"2017","unstructured":"Dong Y-X, Gu C-Q (2017) On PMHSS iteration methods for continuous Sylvester equations. J Comput Math 35(5), 600\u2013619","journal-title":"J Comput Math"},{"issue":"6","key":"1628_CR17","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1109\/TAC.1979.1102170","volume":"24","author":"GH Golub","year":"1979","unstructured":"Golub GH, Nash S, Van Loan C (1979) A Hessenberg-Schur method for the problem $$AX + XB= C$$. IEEE Trans Autom Control 24(6), 909\u2013913","journal-title":"IEEE Trans Autom Control"},{"issue":"13","key":"1628_CR18","doi-asserted-by":"crossref","first-page":"2017","DOI":"10.1002\/mma.2955","volume":"37","author":"M Hajarian","year":"2014","unstructured":"Hajarian M (2014) Extending LSQR methods to solve the generalized Sylvester-transpose and periodic Sylvester matrix equations. Math Method Appl Sci 37(13), 2017\u20132028","journal-title":"Math Method Appl Sci"},{"key":"1628_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-1600-8","volume-title":"Applications of lyapunov methods in stability","author":"A Halanay","year":"1993","unstructured":"Halanay A, R\u0103svan V (1993) Applications of Lyapunov Methods in Stability. Kluwer Academic Publishers, Dordrecht"},{"key":"1628_CR20","doi-asserted-by":"crossref","first-page":"106818","DOI":"10.1016\/j.aml.2020.106818","volume":"112","author":"B Hashemi","year":"2021","unstructured":"Hashemi B (2021) Sufficient conditions for the solvability of a Sylvester-like absolute value matrix equation. Appl Math Lett 112:106818","journal-title":"Appl Math Lett"},{"issue":"4","key":"1628_CR21","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1007\/s11075-016-0123-x","volume":"73","author":"D Hezari","year":"2016","unstructured":"Hezari D, Salkuyeh DK, Edalatpour V (2016) A new iterative method for solving a class of complex symmetric system of linear equations. Numer. Algorithms 73(4), 927\u2013955","journal-title":"Numer. Algorithms"},{"issue":"1","key":"1628_CR22","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s11075-018-0553-8","volume":"81","author":"B-H Huang","year":"2019","unstructured":"Huang B-H, Ma C-F (2019) Finite iterative algorithm for the symmetric periodic least squares solutions of a class of periodic Sylvester matrix equations. Numer Algorithms 81(1), 377\u2013406","journal-title":"Numer Algorithms"},{"issue":"1","key":"1628_CR23","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/37.16743","volume":"9","author":"MD Ilic","year":"1989","unstructured":"Ilic MD (1989) New approaches to voltage monitoring and control. IEEE Control Syst Mag 9(1), 5\u201311","journal-title":"IEEE Control Syst Mag"},{"issue":"11","key":"1628_CR24","doi-asserted-by":"crossref","first-page":"2268","DOI":"10.1080\/03081087.2016.1271387","volume":"65","author":"Y-F Ke","year":"2017","unstructured":"Ke Y-F, Ma C-F (2017) Alternating direction methods for solving a class of Sylvester-like matrix equations $$(AXB, CXD)=(G, H)$$. Linear Multilinear Algebra 65(11), 2268\u20132292","journal-title":"Linear Multilinear Algebra"},{"key":"1628_CR25","first-page":"578102","volume":"2014","author":"X Li","year":"2014","unstructured":"Li X, Wu Y-J, Yang A-L, Yuan J-Y (2014) A generalized HSS iteration method for continuous Sylvester equations. J Appl Math 2014:578102","journal-title":"J Appl Math"},{"issue":"4","key":"1628_CR26","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1016\/j.camwa.2017.10.028","volume":"75","author":"X Li","year":"2018","unstructured":"Li X, Huo H-F, Yang A-L (2018) Preconditioned HSS iteration method and its non-alternating variant for continuous Sylvester equations. Comput Math Appl 75(4), 1095\u20131106","journal-title":"Comput Math Appl"},{"issue":"1","key":"1628_CR27","first-page":"9","volume":"24","author":"A-P Liao","year":"2002","unstructured":"Liao A-P, Bai Z-Z (2002) Least-squares solutions of the matrix equation $$A^TXA = D$$ in bisymmetric matrix set. Math Numer Sinica 24(1), 9\u201320","journal-title":"Math Numer Sinica"},{"issue":"2","key":"1628_CR28","first-page":"175","volume":"21","author":"A-P Liao","year":"2003","unstructured":"Liao A-P, Bai Z-Z (2003) Least-squares solution of $$AXB = D$$ over symmetric positive semidefinite matrices X. J Comput Math 21(2), 175\u2013182","journal-title":"J Comput Math"},{"issue":"3","key":"1628_CR29","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/040615791","volume":"27","author":"A-P Liao","year":"2005","unstructured":"Liao A-P, Bai Z-Z, Lei Y (2005) Best approximate solution of matrix equation $$AXB + CYD = E$$. SIAM J Matrix Anal Appl 27(3), 675\u2013688","journal-title":"SIAM J Matrix Anal Appl"},{"key":"1628_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.neucom.2019.10.080","volume":"379","author":"S Liao","year":"2020","unstructured":"Liao S, Liu J-Y, Xiao X-C, Fu D-Y, Wang G-C, Jin L (2020) Modified gradient neural networks for solving the time-varying Sylvester equation with adaptive coefficients and elimination of matrix inversion. Neurocomputing 379:1\u201311","journal-title":"Neurocomputing"},{"issue":"2","key":"1628_CR31","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s13160-018-0307-y","volume":"35","author":"S Miyajima","year":"2018","unstructured":"Miyajima S (2018) Fast verified computation for the solution of the T-congruence Sylvester equation. Jpn J Ind Appl Math 35(2), 541\u2013551","journal-title":"Jpn J Ind Appl Math"},{"key":"1628_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0283-0","volume-title":"Model reduction for control system design","author":"G Obinata","year":"2001","unstructured":"Obinata G, Anderson BDO (2001) Model Reduction for Control System Design. Springer, London"},{"key":"1628_CR33","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.cam.2017.05.044","volume":"329","author":"M Oozawa","year":"2018","unstructured":"Oozawa M, Sogabe T, Miyatake Y, Zhang S-L (2018) On a relationship between the T-congruence Sylvester equation and the Lyapunov equation. J Comput Appl Math 329:51\u201356","journal-title":"J Comput Appl Math"},{"issue":"1","key":"1628_CR34","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1177\/0142331216656759","volume":"40","author":"DK Salkuyeh","year":"2018","unstructured":"Salkuyeh DK, Bastani M (2018) A new generalization of the Hermitian and skew-Hermitian splitting method for solving the continuous Sylvester equation. Trans Inst Meas Control 40(1), 303\u2013317","journal-title":"Trans Inst Meas Control"},{"key":"1628_CR35","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.aml.2019.04.007","volume":"96","author":"Y Satake","year":"2019","unstructured":"Satake Y, Oozawa M, Sogabe T, Miyatake Y, Kemmochi T, Zhang S-L (2019) Relation between the T-congruence Sylvester equation and the generalized Sylvester equation. Appl Math Lett 96:7\u201313","journal-title":"Appl Math Lett"},{"issue":"5","key":"1628_CR36","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1080\/10556788.2020.1734004","volume":"35","author":"Y Satake","year":"2020","unstructured":"Satake Y, Sogabe T, Kemmochi T, Zhang S-L (2020) On a transformation of the (*)-congruence Sylvester equation for the least squares optimization. Optim Method Softw 35(5), 974\u2013981","journal-title":"Optim Method Softw"},{"issue":"7","key":"1628_CR37","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1177\/0142331215588808","volume":"38","author":"C-Q Song","year":"2016","unstructured":"Song C-Q, Feng J-E (2016) An iterative algorithm to solve the generalized coupled Sylvester-transpose matrix equations. Trans Inst Meas Control 38(7), 863\u2013875","journal-title":"Trans Inst Meas Control"},{"key":"1628_CR38","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.laa.2015.11.037","volume":"493","author":"FD Ter\u00e1n","year":"2016","unstructured":"Ter\u00e1n FD, Iannazzo B (2016) Uniqueness of solution of a generalized $$\\star $$-Sylvester matrix equation. Linear Alg Appl 493:323\u2013335","journal-title":"Linear Alg Appl"},{"key":"1628_CR39","doi-asserted-by":"crossref","first-page":"106966","DOI":"10.1016\/j.aml.2020.106966","volume":"116","author":"L-M Wang","year":"2021","unstructured":"Wang L-M, Li C-X (2021) New sufficient conditions for the unique solution of a square Sylvester-like absolute value equation. Appl Math Lett 116:106966","journal-title":"Appl Math Lett"},{"issue":"11","key":"1628_CR40","doi-asserted-by":"crossref","first-page":"2352","DOI":"10.1016\/j.camwa.2013.09.011","volume":"66","author":"X Wang","year":"2013","unstructured":"Wang X, Li W-W, Mao L-Z (2013) On positive-definite and skew-Hermitian splitting iteration methods for continuous Sylvester equation $$AX+XB=C$$. Comput Math Appl 66(11), 2352\u20132361","journal-title":"Comput Math Appl"},{"key":"1628_CR41","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.matcom.2020.06.014","volume":"178","author":"L Xiao","year":"2020","unstructured":"Xiao L, Yi Q, Zuo Q-Y, He Y-J (2020) Improved finite-time zeroing neural networks for time-varying complex Sylvester equation solving. Math Comput Simul 178:246\u2013258","journal-title":"Math Comput Simul"},{"key":"1628_CR42","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.neucom.2019.12.053","volume":"386","author":"Y-N Zhang","year":"2020","unstructured":"Zhang Y-N, Ling Y-H, Li S, Yang M, Tan N (2020) Discrete-time zeroing neural network for solving time-varying Sylvester-transpose matrix inequation via exp-aided conversion. Neurocomputing 386:126\u2013135","journal-title":"Neurocomputing"},{"key":"1628_CR43","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.cam.2014.02.025","volume":"268","author":"Q-Q Zheng","year":"2014","unstructured":"Zheng Q-Q, Ma C-F (2014) On normal and skew-Hermitian splitting iteration methods for large sparse continuous Sylvester equations. J Comput Appl Math 268:145\u2013154","journal-title":"J Comput Appl Math"},{"key":"1628_CR44","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.aml.2017.04.017","volume":"73","author":"Z Zheng","year":"2017","unstructured":"Zheng Z, Huang F-L, Peng Y-C (2017) Double-step scale splitting iteration method for a class of complex symmetric linear systems. Appl Math Lett 73:91\u201397","journal-title":"Appl Math Lett"},{"key":"1628_CR45","first-page":"84","volume":"263","author":"D-M Zhou","year":"2015","unstructured":"Zhou D-M, Chen G-L, Cai Q-Y (2015) On modified HSS iteration methods for continuous Sylvester equations. Appl Math Comput 263:84\u201393","journal-title":"Appl Math Comput"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01628-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-021-01628-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01628-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T12:05:22Z","timestamp":1633608322000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-021-01628-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,3]]},"references-count":45,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["1628"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01628-x","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2021,9,3]]},"assertion":[{"value":"29 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2021","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 that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"235"}}