{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:27:22Z","timestamp":1768339642498,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numerical Algorithms"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1023\/a:1015615310584","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T19:13:07Z","timestamp":1041189187000},"page":"71-89","source":"Crossref","is-referenced-by-count":38,"title":["A Convergence Analysis of Gmres and Fom Methods for Sylvester Equations"],"prefix":"10.1007","volume":"30","author":[{"given":"Micka\u00ebl","family":"Robb\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miloud","family":"Sadkane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"401377_CR1","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1145\/361573.361582","volume":"15","author":"R. Bartels","year":"1972","unstructured":"R. Bartels and G.W. Stewart, Algorithm 432: Solution of the matrix equation AX + XB = C, Comm. ACM 15 (1972) 820-826.","journal-title":"Comm. ACM"},{"key":"401377_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical Methods for Least Squares Problems","author":"A. Bj\u00f6rck","year":"1996","unstructured":"A. Bj\u00f6rck, Numerical Methods for Least Squares Problems (SIAM, Philadelphia, PA, 1996)."},{"key":"401377_CR3","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1002\/nla.254","volume":"8","author":"D. Calvetti","year":"2001","unstructured":"D. Calvetti, B. Lewis and L. Reichel, On the solution of large Sylvester-obesrver equations, Numer. Linear Algebra Appl. 8 (2001) 435-451.","journal-title":"Numer. Linear Algebra Appl."},{"key":"401377_CR4","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/0024-3795(94)90512-6","volume":"198","author":"B. Datta","year":"1994","unstructured":"B. Datta, Numerical linear algebra in control theory, Linear Algebra Appl. 198 (1994) 755-790.","journal-title":"Linear Algebra Appl."},{"key":"401377_CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0024-3795(91)90378-A","volume":"154-156","author":"B. Datta","year":"1991","unstructured":"B. Datta and Y. Saad, Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment, Linear Algebra Appl. 154-156 (1991) 225-244.","journal-title":"Linear Algebra Appl."},{"key":"401377_CR6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0024-3795(93)90530-2","volume":"180","author":"M. Eiermann","year":"1993","unstructured":"M. Eiermann, Fields of values and iterative methods, Linear Algebra Appl. 180 (1993) 167-197.","journal-title":"Linear Algebra Appl."},{"key":"401377_CR7","unstructured":"A. El Guennouni, K. Jbilou and J. Riquet, Block Krylov subspace methods for solving large Sylvester equations, Preprint LMPA, No. 132 (2000), Universit\u00e9 du Littoral, to appear in Numer. Algorithms."},{"key":"401377_CR8","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1109\/TAC.1979.1102170","volume":"24","author":"G.H. Golub","year":"1979","unstructured":"G.H. Golub, S. Nash and C. Van Loan, A Hessenberg-Schur method for the problem AX+XB = C, IEEE Trans. Automat. Control 24 (1979) 909-913.","journal-title":"IEEE Trans. Automat. Control"},{"key":"401377_CR9","volume-title":"Matrix Computation","author":"G.H. Golub","year":"1989","unstructured":"G.H. Golub and C.F. Van Loan, Matrix Computation, 2nd edn (Johns Hopkins Univ. Press, Baltimore, MD, 1989).","edition":"2nd edn"},{"key":"401377_CR10","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0024-3795(92)90031-5","volume":"174","author":"D.Y. Hu","year":"1992","unstructured":"D.Y. Hu and L. Reichel, Krylov subspace methods for the Sylvester equations, Linear Algebra Appl. 174 (1992) 283-314.","journal-title":"Linear Algebra Appl."},{"key":"401377_CR11","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0731012","volume":"31","author":"I.M. Jaimoukha","year":"1994","unstructured":"I.M. Jaimoukha and E.M. Kasenally, Krylov subspace method for solving large Lyapunov equation, SIAM J. Numer. Anal. 31 (1994) 227-251.","journal-title":"SIAM J. Numer. Anal."},{"key":"401377_CR12","unstructured":"M. Robb\u00e9 and M. Sadkane, Breakdown and stagnation in block FOM and block GMRES methods, Manuscript (2001)."},{"key":"401377_CR13","first-page":"503","volume-title":"Signal Processing, Scattering, Operator Theory and Numerical Methods","author":"Y. Saad","year":"1990","unstructured":"Y. Saad, Numerical solution of large Lyapunov equation, in: Signal Processing, Scattering, Operator Theory and Numerical Methods (Birkh\u00e4user, Boston, 1990) pp. 503-511."},{"key":"401377_CR14","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y. Saad","year":"1996","unstructured":"Y. Saad, Iterative Methods for Sparse Linear Systems (PWS, Boston, 1996)."},{"key":"401377_CR15","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1137\/0907058","volume":"7","author":"Y. Saad","year":"1986","unstructured":"Y. Saad and M.H. Schultz, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 7 (1986) 856-869.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"401377_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01388686","volume":"64","author":"M. Sadkane","year":"1993","unstructured":"M. Sadkane, A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices, Numer. Math. 64 (1993) 181-193.","journal-title":"Numer. Math."},{"key":"401377_CR17","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1007\/BF01733793","volume":"36","author":"V. Simoncini","year":"1996","unstructured":"V. Simoncini, On the numerical solution of AX - XB = C, BIT 36 (1996) 814-830.","journal-title":"BIT"},{"key":"401377_CR18","volume-title":"Matrix Perturbation Theory","author":"G. Stewart","year":"1990","unstructured":"G. Stewart and J. Sun, Matrix Perturbation Theory (Academic Press, San Diego, CA, 1990)."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015615310584.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015615310584\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015615310584.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:19:28Z","timestamp":1751872768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015615310584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["401377"],"URL":"https:\/\/doi.org\/10.1023\/a:1015615310584","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}