{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T23:13:12Z","timestamp":1780441992339,"version":"3.54.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"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":[[1993,10]]},"DOI":"10.1007\/bf02145754","type":"journal-article","created":{"date-parts":[[2005,9,15]],"date-time":"2005-09-15T20:34:46Z","timestamp":1126816486000},"page":"379-406","source":"Crossref","is-referenced-by-count":27,"title":["Complex conjugate gradient methods"],"prefix":"10.1007","volume":"4","author":[{"given":"Pascal","family":"Joly","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00e9rard","family":"Meurant","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02145754_CR1","doi-asserted-by":"crossref","unstructured":"S.F. Ashby, T.A. Manteufel and P.E. Saylor, A taxonomy for conjugate gradient methods, SIAM J. Numer. Anal. 27 (1990).","DOI":"10.1137\/0727091"},{"key":"BF02145754_CR2","doi-asserted-by":"crossref","unstructured":"G.A. Behie and P.A. Forsyth Jr., Incomplete factorization methods for fully implicit simulation of enhanced oil recovery, SIAM J. Sci. Stat. Comput. 5 (1984).","DOI":"10.1137\/0905040"},{"key":"BF02145754_CR3","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 Research report (1991)."},{"key":"BF02145754_CR4","doi-asserted-by":"crossref","unstructured":"S.C. Eisenstat, H.C. Elman and M.H. Schultz, Variational iteration methods for non-symmetric systems of linear equations, SIAM J. Numer. Anal. 20 (1983).","DOI":"10.1137\/0720023"},{"key":"BF02145754_CR5","doi-asserted-by":"crossref","unstructured":"R. Fletcher, Conjugate gradient methods for indefinite systems,Proc. Dundee Conf. on Numerical Analysis (Springer, 1976).","DOI":"10.1007\/BFb0080116"},{"key":"BF02145754_CR6","doi-asserted-by":"crossref","unstructured":"R. Freund, On Conjugate Gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices, Numer. Math. 57 (1990).","DOI":"10.1007\/BF01386412"},{"key":"BF02145754_CR7","volume-title":"R\u00e9solution Num\u00e9rique des Grands Syst\u00e8mes Lin\u00e9aires","author":"G. Golub","year":"1981","unstructured":"G. Golub and G. Meurant,R\u00e9solution Num\u00e9rique des Grands Syst\u00e8mes Lin\u00e9aires (Eyrolles, Paris, 1981)."},{"key":"BF02145754_CR8","unstructured":"M.H. Gutknecht, Changing the norm in conjugate gradient type algorithms, ETH IPS Research report."},{"key":"BF02145754_CR9","doi-asserted-by":"crossref","unstructured":"M.H. Gutknecht, Variants of BICGSTAB for matrices with complex spectrum, ETH IPS Research report 91-14.","DOI":"10.1137\/0914062"},{"key":"BF02145754_CR10","doi-asserted-by":"crossref","unstructured":"D.A.H. Jacobs, A generalization of the Conjugate-Gradient method to solve complex systems, IMA J. Numer. Anal. 6 (1986).","DOI":"10.1093\/imanum\/6.4.447"},{"key":"BF02145754_CR11","series-title":"Publications du Laboratoire d'Analyse Num\u00e9rique","volume-title":"M\u00e9thodes de gradient conjugu\u00e9","author":"P. Joly","year":"1984","unstructured":"P. Joly, M\u00e9thodes de gradient conjugu\u00e9, Publications du Laboratoire d'Analyse Num\u00e9rique Universit\u00e9 Pierre et Marie Curie, Paris (1984)."},{"key":"BF02145754_CR12","unstructured":"D.G. Luenberger,Introduction to Linear and Nonlinear Programming (Addison-Wesley, 1973)."},{"key":"BF02145754_CR13","unstructured":"N.M. Nachtigal, S.C. Reddy and L.N. Trefethen, How fast are nonsymmetric matrix iterations, Numerical Analysis Report 90-2, Massachusetts Institute of Technology (1990)."},{"key":"BF02145754_CR14","doi-asserted-by":"crossref","unstructured":"Y. Saad and M.H. Schultz, Gmres, a generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 7 (1986).","DOI":"10.1137\/0907058"},{"key":"BF02145754_CR15","doi-asserted-by":"crossref","unstructured":"P. Sonneveld, CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 10 (1989).","DOI":"10.1137\/0910004"},{"key":"BF02145754_CR16","doi-asserted-by":"crossref","unstructured":"P.K.W. Vinsome, Orthomin: an iterative method for solving sparse sets of simultaneous linear equations,Proc. 4th Symp. on Reservoir Simulation (1976).","DOI":"10.2118\/5729-MS"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02145754.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02145754\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02145754","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T14:45:31Z","timestamp":1683211531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02145754"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["BF02145754"],"URL":"https:\/\/doi.org\/10.1007\/bf02145754","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}