{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T03:29:14Z","timestamp":1787714954389,"version":"build-2784847793"},"reference-count":35,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2000,1]]},"abstract":"<jats:p>We analyze the conjugate gradient (CG) method with preconditioning slightly variable from one iteration to the next. To maintain the optimal convergence properties, we consider a variant proposed by Axelsson that performs an explicit orthogonalization of the search directions vectors. For this method, which we refer to as flexible CG, we develop a theoretical analysis that shows that the convergence rate is essentially independent of the variations in the preconditioner as long as the latter are kept sufficiently small. We further discuss the real convergence rate on the basis of some heuristic arguments supported by numerical experiments. Depending on the eigenvalue distribution corresponding to the fixed reference preconditioner, several situations have to be distinguished. In some cases, the convergence is as fast with truncated versions of the algorithm or even with the standard CG method, whereas quite large variations are allowed without too much penalty. In other cases, the flexible variant effectively outperforms the standard method, while the need for truncation limits the size of the variations that can be reasonably allowed.<\/jats:p>","DOI":"10.1137\/s1064827599362314","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"1444-1460","source":"Crossref","is-referenced-by-count":171,"title":["Flexible Conjugate Gradients"],"prefix":"10.1137","volume":"22","author":[{"given":"Yvan","family":"Notay","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2012,2,17]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(80)90226-8"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01396750"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1002\/cnm.1630040409"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"O. Axelsson,\n                      Iterative Solution Methods\n                      , Cambridge University Press, Cambridge, UK, 1994.","DOI":"10.1017\/CBO9780511624100"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4754(99)00058-0"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01389448"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/0612048"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1680010108"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"R. Barrett, M. Berry, T. F. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. van der Vorst,\n                      Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods\n                      , SIAM, Philadelphia, 1994.","DOI":"10.1137\/1.9781611971538"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1680010203"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"R. Blaheta, O. Jakl, and J. Star\u00fd,\n                      A parallel cg solver for FE analysis of 3D problems in geomechanics\n                      , in Geomechanics 96, Z. Rakowski, ed., Balkema, Rotterdam, 1997, pp. 159\u2013163.","DOI":"10.1201\/9781003761778-29"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Tony Chan, Tarek Mathew, Domain decomposition algorithms, Acta Numer., Cambridge Univ. Press, Cambridge, 1994, 61\u201314395f:65214","DOI":"10.1017\/S0962492900002427"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Tony Chan, Henk Van der Vorst, Approximate and incomplete factorizations, ICASE\/LaRC Interdiscip. Ser. Sci. Eng., Vol. 4, Kluwer Acad. Publ., Dordrecht, 1997, 167\u20132021441577","DOI":"10.1007\/978-94-011-5412-3_6"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(93)90530-2"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1137\/0731085"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142995293742"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"Gene Golub, Michael Overton, Convergence of a two\u2010stage Richardson iterative procedure for solving systems of linear equations, Lecture Notes in Math., Vol. 912, Springer, Berlin, 1982, 125\u201313983f:65045","DOI":"10.1007\/BFb0093153"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01397553"},{"key":"R19","unstructured":"G. H. Golub and C. F. van Loan,\n                      Matrix Computations\n                      , 3rd ed., The John Hopkins University Press, Baltimore, MD, 1996."},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827597323415"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1007\/BF03008919"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(89)90285-1"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1137\/0613011"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.6028\/jres.049.044"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596311591"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01385754"},{"key":"R27","unstructured":"J. K. Reid,\n                      On the method of conjugate gradients for the solution of large sparse systems of linear equations\n                      , in Large Sparse Sets of Linear Equations, J. Reid, ed., Academic Press, London, 1971, pp. 231\u2013254."},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1137\/0914028"},{"key":"R29","unstructured":"J. Varah, A survey of iterative methods for sparse linear systems, Proceedings of the fifteenth Manitoba conference on numerical mathematics and computing (Winnipeg, Man., 1985), Vol. 51, 1986, 83\u20139288h:65080"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0207(19960430)39:8<1313::AID-NME906>3.0.CO;2-J"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(91)90393-B"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1007\/BF01389450"},{"key":"R33","doi-asserted-by":"crossref","unstructured":"H. van der Vorst, The convergence behaviour of preconditioned CG and CG\u2010S in the presence of rounding errors, Lecture Notes in Math., Vol. 1457, Springer, Berlin, 1990, 126\u201313692a:65141","DOI":"10.1007\/BFb0090905"},{"key":"R34","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1680010404"},{"key":"R35","unstructured":"J. H. Wilkinson,\n                      The Algebraic Eigenvalue Problem\n                      , Clarendon Press, Oxford, 1965."}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S1064827599362314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:34:27Z","timestamp":1787333667000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S1064827599362314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["10.1137\/S1064827599362314"],"URL":"https:\/\/doi.org\/10.1137\/s1064827599362314","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}