{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T06:44:40Z","timestamp":1769237080241,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":[[1994,3]]},"DOI":"10.1007\/bf02141259","type":"journal-article","created":{"date-parts":[[2005,9,15]],"date-time":"2005-09-15T11:52:25Z","timestamp":1126785145000},"page":"17-32","source":"Crossref","is-referenced-by-count":15,"title":["A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems"],"prefix":"10.1007","volume":"7","author":[{"given":"Tony F.","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tedd","family":"Szeto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02141259_CR1","unstructured":"R.E. Bank and T.F. Chan, A composite step bi-conjugate gradient algorithm for solving non-symmetric systems, UCLA CAM Tech. Report 93-21 (1993), Number. Algor., this issue."},{"key":"BF02141259_CR2","unstructured":"R.E. Bank and T.F. Chan, An analysis of the composite step bi-conjugate gradient algorithm for solving nonsymmetric systems, UCLA CAM Tech. Report 92-53 (1992), Number. Math., to appear."},{"key":"BF02141259_CR3","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0168-9274(93)90087-8","volume":"11","author":"C. Brezinski","year":"1993","unstructured":"C. Brezinski and H. Sadok, Lanczos-type algorithms for solving systems of linear equations, Appl. Numer. Math. 11 (1993) 443\u2013473.","journal-title":"Appl. Numer. Math."},{"key":"BF02141259_CR4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF02142321","volume":"1","author":"C. Brezinski","year":"1991","unstructured":"C. Brezinski and H. Sadok, Avoiding breakdown in the CGS algorithm, Numer. Algor. 1 (1991) 199\u2013206.","journal-title":"Numer. Algor."},{"key":"BF02141259_CR5","doi-asserted-by":"crossref","unstructured":"C. Brezinski and M. Redivo-Zaglia, Breakdowns in the computation of orthogonal polynomials, in:Nonlinear Numerical Methods and Rational Approximation, ed. A. Cuyt (Kluwer, Dordrecht), to appear.","DOI":"10.1007\/978-94-011-0970-3_5"},{"key":"BF02141259_CR6","doi-asserted-by":"crossref","unstructured":"C. Brezinski and M. Redivo-Zaglia, Hybrid procedures for solving linear systems, Numer. Math. (1993), to appear.","DOI":"10.1007\/s002110050015"},{"key":"BF02141259_CR7","doi-asserted-by":"crossref","unstructured":"C. Brezinski and M. Redivo-Zaglia, Treatment of near-breakdown in the CGS algorithm, Numer. Algor., this issue.","DOI":"10.1007\/BF02141260"},{"key":"BF02141259_CR8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01385846","volume":"63","author":"C. Brezinski","year":"1992","unstructured":"C. Brezinski, M. Redivo-Zaglia and H. Sadok, A breakdown-free Lanczos type algorithm for solving linear systems, Numer. Math. 63 (1992) 29\u201338.","journal-title":"Numer. Math."},{"key":"BF02141259_CR9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02142326","volume":"1","author":"C. Brezinski","year":"1991","unstructured":"C. Brezinski, M. Redivo-Zaglia and H. Sadok, Avoiding breakdown and near-breakdown in Lanczos type algorithms, Numer. Algor. 1 (1991) 261\u2013284.","journal-title":"Numer. Algor."},{"key":"BF02141259_CR10","unstructured":"T.F. Chan, L. de Pillis and H. van der Vorst, A transpose-free squared Lanczos algorithm and application to solving nonsymmetric linear systems, UCLA CAM Tech. Report 91-17 (1991)."},{"key":"BF02141259_CR11","unstructured":"T.F. Chan, E. Gallopoulos, V. Simoncini, T. Szeto and C. Tong, QMRCGSTAB: A quasiminimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric systems, UCLA CAM Tech. Report 92-26 (1992), to appear in SIAM J. Sci. Stat. Comp."},{"key":"BF02141259_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/62038.62043","volume":"15","author":"I.S. Duff","year":"1989","unstructured":"I.S. Duff, R.G. Grimes and J.G. Lewis, Sparse matrix test problems, ACM Trans. Math. Softw. 15 (1989) 1\u201314.","journal-title":"ACM Trans. Math. Softw."},{"key":"BF02141259_CR13","series-title":"Lecture Notes in Matheamtics","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, Lecture Notes in Matheamtics 506, ed. G.A. Watson (Springer, Berlin, 1976) pp. 73\u201389."},{"key":"BF02141259_CR14","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. Stat. Comp. 14 (1993) 470\u2013482.","journal-title":"SIAM J. Sci. Stat. Comp."},{"key":"BF02141259_CR15","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. Mathematik 60 (1991) 315\u2013339.","journal-title":"Numer. Mathematik"},{"key":"BF02141259_CR16","first-page":"137","volume":"13","author":"R.W. Freund","year":"1992","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. Comp. 13 (1992) 137\u2013158.","journal-title":"SIAM J. Sci. Comp."},{"key":"BF02141259_CR17","unstructured":"R.W. Freund and T. Szeto, A Quasi-minimal residual squared algorithm for non-Hermitian linear systems, UCLA CAM Tech. Report 92-19 (1992), presented at theCopper Mountain Conf. on Iterative Methods (April 1992)."},{"key":"BF02141259_CR18","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":"BF02141259_CR19","unstructured":"M.H. Gutknech, The unsymmetric Lanczos algorithms and their relations to Pad\u00e9 approximation, continued fraction and the QD algorithm, in:Proc. Copper Mt. Conf. on Iterative Methods (1990)."},{"key":"BF02141259_CR20","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. Nat. Bur. Stand. 49 (1952) 409\u2013436.","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"BF02141259_CR21","volume-title":"Generalized conjugate gradient and Lanczos methods for the solution of nonsymmetric systems of linear equations","author":"W. Joubert","year":"1990","unstructured":"W. Joubert, Generalized conjugate gradient and Lanczos methods for the solution of nonsymmetric systems of linear equations, Ph.D. Thesis, The University of Texas at Austin, Austin, TX (1990)."},{"key":"BF02141259_CR22","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 linear equations by minimized iterations, J. Res. Natl. Bur. Stand. 49 (1952) 33\u201353.","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"BF02141259_CR23","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1137\/0117118","volume":"17","author":"D.G. Luenberger","year":"1969","unstructured":"D.G. Luenberger, Hyperbolic pairs in the method of conjugate gradients, SIAM J. Appl. Math. 17 (1969) 1263\u20131267.","journal-title":"SIAM J. Appl. Math."},{"key":"BF02141259_CR24","series-title":"Tech. Report","volume-title":"How fast are nonsymmetric matrix iterations?","author":"N.M. Nachtigal","year":"1990","unstructured":"N.M. Nachtigal, S.C. Reddy and L.N. Trefethen, How fast are nonsymmetric matrix iterations?, Tech. Report, MIT Dept. of Math., Cambridge, MA (1990)."},{"key":"BF02141259_CR25","first-page":"105","volume":"44","author":"B.N. Parlett","year":"1985","unstructured":"B.N. Parlett, D.R. Taylor and Z.A. Liu, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp. 44 (1985) 105\u2013124.","journal-title":"Math. Comp."},{"key":"BF02141259_CR26","volume-title":"Scientific Computing on Vector Computers","author":"W. Sch\u00f6nauer","year":"1987","unstructured":"W. Sch\u00f6nauer,Scientific Computing on Vector Computers (North-Holland, Amsterdam\/New York\/Oxford\/Tokyo, 1987)."},{"key":"BF02141259_CR27","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. Stat. Comp. 10 (1989) 36\u201352.","journal-title":"SIAM J. Sci. Stat. Comp."},{"key":"BF02141259_CR28","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/0913035","volume":"13","author":"H.A. Vorst Van der","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. Stat. Comp. 13 (1992) 631\u2013644.","journal-title":"SIAM J. Sci. Stat. Comp."},{"key":"BF02141259_CR29","series-title":"Lecture Notes in Mathematics","volume-title":"Preconditioned Conjugate Gradient Method","author":"H.A. Vorst Van der","year":"1990","unstructured":"H.A. Van der Vorst, The convergence behaviour of preconditioned CG and CG-S in the presence of rounding errors, in:Preconditioned Conjugate Gradient Method, eds. O. Axelsson and L. Yu. Kolotilina, Lecture Notes in Mathematics 1457 (Springer, Berlin, 1990)."},{"key":"BF02141259_CR30","unstructured":"R. Weiss, Convergence behavior of generalized conjugate gradient methos, Ph. D. thesis, University of Karlsruhe (1990)."},{"key":"BF02141259_CR31","unstructured":"L. Zhou and H.F. Walker, Residual smoothing techniques for iterative methods, Tech. Rep., Dept. of Mathematics and Statistics, Utah State University (1992)."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02141259.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02141259\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02141259","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T14:03:13Z","timestamp":1586440993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02141259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF02141259"],"URL":"https:\/\/doi.org\/10.1007\/bf02141259","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}