{"id":"https://openalex.org/W9532344","doi":"https://doi.org/10.1137/140989492","title":"Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication","display_name":"Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W9532344","doi":"https://doi.org/10.1137/140989492","mag":"9532344"},"language":"en","primary_location":{"id":"doi:10.1137/140989492","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140989492","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"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 Matrix Analysis and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040521001","display_name":"Laura Grigori","orcid":"https://orcid.org/0000-0002-5880-1076"},"institutions":[{"id":"https://openalex.org/I4210158291","display_name":"Laboratoire Jacques-Louis Lions","ror":"https://ror.org/04xmteb38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I204730241","https://openalex.org/I39804081","https://openalex.org/I4210141950","https://openalex.org/I4210158291"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Laura Grigori","raw_affiliation_strings":["Algorithms and parallel tools for integrated numerical simulations","Laboratoire Jacques-Louis Lions"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms and parallel tools for integrated numerical simulations","institution_ids":[]},{"raw_affiliation_string":"Laboratoire Jacques-Louis Lions","institution_ids":["https://openalex.org/I4210158291"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079002681","display_name":"Sophie Moufawad","orcid":"https://orcid.org/0000-0002-5618-6890"},"institutions":[{"id":"https://openalex.org/I4210158291","display_name":"Laboratoire Jacques-Louis Lions","ror":"https://ror.org/04xmteb38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I204730241","https://openalex.org/I39804081","https://openalex.org/I4210141950","https://openalex.org/I4210158291"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sophie Moufawad","raw_affiliation_strings":["Algorithms and parallel tools for integrated numerical simulations","Laboratoire Jacques-Louis Lions"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms and parallel tools for integrated numerical simulations","institution_ids":[]},{"raw_affiliation_string":"Laboratoire Jacques-Louis Lions","institution_ids":["https://openalex.org/I4210158291"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107748698","display_name":"Fr\u00e9d\u00e9ric Nataf","orcid":"https://orcid.org/0000-0003-2813-3481"},"institutions":[{"id":"https://openalex.org/I4210158291","display_name":"Laboratoire Jacques-Louis Lions","ror":"https://ror.org/04xmteb38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I204730241","https://openalex.org/I39804081","https://openalex.org/I4210141950","https://openalex.org/I4210158291"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Frederic Nataf","raw_affiliation_strings":["Laboratoire Jacques-Louis Lions","Algorithms and parallel tools for integrated numerical simulations"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire Jacques-Louis Lions","institution_ids":["https://openalex.org/I4210158291"]},{"raw_affiliation_string":"Algorithms and parallel tools for integrated numerical simulations","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.8486,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.96827821,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"37","issue":"2","first_page":"744","last_page":"773"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T10339","display_name":"Advanced Numerical Methods in Computational Mathematics","score":0.9846000075340271,"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.9794999957084656,"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/krylov-subspace","display_name":"Krylov subspace","score":0.9691935777664185},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.8198102116584778},{"id":"https://openalex.org/keywords/generalized-minimal-residual-method","display_name":"Generalized minimal residual method","score":0.7146667242050171},{"id":"https://openalex.org/keywords/parallelizable-manifold","display_name":"Parallelizable manifold","score":0.7087660431861877},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.6227914094924927},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5748318433761597},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5073239207267761},{"id":"https://openalex.org/keywords/conjugate-residual-method","display_name":"Conjugate residual method","score":0.46754685044288635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41464605927467346},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40610066056251526},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.39584577083587646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3707071542739868},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.3294937014579773},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.18773049116134644},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.06626066565513611},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05049198865890503}],"concepts":[{"id":"https://openalex.org/C147060835","wikidata":"https://www.wikidata.org/wiki/Q1757151","display_name":"Krylov subspace","level":3,"score":0.9691935777664185},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.8198102116584778},{"id":"https://openalex.org/C155332342","wikidata":"https://www.wikidata.org/wiki/Q1432976","display_name":"Generalized minimal residual method","level":3,"score":0.7146667242050171},{"id":"https://openalex.org/C148047603","wikidata":"https://www.wikidata.org/wiki/Q1014612","display_name":"Parallelizable manifold","level":2,"score":0.7087660431861877},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.6227914094924927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5748318433761597},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5073239207267761},{"id":"https://openalex.org/C91394653","wikidata":"https://www.wikidata.org/wiki/Q5161159","display_name":"Conjugate residual method","level":4,"score":0.46754685044288635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41464605927467346},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40610066056251526},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.39584577083587646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3707071542739868},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.3294937014579773},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.18773049116134644},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.06626066565513611},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05049198865890503},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/140989492","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140989492","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"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 Matrix Analysis and Applications","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01357899v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01357899","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Matrix Analysis and Applications, 2016, 37 (2), pp.744-773. ⟨10.1137/140989492⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W90336910","https://openalex.org/W98110951","https://openalex.org/W1907157228","https://openalex.org/W1968250174","https://openalex.org/W1980677368","https://openalex.org/W1986914969","https://openalex.org/W2009837614","https://openalex.org/W2024149451","https://openalex.org/W2035080386","https://openalex.org/W2040425799","https://openalex.org/W2041519450","https://openalex.org/W2045809113","https://openalex.org/W2066692739","https://openalex.org/W2067028470","https://openalex.org/W2080225225","https://openalex.org/W2082187902","https://openalex.org/W2117366131","https://openalex.org/W2128836543","https://openalex.org/W2140153041","https://openalex.org/W2155216327","https://openalex.org/W2157237396","https://openalex.org/W2165439482","https://openalex.org/W2197739590","https://openalex.org/W2316564661","https://openalex.org/W2738519034","https://openalex.org/W3099523876"],"related_works":["https://openalex.org/W2129625121","https://openalex.org/W4205386174","https://openalex.org/W1848849174","https://openalex.org/W2035892225","https://openalex.org/W4283656204","https://openalex.org/W1976157534","https://openalex.org/W4378945386","https://openalex.org/W2798286561","https://openalex.org/W2896548519","https://openalex.org/W1993483669"],"abstract_inverted_index":{"In":[0],"this":[1,76],"paper":[2,77],"we":[3,58,73],"introduce":[4],"a":[5,23,32,47],"new":[6],"approach":[7],"for":[8,60],"reducing":[9],"communication":[10],"in":[11,67,75,89],"Krylov":[12,20,43,51,81,102],"subspace":[13,21,44,52,83],"methods":[14,84],"that":[15,78],"consists":[16],"of":[17,25,35,38,49,63,70,91],"enlarging":[18],"the":[19,36,50,61,64,79],"by":[22],"maximum":[24],"$t$":[26],"vectors":[27],"per":[28],"iteration,":[29],"based":[30],"on":[31],"domain":[33],"decomposition":[34],"graph":[37],"$A$.":[39],"The":[40],"obtained":[41],"enlarged":[42,80],"$\\mathscr{K}_{k,t}(A,r_0)$":[45,68],"is":[46],"superset":[48],"$\\mathcal{K}_k(A,r_0)$,":[53],"$\\mathcal{K}_k(A,r_0)":[54],"\\subset":[55],"\\mathscr{K}_{k,t}(A,r_0)$.":[56],"Thus,":[57],"search":[59],"solution":[62],"system":[65],"$Ax=b$":[66],"instead":[69],"$\\mathcal{K}_k(A,r_0)$.":[71],"Moreover,":[72],"show":[74],"projection":[82],"lead":[85],"to":[86,101],"faster":[87],"convergence":[88],"terms":[90],"iterations":[92],"and":[93],"parallelizable":[94],"algorithms":[95],"with":[96,99],"less":[97],"communication,":[98],"respect":[100],"methods.":[103]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}