{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T21:15:15Z","timestamp":1778534115105,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":[[2001,6]]},"DOI":"10.1023\/a:1011889705659","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T18:14:30Z","timestamp":1041185670000},"page":"189-213","source":"Crossref","is-referenced-by-count":11,"title":["By How Much Can Residual Minimization Accelerate the Convergence of Orthogonal Residual Methods?"],"prefix":"10.1007","volume":"27","author":[{"given":"Martin H.","family":"Gutknecht","sequence":"first","affiliation":[]},{"given":"Miroslav","family":"Rozlo\u017en\u00edk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"356034_CR1","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1137\/0912003","volume":"12","author":"P.N. Brown","year":"1991","unstructured":"P.N. Brown, A theoretical comparison of the Arnoldi and GMRES algorithms, SIAM J. Sci. Statist. Comput. 12 (1991) 58\u201378.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"356034_CR2","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0915023","volume":"15","author":"T.F. Chan","year":"1994","unstructured":"T.F. Chan, E. Gallopoulos, V. Simoncini, T. Szeto and C.H. Tong, A quasi-minimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric systems, SIAM J. Sci. Comput. 15 (1994) 338\u2013347.","journal-title":"SIAM J. Sci. Comput."},{"key":"356034_CR3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0168-9274(95)00086-0","volume":"19","author":"J. Cullum","year":"1995","unstructured":"J. Cullum, Peaks, plateaus, numerical instabilities in a Galerkin\/minimal residual pair of methods for solving Ax = b, Appl. Numer. Math. 19 (1995) 255\u2013278.","journal-title":"Appl. Numer. Math."},{"key":"356034_CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/S0895479893246765","volume":"17","author":"J. Cullum","year":"1996","unstructured":"J. Cullum and A. Greenbaum, Relations between Galerkin and norm-minimizing iterative methods for solving linear systems, SIAM J. Matrix Anal. Appl. 17 (1996) 223\u2013247.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"356034_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1017\/S0962492901000046","volume":"10","author":"M. Eiermann","year":"2001","unstructured":"M. Eiermann and O. Ernst, Geometric aspects in the theory of Krylov space methods, Acta Numerica 10 (2001) 251\u2013312.","journal-title":"Acta Numerica"},{"key":"356034_CR6","series-title":"Lecture Notes in Mathematics","first-page":"73","volume-title":"Numerical Analysis","author":"R. Fletcher","year":"1975","unstructured":"R. Fletcher, Conjugate gradient methods for indefinite systems, in: Numerical Analysis, ed. G.A. Watson, Dundee, 1975, Lecture Notes in Mathematics, Vol. 506 (Springer, Berlin, 1976) pp. 73-89."},{"key":"356034_CR7","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1137\/0914029","volume":"14","author":"R.W. Freund","year":"1993","unstructured":"R.W. Freund, A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems, SIAM J. Sci. Comput. 14 (1993) 470\u2013482.","journal-title":"SIAM J. Sci. Comput."},{"key":"356034_CR8","doi-asserted-by":"crossref","unstructured":"R.W. Freund, G.H. Golub and N.M. Nachtigal, Iterative solution of linear systems, Acta Numerica (1992) 57\u2013100.","DOI":"10.1017\/S0962492900002245"},{"key":"356034_CR9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1137\/0914009","volume":"14","author":"R.W. Freund","year":"1993","unstructured":"R.W. Freund, M.H. Gutknecht and N.M. Nachtigal, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Comput. 14 (1993) 137\u2013158.","journal-title":"SIAM J. Sci. Comput."},{"key":"356034_CR10","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":"356034_CR11","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1137\/S0895479895284944","volume":"18","author":"A. Greenbaum","year":"1997","unstructured":"A. Greenbaum, Estimating the attainable accuracy of recursively computed residual methods, SIAM J. Matrix Anal. Appl. 18 (1997) 535\u2013551.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"356034_CR12","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0613037","volume":"13","author":"M.H. Gutknecht","year":"1992","unstructured":"M.H. Gutknecht, A completed theory of the unsymmetric Lanczos process and related algorithms, Part I, SIAM J. Matrix Anal. Appl. 13 (1992) 594\u2013639.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"356034_CR13","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1137\/0730003","volume":"30","author":"M.H. Gutknecht","year":"1993","unstructured":"M.H. Gutknecht, Changing the norm in conjugate gradient type algorithms, SIAM J. Numer. Anal. 30 (1993) 40\u201356.","journal-title":"SIAM J. Numer. Anal."},{"key":"356034_CR14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/S0895479890188803","volume":"15","author":"M.H. Gutknecht","year":"1994","unstructured":"M.H. Gutknecht, A completed theory of the unsymmetric Lanczos process and related algorithms, Part II, SIAM J. Matrix Anal. Appl. 15 (1994) 15\u201358.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"356034_CR15","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. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. National. Bureau Standards 49 (1952) 409\u2013435.","journal-title":"J. Res. National. Bureau Standards"},{"key":"356034_CR16","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. Bureau Standards 49 (1952) 33\u201353.","journal-title":"J. Res. Nat. Bureau Standards"},{"key":"356034_CR17","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/0712047","volume":"12","author":"C.C. Paige","year":"1975","unstructured":"C.C. Paige and M.A. Saunders, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal. 12 (1975) 617\u2013629.","journal-title":"SIAM J. Numer. Anal."},{"key":"356034_CR18","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":"356034_CR19","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1090\/S0025-5718-1985-0777273-9","volume":"44","author":"Y. Saad","year":"1985","unstructured":"Y. Saad and M.H. Schultz, Conjugate gradient-like algorithms for solving nonsymmetric linear systems, Math. Comp. 44 (1985) 417\u2013424.","journal-title":"Math. Comp."},{"key":"356034_CR20","unstructured":"H. Sadok, Analysis of the convergence of the minimal and the orthogonal residual methods, Preprint (1997)."},{"key":"356034_CR21","volume-title":"Scientific Computing on Vector Computers","author":"W. Sch\u00f6nauer","year":"1987","unstructured":"W. Sch\u00f6nauer, Scientific Computing on Vector Computers (Elsevier, Amsterdam, 1987)."},{"key":"356034_CR22","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1137\/0910004","volume":"10","author":"P. Sonneveld","year":"1989","unstructured":"P. Sonneveld, CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 10 (1989) 36\u201352.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"356034_CR23","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02564277","volume":"29","author":"E. Stiefel","year":"1955","unstructured":"E. Stiefel, Relaxationsmethoden bester Strategie zur L\u00f6sung linearer Gleichungssysteme, Comm. Math. Helv. 29 (1955) 157\u2013179.","journal-title":"Comm. Math. Helv."},{"key":"356034_CR24","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/0913035","volume":"13","author":"H.A. van der Vorst","year":"1992","unstructured":"H.A. van der Vorst, Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 13 (1992) 631\u2013644.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"356034_CR25","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0168-9274(95)00087-9","volume":"19","author":"H.F. Walker","year":"1995","unstructured":"H.F. Walker, Residual smoothing and peak\/plateau behavior in Krylov subspace methods, Appl. Numer. Math. 19 (1995) 279\u2013286.","journal-title":"Appl. Numer. Math."},{"key":"356034_CR26","unstructured":"R. Weiss, Convergence behavior of generalized conjugate gradient methods, PhD thesis, University of Karlsruhe (1990)."},{"key":"356034_CR27","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/nla.1680010106","volume":"1","author":"R. Weiss","year":"1994","unstructured":"R. Weiss, Properties of generalized conjugate gradient methods, J. Numer. Linear Algebra Appl. 1 (1994) 45\u201363.","journal-title":"J. Numer. Linear Algebra Appl."},{"key":"356034_CR28","series-title":"Mathematical Research","volume-title":"Parameter-Free Iterative Linear Solvers","author":"R. Weiss","year":"1996","unstructured":"R. Weiss, Parameter-Free Iterative Linear Solvers, Mathematical Research, Vol. 97 (Akademie Verlag, Berlin, 1996)."},{"key":"356034_CR29","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0915021","volume":"15","author":"L. Zhou","year":"1994","unstructured":"L. Zhou and H.F. Walker, Residual smoothing techniques for iterative methods, SIAMJ. Sci. Comput. 15 (1994) 297\u2013312.","journal-title":"SIAMJ. Sci. Comput."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011889705659.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011889705659\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011889705659.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:17:36Z","timestamp":1751872656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011889705659"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["356034"],"URL":"https:\/\/doi.org\/10.1023\/a:1011889705659","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}