{"id":"https://openalex.org/W2158944629","doi":"https://doi.org/10.1137/s1064827501399985","title":"A Broyden Rank <i>p</i>+1 Update Continuation Method with Subspace Iteration","display_name":"A Broyden Rank <i>p</i>+1 Update Continuation Method with Subspace Iteration","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2158944629","doi":"https://doi.org/10.1137/s1064827501399985","mag":"2158944629"},"language":"en","primary_location":{"id":"doi:10.1137/s1064827501399985","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1064827501399985","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":"https://research.tue.nl/en/publications/41b27b4d-31d2-4921-8a7c-b7916628c549","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111919235","display_name":"T.L. van Noorden","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"T. L. van Noorden","raw_affiliation_strings":["Utrecht University, Department of Mathematics, P.O. Box 80010, 3508 TA Utrecht, The Nether-lands"],"affiliations":[{"raw_affiliation_string":"Utrecht University, Department of Mathematics, P.O. Box 80010, 3508 TA Utrecht, The Nether-lands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061872406","display_name":"Sjoerd M. Verduyn Lunel","orcid":"https://orcid.org/0000-0001-6161-9980"},"institutions":[{"id":"https://openalex.org/I121797337","display_name":"Leiden University","ror":"https://ror.org/027bh9e22","country_code":"NL","type":"education","lineage":["https://openalex.org/I121797337"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"S. M. Verduyn Lunel","raw_affiliation_strings":["Universiteit Leiden, Department of Mathematics, Niels Bohrweg 1, 2333 CA Leiden, The Nether-lands"],"affiliations":[{"raw_affiliation_string":"Universiteit Leiden, Department of Mathematics, Niels Bohrweg 1, 2333 CA Leiden, The Nether-lands","institution_ids":["https://openalex.org/I121797337"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110461662","display_name":"A. Bliek","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"A. Bliek","raw_affiliation_strings":["Universiteit van Amsterdam, Department of Chemical Engineering, Nieuwe Achtergracht 166, 1018 WV Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Universiteit van Amsterdam, Department of Chemical Engineering, Nieuwe Achtergracht 166, 1018 WV Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110461662"],"corresponding_institution_ids":["https://openalex.org/I887064364"],"apc_list":null,"apc_paid":null,"fwci":2.005,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85887097,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"25","issue":"6","first_page":"1921","last_page":"1940"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11416","display_name":"Numerical methods for differential equations","score":0.996999979019165,"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"}},"topics":[{"id":"https://openalex.org/T11416","display_name":"Numerical methods for differential equations","score":0.996999979019165,"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"}},{"id":"https://openalex.org/T11206","display_name":"Model Reduction and Neural Networks","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8600919246673584},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5889756679534912},{"id":"https://openalex.org/keywords/continuation","display_name":"Continuation","score":0.583584189414978},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5648266673088074},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5610729455947876},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.553418755531311},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5363510847091675},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.5293541550636292},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5221550464630127},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.4429892301559448},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.43985965847969055},{"id":"https://openalex.org/keywords/numerical-analysis","display_name":"Numerical analysis","score":0.42338141798973083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28456223011016846},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.2593384385108948},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.23883026838302612},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10288935899734497},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09737911820411682}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8600919246673584},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5889756679534912},{"id":"https://openalex.org/C88626702","wikidata":"https://www.wikidata.org/wiki/Q1128903","display_name":"Continuation","level":2,"score":0.583584189414978},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5648266673088074},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5610729455947876},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.553418755531311},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5363510847091675},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.5293541550636292},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5221550464630127},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.4429892301559448},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.43985965847969055},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.42338141798973083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28456223011016846},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2593384385108948},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.23883026838302612},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10288935899734497},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09737911820411682},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s1064827501399985","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1064827501399985","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:pure.tue.nl:openaire/41b27b4d-31d2-4921-8a7c-b7916628c549","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/41b27b4d-31d2-4921-8a7c-b7916628c549","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Noorden, van, T L, Verduyn Lunel, S M & Bliek, A 2004, 'A Broyden rank p+1 update continuation method with subspace iteration', SIAM Journal on Scientific Computing, vol. 25, no. 6, pp. 1921-1940. https://doi.org/10.1137/S1064827501399985","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/41b27b4d-31d2-4921-8a7c-b7916628c549","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/41b27b4d-31d2-4921-8a7c-b7916628c549","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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, 25(6), 1921 - 1940. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/41b27b4d-31d2-4921-8a7c-b7916628c549","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/41b27b4d-31d2-4921-8a7c-b7916628c549","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Noorden, van, T L, Verduyn Lunel, S M & Bliek, A 2004, 'A Broyden rank p+1 update continuation method with subspace iteration', SIAM Journal on Scientific Computing, vol. 25, no. 6, pp. 1921-1940. https://doi.org/10.1137/S1064827501399985","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1563653928","https://openalex.org/W1596321532","https://openalex.org/W1602747135","https://openalex.org/W1965805718","https://openalex.org/W1977822596","https://openalex.org/W1980047986","https://openalex.org/W2015898169","https://openalex.org/W2034183452","https://openalex.org/W2051478684","https://openalex.org/W2051669046","https://openalex.org/W2068484625","https://openalex.org/W2068485378","https://openalex.org/W2084236346","https://openalex.org/W2105352605","https://openalex.org/W2113085897","https://openalex.org/W2152309602","https://openalex.org/W2154230967","https://openalex.org/W4206651839","https://openalex.org/W4243897399"],"related_works":["https://openalex.org/W3158572700","https://openalex.org/W2358591430","https://openalex.org/W2350788688","https://openalex.org/W2357287617","https://openalex.org/W2103912232","https://openalex.org/W3140142921","https://openalex.org/W2785860296","https://openalex.org/W4308670056","https://openalex.org/W2084894190","https://openalex.org/W1964267519"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"an":[5],"efficient":[6],"branch-following":[7],"procedure":[8,37,79],"that":[9],"can":[10],"be":[11],"used":[12],"not":[13],"only":[14],"to":[15,28,46,86],"compute":[16],"branches":[17],"of":[18,21,32,77,89,92,105],"periodic":[19,34,90],"solutions":[20],"periodically":[22],"forced":[23],"dynamical":[24],"systems":[25],"but":[26],"also":[27],"determine":[29,47],"the":[30,33,48,56,78,87,106],"stability":[31],"solutions.":[35],"The":[36,51,82],"combines":[38],"Broyden's":[39],"method":[40,45,52,83],"with":[41,55,102],"a":[42,93],"subspace":[43],"iteration":[44],"dominant":[49],"eigenvalues.":[50],"has":[53],"connections":[54],"hybrid":[57,107],"Newton--Picard":[58,108],"methods":[59],"developed":[60],"by":[61],"Lust":[62],"et":[63],"al.":[64],"in":[65],"[SIAM":[66],"J.":[67],"Sci.":[68],"Comput.,":[69],"19":[70],"(1998)":[71],"pp.":[72],"1188--1209].":[73],"A":[74],"convergence":[75],"analysis":[76],"is":[80,84,100],"presented.":[81],"applied":[85],"computation":[88],"states":[91],"reverse":[94],"flow":[95],"reactor,":[96],"and":[97],"its":[98],"performance":[99],"compared":[101],"two":[103],"variants":[104],"method.":[109]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}