{"id":"https://openalex.org/W2170485468","doi":"https://doi.org/10.1137/060658862","title":"Adaptive Multiprecision Path Tracking","display_name":"Adaptive Multiprecision Path Tracking","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2170485468","doi":"https://doi.org/10.1137/060658862","mag":"2170485468"},"language":"en","primary_location":{"id":"doi:10.1137/060658862","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060658862","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/A5089126031","display_name":"Daniel J. Bates","orcid":"https://orcid.org/0000-0003-2985-0554"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel J. Bates","raw_affiliation_strings":["Institute for Mathematics and its Applications, University of Minnesota, Minneapolis, MN 55122"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Mathematics and its Applications, University of Minnesota, Minneapolis, MN 55122","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007214938","display_name":"Jonathan D. Hauenstein","orcid":"https://orcid.org/0000-0002-9252-8210"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan D. Hauenstein","raw_affiliation_strings":["Department of Mathematics, University of Notre Dame, Notre Dame, IN 46556"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Notre Dame, Notre Dame, IN 46556","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103556278","display_name":"Andrew J. Sommese","orcid":null},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew J. Sommese","raw_affiliation_strings":["Department of Mathematics, University of Notre Dame, Notre Dame, IN 46556"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Notre Dame, Notre Dame, IN 46556","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050683196","display_name":"Charles W. Wampler","orcid":"https://orcid.org/0000-0002-9790-1600"},"institutions":[{"id":"https://openalex.org/I118136607","display_name":"General Motors (United States)","ror":"https://ror.org/05addee68","country_code":"US","type":"company","lineage":["https://openalex.org/I118136607"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Charles W. Wampler","raw_affiliation_strings":["General Motors Research and Development, Mail Code 480-106-359, 30500 Mound Road, Warren, MI 48090"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"General Motors Research and Development, Mail Code 480-106-359, 30500 Mound Road, Warren, MI 48090","institution_ids":["https://openalex.org/I118136607"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.9351,"has_fulltext":false,"cited_by_count":104,"citation_normalized_percentile":{"value":0.98483521,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"46","issue":"2","first_page":"722","last_page":"746"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9995999932289124,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9995999932289124,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9965000152587891,"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9886000156402588,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7312567234039307},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.6336777210235596},{"id":"https://openalex.org/keywords/tracking","display_name":"Tracking (education)","score":0.5996302962303162},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5867226719856262},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5441211462020874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5332298874855042},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47443974018096924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4550645053386688},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.41555720567703247},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4111718535423279},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.3798705041408539},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.24656596779823303},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12924465537071228}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7312567234039307},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.6336777210235596},{"id":"https://openalex.org/C2775936607","wikidata":"https://www.wikidata.org/wiki/Q466845","display_name":"Tracking (education)","level":2,"score":0.5996302962303162},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5867226719856262},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5441211462020874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5332298874855042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47443974018096924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4550645053386688},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.41555720567703247},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4111718535423279},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.3798705041408539},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.24656596779823303},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12924465537071228},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C19417346","wikidata":"https://www.wikidata.org/wiki/Q7922","display_name":"Pedagogy","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/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/060658862","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060658862","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.159.3308","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.3308","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nd.edu/~jhauenst/preprints/bhswAMP.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.67.9077","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.9077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nd.edu/~sommese/preprints/bhswAMP.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.73.3980","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.3980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nd.edu/~sommese/preprints/bhswAMP.ps","raw_type":"text"},{"id":"pmh:oai:bibcyt.ucla.edu.ve:T070300015767/7","is_oa":false,"landing_page_url":"http://bibcyt.ucla.edu.ve/cgi-win/be_alex.exe?Acceso=T070300015767/7&Nombrebd=Bciucla","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1581944927","display_name":"Collaborative Research: Numerical Algorithms and Software for Solving Polynomial Systems with Parameters","funder_award_id":"0410047","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310260","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43"},{"id":"https://openalex.org/F4320313677","display_name":"Arthur J. Schmitt Foundation","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W178772886","https://openalex.org/W1570420806","https://openalex.org/W1676198905","https://openalex.org/W1760551737","https://openalex.org/W1965520434","https://openalex.org/W1966287322","https://openalex.org/W1974585479","https://openalex.org/W1975927407","https://openalex.org/W1985456081","https://openalex.org/W1985548249","https://openalex.org/W2019656110","https://openalex.org/W2028576930","https://openalex.org/W2030170144","https://openalex.org/W2035180740","https://openalex.org/W2035349465","https://openalex.org/W2035953755","https://openalex.org/W2043938310","https://openalex.org/W2066409969","https://openalex.org/W2067437385","https://openalex.org/W2088986191","https://openalex.org/W2093101196","https://openalex.org/W2107996047","https://openalex.org/W2132476962","https://openalex.org/W2144917506","https://openalex.org/W2186590998","https://openalex.org/W2339854536","https://openalex.org/W2752853835"],"related_works":["https://openalex.org/W2116465486","https://openalex.org/W830396839","https://openalex.org/W3196508834","https://openalex.org/W2171940562","https://openalex.org/W2101572961","https://openalex.org/W2490317825","https://openalex.org/W2154884030","https://openalex.org/W2107199004","https://openalex.org/W3031443042","https://openalex.org/W4293070556"],"abstract_inverted_index":{"This":[0],"article":[1],"treats":[2],"numerical":[3,12,49],"methods":[4],"for":[5,137],"tracking":[6,83],"an":[7,96],"implicitly":[8],"defined":[9],"path.":[10,38,93],"The":[11],"precision":[13,50,62,80,106,116],"required":[14],"to":[15,23,76,87,102,109],"successfully":[16],"track":[17],"such":[18],"a":[19,25,46],"path":[20],"is":[21,65],"difficult":[22],"predict":[24],"priori,":[26],"and":[27,128],"indeed":[28],"it":[29,72],"may":[30],"change":[31],"dramatically":[32],"through":[33],"the":[34,37,52,79,82,88,92,115,123],"course":[35],"of":[36,91,126,140],"In":[39],"current":[40],"practice,":[41],"one":[42],"must":[43],"either":[44,103],"choose":[45],"conservatively":[47],"large":[48],"at":[51],"outset":[53],"or":[54,112],"rerun":[55],"paths":[56],"multiple":[57],"times":[58],"in":[59,85,107],"successively":[60],"higher":[61],"until":[63],"success":[64],"achieved.":[66],"To":[67],"avoid":[68],"unnecessary":[69],"computational":[70],"cost,":[71],"would":[73],"be":[74,100],"preferable":[75],"adaptively":[77],"adjust":[78,105],"as":[81,135],"proceeds":[84],"response":[86,108],"local":[89],"conditioning":[90],"We":[94,120],"present":[95],"algorithm":[97],"that":[98],"can":[99],"set":[101,114],"reactively":[104],"step":[110],"failure":[111],"proactively":[113],"using":[117],"error":[118],"estimates.":[119],"then":[121],"test":[122],"relative":[124],"merits":[125],"reactive":[127],"proactive":[129],"adaptation":[130],"on":[131],"several":[132],"examples":[133],"arising":[134],"homotopies":[136],"solving":[138],"systems":[139],"polynomial":[141],"equations.":[142]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":9}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}