{"id":"https://openalex.org/W2083715026","doi":"https://doi.org/10.1137/s1064827599362314","title":"Flexible Conjugate Gradients","display_name":"Flexible Conjugate Gradients","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2083715026","doi":"https://doi.org/10.1137/s1064827599362314","mag":"2083715026"},"language":"en","primary_location":{"id":"doi:10.1137/s1064827599362314","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1064827599362314","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/65888","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057146535","display_name":"Yvan Notay","orcid":"https://orcid.org/0000-0001-7176-4890"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Yvan Notay","raw_affiliation_strings":["Service de M\u00e9trologie Nucl\u00e9aire, Universit\u00e9 Libre de Bruxelles (C.P. 165), 50, Av. F.D. Roosevelt, B-1050 Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Service de M\u00e9trologie Nucl\u00e9aire, Universit\u00e9 Libre de Bruxelles (C.P. 165), 50, Av. F.D. Roosevelt, B-1050 Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057146535"],"corresponding_institution_ids":["https://openalex.org/I132053463"],"apc_list":null,"apc_paid":null,"fwci":5.1604,"has_fulltext":false,"cited_by_count":226,"citation_normalized_percentile":{"value":0.95883438,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"22","issue":"4","first_page":"1444","last_page":"1460"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/preconditioner","display_name":"Preconditioner","score":0.9431520700454712},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.8345524072647095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7939536571502686},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.6491391062736511},{"id":"https://openalex.org/keywords/conjugate-residual-method","display_name":"Conjugate residual method","score":0.6390044689178467},{"id":"https://openalex.org/keywords/orthogonalization","display_name":"Orthogonalization","score":0.6278271079063416},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6119136214256287},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.5595613121986389},{"id":"https://openalex.org/keywords/derivation-of-the-conjugate-gradient-method","display_name":"Derivation of the conjugate gradient method","score":0.5578570365905762},{"id":"https://openalex.org/keywords/truncation","display_name":"Truncation (statistics)","score":0.5469834804534912},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5432873368263245},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5163906216621399},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.47513607144355774},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3668271601200104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36531251668930054},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.2881041169166565},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.2189960777759552},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.148004949092865},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10140693187713623},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.08626952767372131}],"concepts":[{"id":"https://openalex.org/C167431342","wikidata":"https://www.wikidata.org/wiki/Q1754327","display_name":"Preconditioner","level":3,"score":0.9431520700454712},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.8345524072647095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7939536571502686},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.6491391062736511},{"id":"https://openalex.org/C91394653","wikidata":"https://www.wikidata.org/wiki/Q5161159","display_name":"Conjugate residual method","level":4,"score":0.6390044689178467},{"id":"https://openalex.org/C47559304","wikidata":"https://www.wikidata.org/wiki/Q1702189","display_name":"Orthogonalization","level":2,"score":0.6278271079063416},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6119136214256287},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.5595613121986389},{"id":"https://openalex.org/C198562538","wikidata":"https://www.wikidata.org/wiki/Q5262612","display_name":"Derivation of the conjugate gradient method","level":5,"score":0.5578570365905762},{"id":"https://openalex.org/C106195933","wikidata":"https://www.wikidata.org/wiki/Q7847935","display_name":"Truncation (statistics)","level":2,"score":0.5469834804534912},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5432873368263245},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5163906216621399},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.47513607144355774},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3668271601200104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36531251668930054},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2881041169166565},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2189960777759552},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.148004949092865},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10140693187713623},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.08626952767372131},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/s1064827599362314","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1064827599362314","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.122.831","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.831","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://mntek3.ulb.ac.be/pub/docs/reports/pdf/2000_SISC_3.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.147.1520","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.1520","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cerfacs.fr/~douglas/mgnet/Conferences/CMCIM00/Papers/notay.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.35.7473","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.7473","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://mnsgi.ulb.ac.be/pub/docs/reports/ganmn_ps/ganmn9902r.ps.gz","raw_type":"text"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/65888","is_oa":true,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/65888","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM journal on scientific computing, 22","raw_type":"info:ulb-repo/semantics/openurl/article"}],"best_oa_location":{"id":"pmh:oai:dipot.ulb.ac.be:2013/65888","is_oa":true,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/65888","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM journal on scientific computing, 22","raw_type":"info:ulb-repo/semantics/openurl/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4000000059604645,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W18468166","https://openalex.org/W1981452262","https://openalex.org/W1983765886","https://openalex.org/W1985340647","https://openalex.org/W1992707134","https://openalex.org/W2003215511","https://openalex.org/W2022146461","https://openalex.org/W2022480337","https://openalex.org/W2026039932","https://openalex.org/W2032576830","https://openalex.org/W2041876368","https://openalex.org/W2045370380","https://openalex.org/W2056978740","https://openalex.org/W2061813658","https://openalex.org/W2064616889","https://openalex.org/W2072835905","https://openalex.org/W2074190947","https://openalex.org/W2075351838","https://openalex.org/W2082479178","https://openalex.org/W2087952846","https://openalex.org/W2107252004","https://openalex.org/W2109005370","https://openalex.org/W2113830538","https://openalex.org/W2316564661"],"related_works":["https://openalex.org/W2353110519","https://openalex.org/W2356365850","https://openalex.org/W2098528027","https://openalex.org/W2375597358","https://openalex.org/W3159557833","https://openalex.org/W3159907817","https://openalex.org/W2383960336","https://openalex.org/W2129625121","https://openalex.org/W3194092090","https://openalex.org/W2159515580"],"abstract_inverted_index":{"We":[0,79],"analyze":[1],"the":[2,15,19,36,58,65,68,73,82,87,99,104,117,126,131,148,153,157,162,165],"conjugate":[3],"gradient":[4],"(CG)":[5],"method":[6],"with":[7,122,130],"preconditioning":[8],"slightly":[9],"variable":[10],"from":[11],"one":[12],"iteration":[13],"to":[14,46,103,111],"next.":[16],"To":[17],"maintain":[18],"optimal":[20],"convergence":[21,59,84,118],"properties,":[22],"we":[23,44,50],"consider":[24],"a":[25,52],"variant":[26,150],"proposed":[27],"by":[28,94],"Axelsson":[29],"that":[30,55,57,167],"performs":[31],"an":[32],"explicit":[33],"orthogonalization":[34],"of":[35,64,89,125,164],"search":[37],"directions":[38],"vectors.":[39],"For":[40],"this":[41],"method,":[42,134,155],"which":[43],"refer":[45],"as":[47,70,72,120],"flexible":[48,149],"CG,":[49],"develop":[51],"theoretical":[53],"analysis":[54],"shows":[56],"rate":[60,85],"is":[61,119],"essentially":[62],"independent":[63],"variations":[66,138,166],"in":[67],"preconditioner":[69],"long":[71],"latter":[74],"are":[75,139],"kept":[76],"sufficiently":[77],"small.":[78],"further":[80],"discuss":[81],"real":[83],"on":[86,98],"basis":[88],"some":[90,115],"heuristic":[91],"arguments":[92],"supported":[93],"numerical":[95],"experiments.":[96],"Depending":[97],"eigenvalue":[100],"distribution":[101],"corresponding":[102],"fixed":[105],"reference":[106],"preconditioner,":[107],"several":[108],"situations":[109],"have":[110],"be":[112,169],"distinguished.":[113],"In":[114,145],"cases,":[116,147],"fast":[121],"truncated":[123],"versions":[124],"algorithm":[127],"or":[128],"even":[129],"standard":[132,154],"CG":[133],"whereas":[135],"quite":[136],"large":[137],"allowed":[140],"without":[141],"too":[142],"much":[143],"penalty.":[144],"other":[146],"effectively":[151],"outperforms":[152],"while":[156],"need":[158],"for":[159],"truncation":[160],"limits":[161],"size":[163],"can":[168],"reasonably":[170],"allowed.":[171]},"counts_by_year":[{"year":2026,"cited_by_count":9},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":12}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}