{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T18:54:37Z","timestamp":1648752877427},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,9,17]],"date-time":"2014-09-17T00:00:00Z","timestamp":1410912000000},"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,6]]},"DOI":"10.1007\/s11075-014-9906-0","type":"journal-article","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T01:06:33Z","timestamp":1410829593000},"page":"455-469","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting (k, \u2113)-step methods"],"prefix":"10.1007","volume":"69","author":[{"given":"Martin H.","family":"Gutknecht","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,17]]},"reference":[{"key":"9906_CR1","unstructured":"Ashby, S.F., Gutknecht, M.H.: A matrix analysis of conjugate gradient algorithms. In: Natori, M., Nodera, T. (eds.) Advances in Numerical Methods for Large Sparse Sets of Linear Systems, in Parallel Processing for Scientific Computing, vol. 9, pp. 32\u201347. Keio University, Yokahama (1993)"},{"key":"9906_CR2","volume-title":"Implementation of the Conjugate Gradient Method using Short Multiple recursions","author":"TL Barth","year":"1996","unstructured":"Barth, T.L.: Implementation of the Conjugate Gradient Method Using Short Multiple Recursions. PhD thesis, University of Colorado, Denver (1996)"},{"key":"9906_CR3","unstructured":"Barth, T.L., Manteuffel T.A.: Conjugate gradient algorithms using multiple recursions. In: Adams, L.M., Nazareth, J.L. (eds.) Linear and Nonlinear Conjugate Gradient-Related Methods, Proceedings of the AMS-IMS-SIAM Summer Research Conference held at the University of Washington, July 1995, pp. 107\u2013123. SIAM, Philadelphia (1995)"},{"key":"9906_CR4","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1137\/S089547989833245X","volume":"21","author":"T Barth","year":"2000","unstructured":"Barth, T., Manteuffel, T.: Multiple recursion conjugate gradient algorithms, Part I: Sufficient conditions. SIAM J. Matrix Anal. Appl. 21, 768\u2013796 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9906_CR5","doi-asserted-by":"crossref","unstructured":"Barth, T., Manteuffel, T.: Multiple Recursion Conjugate Gradient Algorithms, Part II: Necessary Conditions. Unpublished manuscript (2000)","DOI":"10.1137\/S089547989833245X"},{"key":"9906_CR6","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/BF01389454","volume":"47","author":"M Eiermann","year":"1985","unstructured":"Eiermann, M., Niethammer, W., Varga, R.S.: A study of semiiterative methods for nonsymmetric systems of linear equations. Numer. Math. 47, 505\u2013533 (1985)","journal-title":"Numer. Math."},{"key":"9906_CR7","doi-asserted-by":"crossref","first-page":"1323","DOI":"10.1137\/060678087","volume":"46","author":"V Faber","year":"2008","unstructured":"Faber, V., Liesen, J., Tich\u00fd, P.: The Faber-Manteuffel theorem for linear operators. SIAM J. Numer. Anal. 46, 1323\u20131337 (2008)","journal-title":"SIAM J. Numer. Anal."},{"key":"9906_CR8","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1137\/0721026","volume":"21","author":"V Faber","year":"1984","unstructured":"Faber, V., Manteuffel, T.: Necessary and sufficient conditions for the existence of a conjugate gradient method. SIAM J. Numer. Anal. 21, 352\u2013362 (1984)","journal-title":"SIAM J. Numer. Anal."},{"key":"9906_CR9","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/0724014","volume":"24","author":"V Faber","year":"1987","unstructured":"Faber, V., Manteuffel, T.: Orthogonal error methods. SIAM J. Numer. Anal. 24, 170\u2013187 (1987)","journal-title":"SIAM J. Numer. Anal."},{"key":"9906_CR10","volume-title":"Vycislitel\u2019nye metody linejnoj algebry, Fizmatgiz, Moscow, 1960. German translation: Numerische Verfahren der linearen Algebra, Oldenbourg, Munich, 1964; 4th ed., 1976. This is not the same book as Computational Methods of Linear Algebra","author":"DK Faddeev","year":"1963","unstructured":"Faddeev, D.K., Faddeeva, V.N.: Vycislitel\u2019nye metody linejnoj algebry, Fizmatgiz, Moscow, 1960. German translation: Numerische Verfahren der linearen Algebra, Oldenbourg, Munich, 1964; 4th ed., 1976. This is not the same book as Computational Methods of Linear Algebra. Freeman, San Francisco (1963)"},{"key":"9906_CR11","doi-asserted-by":"crossref","unstructured":"Fletcher, R.: Conjugate gradient methods for indefinite systems. In: Watson, G.A. (ed.) Numerical Analysis, Dundee, 1975, Lecture Notes in Mathematics, vol. 506, pp. 73\u201389. Springer, Berlin (1976)","DOI":"10.1007\/BFb0080116"},{"key":"9906_CR12","unstructured":"Gragg, W.B.: Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle (in Russian). In: Nikolaev, E. (ed.) Numerical Methods in Linear Algebra, pp. 16\u201332. Moscow University Press. For English Version, see [13]"},{"key":"9906_CR13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0377-0427(93)90294-L","volume":"46","author":"WB Gragg","year":"1993","unstructured":"Gragg, W.B.: Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle. J. Comput. Appl. Math. 46, 183\u2013198 (1993)","journal-title":"J. Comput. Appl. Math."},{"key":"9906_CR14","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1137\/S0895479895284944","volume":"18","author":"A Greenbaum","year":"1997","unstructured":"Greenbaum, A.: Estimating the attainable accuracy of recursively computed residual methods. SIAM J. Matrix Anal. Appl. 18, 535\u2013551 (1997)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9906_CR15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01409784","volume":"56","author":"MH Gutknecht","year":"1989","unstructured":"Gutknecht, M.H.: Stationary and almost stationary iterative (k, l)-step methods for linear and nonlinear systems of equations. Numer. Math. 56, 179\u2013213 (1989)","journal-title":"Numer. Math."},{"key":"9906_CR16","unstructured":"Gutknecht, M.H.: On certain types of (k, l)-step methods for solving linear systems of equations. In: Beauwens, R., de Groen, P. (eds.) Iterative Methods in Linear Algebra, Proceedings IMACS Symposium, Brussels, 1991, 1992, pp. 373\u2013380. Elsevier, North-Holland (1992)"},{"key":"9906_CR17","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1137\/0730003","volume":"30","author":"MH Gutknecht","year":"1993","unstructured":"Gutknecht, M.H.: Changing the norm in conjugate gradient type algorithms. SIAM J. Numer. Anal. 30, 40\u201356 (1993)","journal-title":"SIAM J. Numer. Anal."},{"key":"9906_CR18","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1017\/S0962492900002737","volume":"6","author":"MH Gutknecht","year":"1997","unstructured":"Gutknecht, M.H.: Lanczos-type solvers for nonsymmetric linear systems of equations. Acta Numerica 6, 271\u2013397 (1997)","journal-title":"Acta Numerica"},{"key":"9906_CR19","unstructured":"Gutknecht, M.H.: IDR explained. ETNA 36, 126\u2013148 (2010)"},{"key":"9906_CR20","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0022-247X(87)90167-3","volume":"125","author":"MH Gutknecht","year":"1987","unstructured":"Gutknecht, M.H., Kaiser, A.: Iterative k-step methods for computing possibly repulsive fixed points in Banach spaces. J. Math. Anal. Appl. 125, 104\u2013123 (1987)","journal-title":"J. Math. Anal. Appl."},{"key":"9906_CR21","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/BF01399689","volume":"48","author":"MH Gutknecht","year":"1986","unstructured":"Gutknecht, M.H., Niethammer, W., Varga, R.S.: k-step iterative methods for solving nonlinear systems of equations. Numer. Math. 48, 699\u2013712 (1986)","journal-title":"Numer. Math."},{"key":"9906_CR22","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1137\/S0895479897331862","volume":"22","author":"MH Gutknecht","year":"2000","unstructured":"Gutknecht, M.H., Strako\u0161, Z.: Accuracy of two three-term and three two-term recurrences for Krylov space solvers. SIAM J. Matrix Anal. Appl. 22, 213\u2013229 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9906_CR23","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1137\/100804012","volume":"34","author":"MH Gutknecht","year":"2013","unstructured":"Gutknecht, M.H., Zemke, J.-P.M.: Eigenvalue computations based on IDR. SIAM J. Matrix Anal. Appl. 34, 283\u2013311 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9906_CR24","unstructured":"Hessenberg, K.: Behandlung linearer Eigenwertaufgaben mit Hilfe der Hamilton-Cayleyschen Gleichung, Numerische Verfahren, Bericht 1, Institut fu\u0307r Praktische Mathematik (IPM), Technische Hochschule Darmstadt (1940). The scanned report and a biographical sketch of Karl Hessenberg\u2019s life are available at. http:\/\/www.hessenberg.de\/karl1.html"},{"key":"9906_CR25","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bureau Standards 49, 409\u2013435 (1952)","journal-title":"J. Res. Nat. Bureau Standards"},{"key":"9906_CR26","unstructured":"Jagels, C., Reichel, L.: The isometric Arnoldi process and an application to iterative solution of large linear systems. In: Beauwens, R. de Groen, P. (eds.) Iterative Methods in Linear Algebra, Proceedings IMACS Symposium, Brussels, 1991, 1992, pp. 361\u2013369. Elsevier, North-Holland (1992)"},{"key":"9906_CR27","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1002\/nla.1680010604","volume":"1","author":"CF Jagels","year":"1994","unstructured":"Jagels, C.F., Reichel, L.: A fast minimal residual algorithm for shifted unitary matrices. Numer. Linear Algebra Appl. 1, 555\u2013570 (1994)","journal-title":"Numer. Linear Algebra Appl."},{"key":"9906_CR28","doi-asserted-by":"crossref","first-page":"33","DOI":"10.6028\/jres.049.006","volume":"49","author":"C Lanczos","year":"1952","unstructured":"Lanczos, C.: Solution of systems of linear equations by minimized iterations. J. Res. Nat. Bureau Standards 49, 33\u201353 (1952)","journal-title":"J. Res. Nat. Bureau Standards"},{"key":"9906_CR29","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/060662149","volume":"50","author":"J Liesen","year":"2008","unstructured":"Liesen, J., Strako\u0161, Z: On optimal short recurrences for generating orthogonal Krylov subspace bases. SIAM Rev. 50, 485\u2013503 (2008)","journal-title":"SIAM Rev."},{"key":"9906_CR30","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/BF01110911","volume":"102","author":"W Niethammer","year":"1967","unstructured":"Niethammer, W.: Iterationsverfahren und allgemeine Euler-Verfahren. Math. Z. 102, 288\u2013317 (1967)","journal-title":"Math. Z."},{"key":"9906_CR31","doi-asserted-by":"crossref","unstructured":"Niethammer, W.: Konvergenzbeschleunigung bei einstufigen Iterationsverfahren durch Summierungsmethoden, in Iterationsverfahren, Numerische Mathematik, Approximationstheorie (Tagung Iterationsverfahren Numer. Math., Oberwolfach, 1969), pp 235\u2013243. Birkh\u00e4user, Basel (1970)","DOI":"10.1007\/978-3-0348-5833-5_23"},{"key":"9906_CR32","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01818449","volume":"5","author":"W Niethammer","year":"1970","unstructured":"Niethammer, W., Schempp, W.: On the construction of iteration methods for linear equations in Banach spaces by summation methods. Aequationes Math. 5, 273\u2013284 (1970)","journal-title":"Aequationes Math."},{"key":"9906_CR33","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01390212","volume":"41","author":"W Niethammer","year":"1983","unstructured":"Niethammer, W., Varga, R.S.: The analysis of k-step iterative methods for linear systems from summability theory. Numer. Math. 41, 177\u2013206 (1983)","journal-title":"Numer. Math."},{"key":"9906_CR34","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/0712047","volume":"12","author":"CC Paige","year":"1975","unstructured":"Paige, C.C., Saunders, M.A.: Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12, 617\u2013629 (1975)","journal-title":"SIAM J. Numer. Anal."},{"key":"9906_CR35","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0724015","volume":"24","author":"BN Parsons","year":"1987","unstructured":"Parsons, B.N.: General k-part stationary iterative solutions to linear systems. SIAM J. Numer. Anal. 24, 188\u2013198 (1987)","journal-title":"SIAM J. Numer. Anal."},{"key":"9906_CR36","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003)","DOI":"10.1137\/1.9780898718003"},{"key":"9906_CR37","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1090\/S0025-5718-1985-0777273-9","volume":"44","author":"Y Saad","year":"1985","unstructured":"Saad, Y., Schultz, M.H.: Conjugate gradient-like algorithms for solving nonsymmetric linear systems. Math. Comp. 44, 417\u2013424 (1985)","journal-title":"Math. Comp."},{"key":"9906_CR38","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/070685804","volume":"31","author":"P Sonneveld","year":"2008","unstructured":"Sonneveld, P., van Gijzen M.B.: IDR (s): a family of simple and fast algorithms for solving large nonsymmetric systems of linear equations. SIAM J. Sci. Comput. 31, 1035\u20131062 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"9906_CR39","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/0913035","volume":"13","author":"HA van der Vorst","year":"1992","unstructured":"van der Vorst, H.A.: Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 13, 631\u2013644 (1992)","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"9906_CR40","unstructured":"Varga, R.S.: Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, N.J., 1962, Rev. 2nd edn. Springer-Verlag (1999)"},{"key":"9906_CR41","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0041-5553(83)80060-3","volume":"23","author":"VV Voevodin","year":"1983","unstructured":"Voevodin, V.V.: The question of non-self-adjoint extension of the conjugate gradients method is closed. U.S.S.R. Comput. Maths. Math. Phys. 23, 143\u2013144 (1983)","journal-title":"U.S.S.R. Comput. Maths. Math. Phys."},{"key":"9906_CR42","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0024-3795(80)90165-2","volume":"34","author":"DM Young","year":"1980","unstructured":"Young, D.M., Jea, K.C.: Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods. Linear Algebra Appl. 34, 159\u2013194 (1980)","journal-title":"Linear Algebra Appl."},{"key":"9906_CR43","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0024-3795(97)82725-5","volume":"249","author":"H Zha","year":"1996","unstructured":"Zha, H., Zhang, Z.: The Arnoldi process, short recursions, and displacement ranks. Linear Algebra Appl. 249, 169\u2013188 (1996)","journal-title":"Linear Algebra Appl."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9906-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-014-9906-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9906-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T00:40:32Z","timestamp":1565829632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-014-9906-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,17]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["9906"],"URL":"https:\/\/doi.org\/10.1007\/s11075-014-9906-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,17]]}}}