{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:13:07Z","timestamp":1773778387001,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,10,1]],"date-time":"2005-10-01T00:00:00Z","timestamp":1128124800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2005,10]]},"DOI":"10.1007\/s11075-005-1526-2","type":"journal-article","created":{"date-parts":[[2005,11,8]],"date-time":"2005-11-08T08:12:24Z","timestamp":1131437544000},"page":"137-156","source":"Crossref","is-referenced-by-count":46,"title":["Matrix Krylov subspace methods for linear systems with multiple right-hand sides"],"prefix":"10.1007","volume":"40","author":[{"given":"M.","family":"Heyouni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Essai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11526_CR1","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1145\/361573.361582","volume":"15","author":"D.L. Boley","year":"1972","unstructured":"D.L. Boley, Krylov subspace methods on state space control models, Commun. ACM 15 (1972) 820\u2013826.","journal-title":"Commun. ACM"},{"key":"11526_CR2","doi-asserted-by":"crossref","first-page":"1698","DOI":"10.1137\/S1064827594273067","volume":"18","author":"T. Chan","year":"1997","unstructured":"T. Chan and W. Wang, Analysis of projection methods for solving linear systems with multiple right-hand sides, SIAM J. Sci. Comput. 18 (1997) 1698\u20131721.","journal-title":"SIAM J. Sci. Comput."},{"key":"11526_CR3","volume-title":"Valeurs Propres de Matrices","author":"F. Chatelin","year":"1988","unstructured":"F. Chatelin, Valeurs Propres de Matrices (Masson, Paris, 1988)."},{"key":"11526_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1023\/A:1019177600806","volume":"18","author":"A. Essai","year":"1998","unstructured":"A. Essai, Weighted FOM and GMRES for solving nonsymmetric linear systems, Numer. Algorithms 18 (1998) 277\u2013292.","journal-title":"Numer. Algorithms"},{"key":"11526_CR5","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BFb0080116","volume-title":"Numerical Analysis","author":"R. Fletcher","year":"1976","unstructured":"R. Fletcher, Conjugate Gradient methods for indefinite systems, in: Numerical Analysis, ed. G.A.Watson, Lecture Notes in Mathematics, Vol. 506 (Springer, Berlin, 1976), pp. 73\u201389."},{"key":"11526_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01385726","volume":"60","author":"R.W. Freund","year":"1991","unstructured":"R.W. Freund and N.M. Nachtigal, QMR: A quasi minimal residual method for non-Hermitian linear systems, Numer. Math. 60 (1991) 315\u2013339.","journal-title":"Numer. Math."},{"key":"11526_CR7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0024-3795(96)00529-0","volume":"254","author":"R. Freund","year":"1997","unstructured":"R. Freund and M. Malhotra, A block QMR algorithm for non-Hermitian systems with multiple right-hand sides, Linear Algebra Appl. 254 (1997) 119\u2013157.","journal-title":"Linear Algebra Appl."},{"key":"11526_CR8","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"M.R. Hestenes","year":"1952","unstructured":"M.R. Hestenes and E.L. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Stand. 49 (1952) 409\u2013436.","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"11526_CR9","unstructured":"M. Heyouni, M\u00e9thode de Hessenberg g\u00e9n\u00e9ralis\u00e9e et applications, Ph.D. thesis, Universit\u00e9 des Sciences et Technologies de Lille, France (1996)."},{"key":"11526_CR10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1023\/A:1016603612931","volume":"26","author":"M. Heyouni","year":"2001","unstructured":"M. Heyouni, The global Hessenberg and global CMRH methods for linear systems with multiple right-hand sides, Numer. Algorithms 26 (2001) 317\u2013332.","journal-title":"Numer. Algorithms"},{"key":"11526_CR11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0024-3795(97)00037-2","volume":"268","author":"M. Heyouni","year":"1998","unstructured":"M. Heyouni and H. Sadok, On a variable smoothing procedure for Krylov subspace methods, Linear Algebra Appl. 268 (1998) 131\u2013149.","journal-title":"Linear Algebra Appl."},{"key":"11526_CR12","volume-title":"Topics in Matrix Computations","author":"R.A. Horn","year":"1991","unstructured":"R.A. Horn and G.R. Johnson, Topics in Matrix Computations (Cambridge Univ. Press, Cambridge, 1991)."},{"key":"11526_CR13","unstructured":"K. Jbilou, On Krylov subspace methods for solving the Sylvester matrix equation AX\u2212XB=C, Technical Report n-71, Cahiers du Laboratoire de Math\u00e9matiques Pures et Appliqu\u00e9es, Universit\u00e9 du Littoral (1998)."},{"key":"11526_CR14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0168-9274(98)00094-4","volume":"31","author":"K. Jbilou","year":"1999","unstructured":"K. Jbilou, A. Messaoudi and H. Sadok, Global FOM and GMRES algorithms for matrix equations, Appl. Numer. Math. 31 (1999) 49\u201363.","journal-title":"Appl. Numer. Math."},{"key":"11526_CR15","unstructured":"K. Jbilou and H. Sadok, Global Lanczos-type methods with applications, Technical Report n-42, Cahiers du Laboratoire de Math\u00e9matiques Appliqu\u00e9es, Universit\u00e9 du Littoral (1997)."},{"key":"11526_CR16","unstructured":"S. Kharchenko, P. Kolesnikov, A. Nikishin, A. Yeremin, M. Heroux and Q. Seikh, Iterative solution methods on the Cray\/C90. Part II: Dense linear systems, Presented at 1993 Simulation Conference: High Performance Computing Symposium, Washington, DC."},{"key":"11526_CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.6028\/jres.049.006","volume":"49","author":"C. Lanczos","year":"1952","unstructured":"C. Lanczos, Solution of systems of linear equations by minimized iterations, J. Res. Nat. Bur. Stand. 49 (1952) 33\u201353.","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"11526_CR18","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1137\/S0895479893247679","volume":"16","author":"A. Nikishin","year":"1995","unstructured":"A. Nikishin and A. Yeremin, Variable block CG algorithms for solving large sparse symmetric positif definite linear systems on parallel computers I: General iterative scheme, SIAM J. Matrix Anal. 16 (1995) 1135\u20131153.","journal-title":"SIAM J. Matrix Anal."},{"key":"11526_CR19","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0024-3795(80)90247-5","volume":"29","author":"D. O'leary","year":"1980","unstructured":"D. O'leary, The block conjugate gradient algorithm and related methods, Linear Algebra Appl. 29 (1980) 293\u2013322.","journal-title":"Linear Algebra Appl."},{"key":"11526_CR20","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1090\/S0025-5718-1981-0616364-6","volume":"37","author":"Y. Saad","year":"1981","unstructured":"Y. Saad, Krylov subspace methods for solving large unsymmetric linear systems, Math. Comp. 37 (1981) 105\u2013126.","journal-title":"Math. Comp."},{"key":"11526_CR21","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y. Saad","year":"1995","unstructured":"Y. Saad, Iterative Methods for Sparse Linear Systems (PWS, New York, 1995)."},{"key":"11526_CR22","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\u2013869.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"11526_CR23","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1023\/A:1019164119887","volume":"20","author":"H. Sadok","year":"1999","unstructured":"H. Sadok, CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm, Numer. Algorithms 20 (1999) 303\u2013321.","journal-title":"Numer. Algorithms"},{"key":"11526_CR24","first-page":"51","volume":"10","author":"B.I. Schneider","year":"1991","unstructured":"B.I. Schneider and L.A. Collins, The linear algebraic method for the scattering of electrons from atoms and molecules: Computational techniques, Comput. Phys. Rep. 10 (1991) 51\u201357.","journal-title":"Comput. Phys. Rep."},{"key":"11526_CR25","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1137\/0916053","volume":"16","author":"V. Simoncini","year":"1995","unstructured":"V. Simoncini and E. Gallopoulos, An iterative method for nonsymmetric systems with multiple right-hand sides, SIAM J. Sci. Comput. 16 (1995) 917\u2013933.","journal-title":"SIAM J. Sci. Comput."},{"key":"11526_CR26","doi-asserted-by":"crossref","unstructured":"V. Simoncini and E. Gallopoulos, Convergence properties of block GMRES and matrix polynomials, Linear Algebra Appl. (1996) 97\u2013119.","DOI":"10.1016\/0024-3795(95)00093-3"},{"key":"11526_CR27","doi-asserted-by":"crossref","first-page":"1490","DOI":"10.1109\/8.43571","volume":"37","author":"C. Smith","year":"1989","unstructured":"C. Smith, A. Peterson and R. Mittra, A Conjugate Gradient algorithm for treatement of multiple incident electromagnetic fields, IEEE Trans. Antennas Propagation 37 (1989) 1490\u20131493.","journal-title":"IEEE Trans. Antennas Propagation"},{"key":"11526_CR28","volume-title":"Matrix Perturbation Theory","author":"G.W. Stewart","year":"1990","unstructured":"G.W. Stewart and J.G. Sun, Matrix Perturbation Theory (Academic Press, New York, 1990)."},{"key":"11526_CR29","unstructured":"B. Vital, Etude de quelques m\u00e9thodes de r\u00e9solution de probl\u00e8mes lin\u00e9aires de grande taille sur multiprocesseurs, Ph.D. thesis, Universit\u00e9 de Rennes, France (1990)."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-005-1526-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-005-1526-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-005-1526-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:08:06Z","timestamp":1559351286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-005-1526-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,10]]}},"alternative-id":["11526"],"URL":"https:\/\/doi.org\/10.1007\/s11075-005-1526-2","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]}}}