{"id":"https://openalex.org/W1968407531","doi":"https://doi.org/10.1137/090749645","title":"Some Improvements for the Fast Sweeping Method","display_name":"Some Improvements for the Fast Sweeping Method","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1968407531","doi":"https://doi.org/10.1137/090749645","mag":"1968407531"},"language":"en","primary_location":{"id":"doi:10.1137/090749645","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090749645","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033330108","display_name":"Stanley Bak","orcid":"https://orcid.org/0000-0003-4947-9553"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stanley Bak","raw_affiliation_strings":["sbak2@illinois.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"sbak2@illinois.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015474111","display_name":"Joyce R. McLaughlin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joyce McLaughlin","raw_affiliation_strings":["[email\u00a0protected]#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[email\u00a0protected]#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061168621","display_name":"Daniel Renzi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Renzi","raw_affiliation_strings":["danielprenzi@yahoo.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"danielprenzi@yahoo.com#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.1531,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.95396561,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"32","issue":"5","first_page":"2853","last_page":"2874"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9965999722480774,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9965999722480774,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9934999942779541,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9907000064849854,"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/fast-marching-method","display_name":"Fast marching method","score":0.7234401702880859},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6082423329353333},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5999587774276733},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5711250305175781},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.569168746471405},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5421936511993408},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5358862280845642},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.52297043800354},{"id":"https://openalex.org/keywords/fixed-point-iteration","display_name":"Fixed-point iteration","score":0.4475496709346771},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43286648392677307},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.4244723320007324},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4214929938316345},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33484792709350586},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.31004324555397034},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.1979874074459076},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12828785181045532},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0796440839767456}],"concepts":[{"id":"https://openalex.org/C17866373","wikidata":"https://www.wikidata.org/wiki/Q5437042","display_name":"Fast marching method","level":2,"score":0.7234401702880859},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6082423329353333},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5999587774276733},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5711250305175781},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.569168746471405},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5421936511993408},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5358862280845642},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.52297043800354},{"id":"https://openalex.org/C157449380","wikidata":"https://www.wikidata.org/wiki/Q1030759","display_name":"Fixed-point iteration","level":3,"score":0.4475496709346771},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43286648392677307},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.4244723320007324},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4214929938316345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33484792709350586},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.31004324555397034},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.1979874074459076},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12828785181045532},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0796440839767456},{"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/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/090749645","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090749645","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1980251225","https://openalex.org/W1989131020","https://openalex.org/W1990466879","https://openalex.org/W1999244633","https://openalex.org/W1999690352","https://openalex.org/W1999696052","https://openalex.org/W2003009438","https://openalex.org/W2025550225","https://openalex.org/W2041138953","https://openalex.org/W2049391017","https://openalex.org/W2054113582","https://openalex.org/W2055341194","https://openalex.org/W2065474496","https://openalex.org/W2118268140","https://openalex.org/W2132003031","https://openalex.org/W2138571234","https://openalex.org/W2143454084","https://openalex.org/W2154018969","https://openalex.org/W2157204523","https://openalex.org/W2160106931","https://openalex.org/W2168463767","https://openalex.org/W2561843528","https://openalex.org/W2749408143"],"related_works":["https://openalex.org/W2147776645","https://openalex.org/W2122094047","https://openalex.org/W399006150","https://openalex.org/W2049306475","https://openalex.org/W4292324088","https://openalex.org/W2027835668","https://openalex.org/W2997140122","https://openalex.org/W4362700221","https://openalex.org/W2403877097","https://openalex.org/W2033206711"],"abstract_inverted_index":{"In":[0],"this":[1,237],"paper,":[2],"we":[3,99,157,211],"outline":[4],"two":[5,160,229,233],"improvements":[6],"to":[7,12,63,181,191,255],"the":[8,14,17,27,42,50,55,68,87,90,101,115,126,133,145,159,166,175,196,201,213,248,258,261,269,274,295,299],"fast":[9,37,47,69,84,146,202,249,262],"sweeping":[10,38,70,147,203,250],"method":[11,18,71,240,246,271],"improve":[13],"speed":[15,28,43,56,91],"of":[16,52,107,165,235,268,298,305],"in":[19,24,86,169],"general":[20],"and":[21,46,222,284],"more":[22],"specifically":[23],"cases":[25],"where":[26,89],"is":[29,35,49,62,92,188,241,266],"changing":[30,93],"rapidly.":[31,58,94],"The":[32,59,95,153],"conventional":[33],"wisdom":[34],"that":[36,72,110,120,174],"works":[39],"best":[40],"when":[41,54],"changes":[44,57],"slowly,":[45],"marching":[48,263],"algorithm":[51],"choice":[53],"goal":[60],"here":[61],"achieve":[64],"run":[65],"times":[66],"for":[67,124,272],"are":[73],"at":[74,119,184,206],"least":[75,207],"as":[76],"fast,":[77],"or":[78,123],"faster,":[79],"than":[80],"competitive":[81],"methods,":[82],"e.g.":[83],"marching,":[85],"case":[88],"first":[96],"improvement,":[97,155],"which":[98,125,156],"call":[100,158],"locking":[102],"method,":[103,162,251],"dynamically":[104],"keeps":[105,163],"track":[106],"grid":[108,121,214],"points":[109,138,168,177,194,215],"have":[111],"either":[112],"already":[113],"had":[114],"solution":[116,127],"successfully":[117,130],"calculated":[118,131],"point":[122],"cannot":[128],"be":[129,141,182],"during":[132,144],"current":[134],"iteration.":[135],"These":[136],"locked":[137,176],"can":[139],"quickly":[140],"skipped":[142],"over":[143],"iterations,":[148],"avoiding":[149],"many":[150],"time-consuming":[151],"calculations.":[152],"second":[154],"queue":[161],"all":[164],"unlocked":[167],"a":[170,242,278,303],"data":[171,197],"structure":[172,198],"so":[173],"no":[178],"longer":[179],"need":[180],"visited":[183],"all.":[185],"Unfortunately,":[186],"it":[187,253],"not":[189],"possible":[190],"insert":[192],"new":[193],"into":[195,216],"while":[199],"maintaining":[200],"ordering":[204],"without":[205],"occasionally":[208],"sorting.":[209],"Instead,":[210],"segregate":[212],"those":[217,223],"with":[218,224],"small":[219],"predicted":[220,226],"solutions":[221,227],"large":[225],"using":[228],"queues.":[230],"We":[231,293],"give":[232],"ways":[234],"performing":[236],"segregation.":[238],"This":[239],"label":[243],"correcting":[244],"(iterative)":[245],"like":[247,260],"but":[252],"tends":[254],"operate":[256],"near":[257],"front":[259],"method.":[264],"It":[265],"reminiscent":[267],"threshold":[270],"finding":[273],"shortest":[275],"path":[276],"on":[277,302],"network,":[279],"[F.":[280],"Glover,":[281],"D.":[282],"Klingman,":[283],"N.":[285],"Phillips,":[286],"Oper.":[287],"Res.,":[288],"33":[289],"(1985),":[290],"pp.":[291],"65\u201373].":[292],"demonstrate":[294],"numerical":[296],"efficiency":[297],"improved":[300],"methods":[301],"number":[304],"examples.":[306]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}