{"id":"https://openalex.org/W2066910699","doi":"https://doi.org/10.1137/11084488x","title":"A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration","display_name":"A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2066910699","doi":"https://doi.org/10.1137/11084488x","mag":"2066910699"},"language":"en","primary_location":{"id":"doi:10.1137/11084488x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/11084488x","pdf_url":null,"source":{"id":"https://openalex.org/S203348814","display_name":"SIAM Journal on Numerical Analysis","issn_l":"0036-1429","issn":["0036-1429","1095-7170"],"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 Numerical Analysis","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/A5012778133","display_name":"Klaus Neymeyr","orcid":"https://orcid.org/0000-0002-1464-2851"},"institutions":[{"id":"https://openalex.org/I4665924","display_name":"University of Rostock","ror":"https://ror.org/03zdwsf69","country_code":"DE","type":"education","lineage":["https://openalex.org/I4665924"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Klaus Neymeyr","raw_affiliation_strings":["Universit\u00e4t Rostock, Institut f\u00fcr Mathematik, Ulmenstra\u00dfe 69, 18057 Rostock, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Rostock, Institut f\u00fcr Mathematik, Ulmenstra\u00dfe 69, 18057 Rostock, Germany","institution_ids":["https://openalex.org/I4665924"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012778133"],"corresponding_institution_ids":["https://openalex.org/I4665924"],"apc_list":null,"apc_paid":null,"fwci":1.7279,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.84811564,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"50","issue":"6","first_page":"3188","last_page":"3207"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9991999864578247,"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/T10739","display_name":"Electromagnetic Scattering and Analysis","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/preconditioner","display_name":"Preconditioner","score":0.9193800687789917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7871307730674744},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5659452080726624},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.5579226613044739},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5543164014816284},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4796169698238373},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.4788553714752197},{"id":"https://openalex.org/keywords/method-of-steepest-descent","display_name":"Method of steepest descent","score":0.4320809245109558},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4173104465007782},{"id":"https://openalex.org/keywords/rayleigh\u2013ritz-method","display_name":"Rayleigh\u2013Ritz method","score":0.41249918937683105},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3328792452812195},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.2854157090187073},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10323303937911987},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09904229640960693}],"concepts":[{"id":"https://openalex.org/C167431342","wikidata":"https://www.wikidata.org/wiki/Q1754327","display_name":"Preconditioner","level":3,"score":0.9193800687789917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7871307730674744},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5659452080726624},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.5579226613044739},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5543164014816284},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4796169698238373},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.4788553714752197},{"id":"https://openalex.org/C158847443","wikidata":"https://www.wikidata.org/wiki/Q1997812","display_name":"Method of steepest descent","level":2,"score":0.4320809245109558},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4173104465007782},{"id":"https://openalex.org/C70940138","wikidata":"https://www.wikidata.org/wiki/Q852247","display_name":"Rayleigh\u2013Ritz method","level":3,"score":0.41249918937683105},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3328792452812195},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2854157090187073},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10323303937911987},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09904229640960693},{"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/C182310444","wikidata":"https://www.wikidata.org/wiki/Q1332643","display_name":"Boundary value problem","level":2,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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":1,"locations":[{"id":"doi:10.1137/11084488x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/11084488x","pdf_url":null,"source":{"id":"https://openalex.org/S203348814","display_name":"SIAM Journal on Numerical Analysis","issn_l":"0036-1429","issn":["0036-1429","1095-7170"],"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 Numerical Analysis","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320327736","display_name":"Universit\u00e4t Rostock","ror":"https://ror.org/03zdwsf69"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1575147392","https://openalex.org/W1964945475","https://openalex.org/W1966236905","https://openalex.org/W1974907720","https://openalex.org/W1981308866","https://openalex.org/W2027436456","https://openalex.org/W2037034729","https://openalex.org/W2047353059","https://openalex.org/W2076995010","https://openalex.org/W2106311058","https://openalex.org/W2109443444","https://openalex.org/W2139039544","https://openalex.org/W2162109254","https://openalex.org/W3029645440","https://openalex.org/W3105832093"],"related_works":["https://openalex.org/W2091325992","https://openalex.org/W3197592642","https://openalex.org/W2089099677","https://openalex.org/W937190428","https://openalex.org/W2014026680","https://openalex.org/W1572718068","https://openalex.org/W3216172936","https://openalex.org/W1969192917","https://openalex.org/W2093643889","https://openalex.org/W2091864104"],"abstract_inverted_index":{"Preconditioned":[0],"gradient":[1,24,67],"iterations":[2],"for":[3,16,57,73],"very":[4],"large":[5],"eigenvalue":[6],"problems":[7],"are":[8,34],"efficient":[9],"solvers":[10],"with":[11,30,69],"growing":[12],"popularity.":[13],"However,":[14],"only":[15],"the":[17,22,58,65,70,86,109],"simplest":[18],"preconditioned":[19,23,27,59,66],"eigensolver,":[20],"namely":[21],"iteration":[25,62,68],"(or":[26],"inverse":[28],"iteration)":[29],"fixed":[31],"step":[32],"size,":[33],"sharp":[35,52],"nonasymptotic":[36],"convergence":[37,53,77],"estimates":[38,41],"known.":[39],"These":[40],"require":[42],"a":[43,50],"properly":[44],"scaled":[45,99],"preconditioner.":[46],"In":[47],"this":[48,93],"paper":[49],"new":[51,80,94],"estimate":[54,81,95],"is":[55,96],"derived":[56],"steepest":[60],"descent":[61],"which":[63],"combines":[64],"Rayleigh--Ritz":[71,105],"procedure":[72,106],"optimal":[74,110],"line":[75],"search":[76],"acceleration.":[78],"The":[79,89,104],"always":[82],"improves":[83],"that":[84,97],"of":[85,92],"fixed-step-size":[87],"iteration.":[88],"practical":[90],"importance":[91],"arbitrarily":[98],"preconditioners":[100],"can":[101],"be":[102],"used.":[103],"implicitly":[107],"computes":[108],"scaling":[111],"constant.":[112]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-19T08:26:33.389920","created_date":"2025-10-10T00:00:00"}