{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:01:35Z","timestamp":1776844895984,"version":"3.51.2"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,7,10]],"date-time":"2014-07-10T00:00:00Z","timestamp":1404950400000},"content-version":"tdm","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":[[2015,1]]},"DOI":"10.1007\/s11075-014-9885-1","type":"journal-article","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T01:02:20Z","timestamp":1404867740000},"page":"121-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A computational framework of gradient flows for general linear matrix equations"],"prefix":"10.1007","volume":"68","author":[{"given":"Liqi","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moody T.","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Bo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"key":"9885_CR1","unstructured":"P.-A. Absil, R. Mahony, B. Andrews: Convergence of the iterates of descent methods for analytic cost functions. SIAM. J. Optim. 16, 531\u2013547 (2005)"},{"key":"9885_CR2","doi-asserted-by":"crossref","unstructured":"P.-A. Absil, R. Mahony, R. Sepulchre: Optimization algorithms on matrix manifolds, Princeton University Press. NJ, Princeton (2008)","DOI":"10.1515\/9781400830244"},{"key":"9885_CR3","unstructured":"L. Ambrosio, N. Gigli, G. Savar\u00e9: Gradient flows in metric spaces and in the space of probability measures, Lectures in Mathematics ETH Z\u00fcrich. Basel, second ed., Birkh\u00e4user Verlag (2008)"},{"key":"9885_CR4","doi-asserted-by":"crossref","unstructured":"A. C. Antoulas: Approximation of large-scale dynamical systems, vol. 6 of Advances in Design and Control, Society for Industrial and Applied Mathematics (SIAM), Philadelphia. With a foreword by Jan C. Willems, PA (2005)","DOI":"10.1137\/1.9780898718713"},{"key":"9885_CR5","doi-asserted-by":"crossref","unstructured":"J. K. Baksalary, R. Kala: The matrix equation A X\u2212Y B=C. Linear Algebra Appl. 25, 41\u201343 (1979)","DOI":"10.1016\/0024-3795(79)90004-1"},{"key":"9885_CR6","unstructured":"W. Behrman: An efficient gradient flow method for unconstrained optimization. Stanford University, PhD thesis (1998)"},{"key":"9885_CR7","doi-asserted-by":"crossref","unstructured":"R. Bhatia, P. Rosenthal: How and why to solve the operator equation A X\u2212X B=Y. Bull. London Math. Soc. 29, 1\u201321 (1997)","DOI":"10.1112\/S0024609396001828"},{"key":"9885_CR8","unstructured":"H. W. Braden: The equations A T X \u00b1X T A=B. SIAM J. Matrix Anal. Appl. 20, 295\u2013302 (1999). electronic"},{"key":"9885_CR9","doi-asserted-by":"crossref","unstructured":"J. Carr: Applications of centre manifold theory, vol. 35 of Applied Mathematical Sciences. Springer-Verlag, New York (1981)","DOI":"10.1007\/978-1-4612-5929-9"},{"key":"9885_CR10","doi-asserted-by":"crossref","unstructured":"R. Chill: On the \u0141ojasiewicz-Simon gradient inequality. J.Funct. Anal. 201, 572\u2013601 (2003)","DOI":"10.1016\/S0022-1236(02)00102-7"},{"key":"9885_CR11","doi-asserted-by":"crossref","unstructured":"M. T. Chu: Linear algebra algorithms as dynamical systems. Acta Numerica 17, 1\u201386 (2008)","DOI":"10.1017\/S0962492906340019"},{"key":"9885_CR12","doi-asserted-by":"crossref","unstructured":"H. Dai, P. Lancaster: Linear matrix equations from an inverse problem of vibration theory. Linear Algebra Appl. 246, 31\u201347 (1996)","DOI":"10.1016\/0024-3795(94)00311-4"},{"key":"9885_CR13","doi-asserted-by":"crossref","unstructured":"F. De Ter\u00e1n, F. M. Dopico, N. Guillery, D. Montealegre, N. Reyes: The solution of the equation A X+X \u22c6 B=0. Linear Algebra Appl. 438, 2817\u20132860 (2013)","DOI":"10.1016\/j.laa.2012.11.014"},{"key":"9885_CR14","unstructured":"M. Dehghan, M. Hajarian: An efficient algorithm for solving general coupled matrix equations and its application. Math. Comput. Modelling 51, 1118\u20131134 (2010)"},{"key":"9885_CR15","doi-asserted-by":"crossref","unstructured":"F. Ding, T. Chen: On iterative solutions of general coupled matrix equations. SIAM J. Control Optim. 44, 2269\u20132284 (electronic). (2006)","DOI":"10.1137\/S0363012904441350"},{"key":"9885_CR16","doi-asserted-by":"crossref","unstructured":"P. A. Fuhrmann: A functional approach to the Stein equation. Linear Algebra Appl. 432, 3031\u20133071 (2010)","DOI":"10.1016\/j.laa.2010.02.001"},{"key":"9885_CR17","unstructured":"Z. Gajic, M. T. J. Qureshi: Lyapunov matrix equation in system stability and control, vol. 195 of Mathematics in Science and Engineering, Academic Press Inc. CA, San Diego (1995)"},{"key":"9885_CR18","doi-asserted-by":"crossref","unstructured":"S. R. Garcia, A. L. Shoemaker: On the matrix equation X A+A X T =0. Linear Algebra Appl. 438, 2740\u20132746 (2013)","DOI":"10.1016\/j.laa.2012.10.041"},{"key":"9885_CR19","unstructured":"J. D. Gardiner, A. J. Laub, J. J. Amato, C. B. Moler: Solution of the Sylvester matrix equation A X B \u22a4+C X D \u22a4=E. ACM Trans. Math. Software 18, 223\u2013231 (1992)"},{"key":"9885_CR20","doi-asserted-by":"crossref","unstructured":"N. J. Higham: Functions of matrices, Society for Industrial and Applied Mathematics (SIAM). Philadelphia PA, Theory and computation (2008)","DOI":"10.1137\/1.9780898717778"},{"key":"9885_CR21","doi-asserted-by":"crossref","unstructured":"R. A. Horn, C. R. Johnson: Topics in matrix analysis. Cambridge University Press, Cambridge (1991)","DOI":"10.1017\/CBO9780511840371"},{"key":"9885_CR22","unstructured":"D. Y. Hu, L. Reichel: Krylov-subspace methods for the sylvester equation."},{"key":"9885_CR23","unstructured":"K. D. Ikramov: On conditions for the unique solvability of the matrix equation A X+X T B=C. Dokl Akad. Nauk 430, 444\u2013447 (2010)"},{"key":"9885_CR24","unstructured":"B. K\u00e5gstr\u00f6m: A perturbation analysis of the generalized Sylvester equation (A R\u2212L B,D R\u2212L E)=(C,F). SIAM J. Matrix Anal. Appl. 15, 1045\u20131060 (1994)"},{"key":"9885_CR25","doi-asserted-by":"crossref","unstructured":"C. T. Kelley , D. E. Keyes: Convergence analysis of pseudo-transient continuation. SIAM J. Numer. Anal. 35, 508\u2013523 (electronic). (1998)","DOI":"10.1137\/S0036142996304796"},{"key":"9885_CR26","unstructured":"C. T. Kelley, L.-Z. Liao, L. Qi, M. T. Chu, J. P. Reese, C. Winton: Projected pseudotransient continuation. SIAM J. Numer. Anal. 46, 3071\u20133083 (2008)"},{"key":"9885_CR27","doi-asserted-by":"crossref","unstructured":"A. Klein, P. Spreij: On Stein\u2019s equation, Vandermonde matrices and Fisher\u2019s information matrix of time series processes. I. The autoregressive moving average process. Linear Algebra Appl. 329, 9\u201347 (2001)","DOI":"10.1016\/S0024-3795(01)00231-2"},{"key":"9885_CR28","doi-asserted-by":"crossref","unstructured":"O. Koch, C. Lubich: Dynamical low-rank approximation. SIAM J. Matrix Anal. Appl. 29, 434\u2013454 (2007)","DOI":"10.1137\/050639703"},{"key":"9885_CR29","unstructured":"M. Konstantinov , D.-W. Gu, V. Mehrmann, P. Petkov: Perturbation theory for matrix equations, vol. 9 of Studies in Computational Mathematics. North-Holland Publishing Co., Amsterdam (2003)"},{"key":"9885_CR30","doi-asserted-by":"crossref","unstructured":"P. Lancaster: Explicit solutions of linear matrix equations. SIAM Rev. 12, 544\u2013566 (1970)","DOI":"10.1137\/1012104"},{"key":"9885_CR31","doi-asserted-by":"crossref","unstructured":"L. Lerer, A. C. M. Ran: A new inertia theorem for Stein equations, inertia of invertible Hermitian block Toeplitz matrices and matrix orthogonal polynomials. Integral Equations Operator Theory 47, 339\u2013360 (2003)","DOI":"10.1007\/s00020-003-1166-7"},{"key":"9885_CR32","doi-asserted-by":"crossref","unstructured":"S. Li, Y. Li: Nonlinearly activated neural network for solving time-varying complex sylvester equation, p 285166. IEEE Transactions on Cybernetics (2013)","DOI":"10.1109\/TCYB.2013.2285166"},{"key":"9885_CR33","unstructured":"A.-P. Liao, Z.-Z. Bai: Least squares symmetric and skew-symmetric solutions of the matrix equation A X A T +B Y B T =C with the least norm. Math. Numer. Sin. 27, 81\u201395 (2005)"},{"key":"9885_CR34","unstructured":"A.-P. Liao, Z.-Z. Bai, Y. Lei: Best approximate solution of matrix equation A X B+C Y D=E, SIAM. J. Matrix Anal. Appl. 27, 675\u2013688 (2005)"},{"key":"9885_CR35","unstructured":"A.-P. Liao, Y. Lei, X.-Y. Hu: Least-squares solution with the minimum-norm for the matrix equation A T X B+B T X T A=D and its applications. Acta Math. Appl. Sin Engl. Ser. 23, 269\u2013280 (2007)"},{"key":"9885_CR36","unstructured":"S. \u0141ojasiewicz: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els, in Les \u00c9quations aux D\u00e9riv\u00e9es Partielles (Paris, 1962), pp 87\u201389. \u00c9ditions du Centre National de la Recherche Scientifique, Paris (1963)"},{"key":"9885_CR37","unstructured":"S. \u0141ojasiewicz, M.-A. Zurro: On the gradient inequality. Bull. Polish Acad. Sci. Math. 47, 143\u2013145 (1999)"},{"key":"9885_CR38","doi-asserted-by":"crossref","unstructured":"C. Lubich, I. V. Oseledets: A projector-splitting integrator for dynamical low-rank approximation. BIT 54, 171\u2013188 (2014)","DOI":"10.1007\/s10543-013-0454-0"},{"key":"9885_CR39","unstructured":"A. G. Mazko: Matrix equations, spectral problems and stability of dynamic systems, vol. 2 of Stability, Oscillations and Optimization of Systems. Cambridge Scientific Publishers, Cambridge (2008)"},{"key":"9885_CR40","unstructured":"C. C. K. Mikkelsen: Numerical Methods for Large Lyapunov Equation, PhD thesis, Purdue University. West Lafayette, Indianna (2009)"},{"key":"9885_CR41","unstructured":"J. Nocedal, S. J. Wright: Numerical optimization, Springer Series in Operations Research and Financial Engineering. Springer, New York, second ed. (2006)"},{"key":"9885_CR42","unstructured":"A. B. \u00d6zg\u00fcler: The equation A X B+C Y D=E over a principal ideal domain. SIAM. J. Matrix Anal. Appl. 12, 581\u2013591 (1991)"},{"key":"9885_CR43","unstructured":"N. Parikh, S. Boyd: Proximal algorithms. Foundation and Trends in Optimization 1, 123\u2013231 (2013)"},{"key":"9885_CR44","doi-asserted-by":"crossref","unstructured":"Z.-Y. Peng, Y.-X. Peng: An efficient iterative method for solving the matrix equation A X B+C Y D=E. Numer Linear Algebra Appl. 13, 473\u2013485 (2006)","DOI":"10.1002\/nla.470"},{"key":"9885_CR45","unstructured":"M. Pierre: Quelques applications de l\u2019in\u00e9galit\u00b4e de Lojasiewicz \u00e0 des discr\u00e9tisations d\u2019EDP. SMAI (2011). URL http:\/\/smai.emath.fr\/smai2011\/slides\/mpierre\/Slides.pdf ."},{"key":"9885_CR46","doi-asserted-by":"crossref","unstructured":"M. Robb, M. Sadkane: A convergence analysis of GMRES and FOM methods for Sylvester equations. Numerical Algorithms 30, 71\u201389 (2002)","DOI":"10.1023\/A:1015615310584"},{"key":"9885_CR47","unstructured":"W. E. Sadkane: The equations A X\u2212Y B=C and A X\u2212X B=C in matrices. Proc. Amer. Math. Soc. 3, 392\u2013396 (1952)"},{"key":"9885_CR48","doi-asserted-by":"crossref","unstructured":"F. C. Silva, R. Sim\u00f5es: On the Lyapunov and Stein equations. II. Linear Algebra Appl. 426, 305\u2013311 (2007)","DOI":"10.1016\/j.laa.2007.05.001"},{"key":"9885_CR49","unstructured":"V. Simocini: Computational methods for linear matrix equation, survey article, Universit\u00e0 di Bologna. Bologna, Italy (2013). URL http:\/\/www.dm.unibo.it\/simoncin\/matrixeq.pdf ."},{"key":"9885_CR50","doi-asserted-by":"crossref","unstructured":"M. J. Todd: Semidefinite optimization. Acta Numer. 10, 515\u2013560 (2001)","DOI":"10.1017\/S0962492901000071"},{"key":"9885_CR51","doi-asserted-by":"crossref","unstructured":"P. M. Van Dooren: Structured linear algebra problems in digital signal processing, in Numerical linear algebra, digital signal processing and parallel algorithms (Leuven, 1988) vol. 70 of NATO Adv. Sci. Inst. Ser. F Comput. Systems Sci., pp 361\u2013384. Springer, Berlin (1991)","DOI":"10.1007\/978-3-642-75536-1_17"},{"key":"9885_CR52","doi-asserted-by":"crossref","unstructured":"C. F. Van Loan: The ubiquitous Kronecker product, J. Comput. Appl. Math., 123 (2000), pp. 85\u2013100. Vol. III. Linear algebra, Numerical analysis (2000)","DOI":"10.1016\/S0377-0427(00)00393-9"},{"key":"9885_CR53","doi-asserted-by":"crossref","unstructured":"L. Vandenberghe, S. Boyd: Semidefinite programming. SIAM Rev. 38, 49\u201395 (1996)","DOI":"10.1137\/1038003"},{"key":"9885_CR54","doi-asserted-by":"crossref","unstructured":"B. Vandereycken, S. Vandewalle: A Riemannian optimization approach for computing low-rank solutions of Lyapunov equations. SIAM Journal on Matrix Analysis and Applications 31, 2553\u20132579 (2010)","DOI":"10.1137\/090764566"},{"key":"9885_CR55","doi-asserted-by":"crossref","unstructured":"G. Xu, M. Wei, D, Zheng: On solutions of matrix equation A X B+C Y D=F. Linear Algebra Appl. 279, 93\u2013109 (1998)","DOI":"10.1016\/S0024-3795(97)10099-4"},{"key":"9885_CR56","doi-asserted-by":"crossref","unstructured":"J.-J. Zhang: A note on the iterative solutions of general coupled matrix equation. Appl Math. Comput. 217, 9380\u20139386 (2011)","DOI":"10.1016\/j.amc.2011.04.026"},{"key":"9885_CR57","doi-asserted-by":"crossref","unstructured":"B. Zhou, G.-R. Duan, Z.-Y. Li: Gradient based iterative algorithm for solving coupled matrix equations. Systems Control Lett. 58, 327\u2013333 (2009)","DOI":"10.1016\/j.sysconle.2008.12.004"},{"key":"9885_CR58","unstructured":"B. Zhou, J. Lam, G.-R. Duan: Gradient-based maximal convergence rate iterative method for solving linear matrix equations. Int. J. Comput. Math. 87, 515\u2013527 (2010)"},{"key":"9885_CR59","doi-asserted-by":"crossref","unstructured":"K. Zie\u0327tak: On a particular case of the inconsistent linear matrix equation A X+Y B=C. Linear Algebra Appl. 66, 249\u2013258 (1985)","DOI":"10.1016\/0024-3795(85)90136-3"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9885-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-014-9885-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9885-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:26:25Z","timestamp":1746296785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-014-9885-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,10]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9885"],"URL":"https:\/\/doi.org\/10.1007\/s11075-014-9885-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,10]]}}}