{"id":"https://openalex.org/W1995868331","doi":"https://doi.org/10.1137/080727439","title":"Marker Redistancing/Level Set Method for High-Fidelity Implicit Interface Tracking","display_name":"Marker Redistancing/Level Set Method for High-Fidelity Implicit Interface Tracking","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1995868331","doi":"https://doi.org/10.1137/080727439","mag":"1995868331"},"language":"en","primary_location":{"id":"doi:10.1137/080727439","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080727439","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/A5047284311","display_name":"Robert Nourgaliev","orcid":"https://orcid.org/0000-0002-1749-3572"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Robert Nourgaliev","raw_affiliation_strings":["robert.nourgaliev@inl.gov and samet.kadioglu@inl.gov and vincent.mousseau@inl.gov#TAB#"],"affiliations":[{"raw_affiliation_string":"robert.nourgaliev@inl.gov and samet.kadioglu@inl.gov and vincent.mousseau@inl.gov#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030484534","display_name":"Samet Y. Kadioglu","orcid":"https://orcid.org/0000-0002-6909-5306"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Samet Kadioglu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5107443232","display_name":"Vincent Mousseau","orcid":"https://orcid.org/0000-0001-8574-3337"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vincent Mousseau","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047284311"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6864,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.71332041,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"32","issue":"1","first_page":"320","last_page":"348"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10339","display_name":"Advanced Numerical Methods in Computational Mathematics","score":0.996999979019165,"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"}},"topics":[{"id":"https://openalex.org/T10339","display_name":"Advanced Numerical Methods in Computational Mathematics","score":0.996999979019165,"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.9868999719619751,"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"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9799000024795532,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/jacobian-matrix-and-determinant","display_name":"Jacobian matrix and determinant","score":0.6551207900047302},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.6335745453834534},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6143989562988281},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5309157967567444},{"id":"https://openalex.org/keywords/signed-distance-function","display_name":"Signed distance function","score":0.4779510498046875},{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.47767123579978943},{"id":"https://openalex.org/keywords/level-set","display_name":"Level set (data structures)","score":0.4512060880661011},{"id":"https://openalex.org/keywords/level-set-method","display_name":"Level set method","score":0.43808266520500183},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.42888665199279785},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.42213934659957886},{"id":"https://openalex.org/keywords/eulerian-path","display_name":"Eulerian path","score":0.4103166460990906},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.36466753482818604},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3269921541213989},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.3143135905265808},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3116023540496826},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.24569445848464966},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.23387905955314636},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16701319813728333}],"concepts":[{"id":"https://openalex.org/C200331156","wikidata":"https://www.wikidata.org/wiki/Q506041","display_name":"Jacobian matrix and determinant","level":2,"score":0.6551207900047302},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.6335745453834534},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6143989562988281},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5309157967567444},{"id":"https://openalex.org/C71169176","wikidata":"https://www.wikidata.org/wiki/Q7512907","display_name":"Signed distance function","level":2,"score":0.4779510498046875},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.47767123579978943},{"id":"https://openalex.org/C153008295","wikidata":"https://www.wikidata.org/wiki/Q6535093","display_name":"Level set (data structures)","level":2,"score":0.4512060880661011},{"id":"https://openalex.org/C125269122","wikidata":"https://www.wikidata.org/wiki/Q1751397","display_name":"Level set method","level":4,"score":0.43808266520500183},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.42888665199279785},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.42213934659957886},{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.4103166460990906},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.36466753482818604},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3269921541213989},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.3143135905265808},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3116023540496826},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.24569445848464966},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.23387905955314636},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16701319813728333},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.0},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/080727439","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080727439","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:CiteSeerX.psu:10.1.1.414.507","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.507","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ann.jussieu.fr/~frey/papers/distance/Nourgaliev R., Marker redistancing levelset method for high-fidelity implicit interface tracking.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1991113069","https://openalex.org/W1993602403","https://openalex.org/W1995216827","https://openalex.org/W1999125387","https://openalex.org/W1999342804","https://openalex.org/W2001254200","https://openalex.org/W2003091152","https://openalex.org/W2003896932","https://openalex.org/W2005812706","https://openalex.org/W2012063891","https://openalex.org/W2013043910","https://openalex.org/W2023248330","https://openalex.org/W2026253355","https://openalex.org/W2032073910","https://openalex.org/W2033374204","https://openalex.org/W2034374355","https://openalex.org/W2036247509","https://openalex.org/W2039150507","https://openalex.org/W2045545335","https://openalex.org/W2045618004","https://openalex.org/W2050514923","https://openalex.org/W2057832251","https://openalex.org/W2060003021","https://openalex.org/W2060923592","https://openalex.org/W2076804553","https://openalex.org/W2077229134","https://openalex.org/W2079578802","https://openalex.org/W2082201580","https://openalex.org/W2101560656","https://openalex.org/W2116737017","https://openalex.org/W2140153041","https://openalex.org/W2155678534","https://openalex.org/W2171303908","https://openalex.org/W2561843528","https://openalex.org/W3010292040","https://openalex.org/W4249930535","https://openalex.org/W4256220233","https://openalex.org/W4376596376"],"related_works":["https://openalex.org/W2122184585","https://openalex.org/W3121464166","https://openalex.org/W1516196146","https://openalex.org/W2367921179","https://openalex.org/W1979393293","https://openalex.org/W2377107237","https://openalex.org/W2171493617","https://openalex.org/W2354888855","https://openalex.org/W2381815228","https://openalex.org/W2102683994"],"abstract_inverted_index":{"A":[0],"hybrid":[1],"of":[2,20,25,138,161,185,216],"the":[3,8,26,40,47,68,91,99,121,139,145,156,159,162,169,186,193,210],"front":[4],"tracking":[5,36],"(FT)":[6,33],"and":[7,17,73,82,101,125,168,182],"level":[9,123],"set":[10,124],"(LS)":[11,55],"methods":[12],"is":[13,28,50,93,108,142,165],"introduced,":[14],"combining":[15],"advantages":[16],"removing":[18],"drawbacks":[19],"both":[21],"methods.":[22],"The":[23,42,134],"kinematics":[24],"interface":[27,48],"treated":[29],"in":[30,52,96,105,109,132,176,196,207],"a":[31,59,78],"Lagrangian":[32,64],"manner,":[34],"by":[35,57],"markers":[37,43,65,69],"placed":[38],"at":[39],"interface.":[41],"are":[44],"not":[45],"connected\u2014instead,":[46],"topology":[49],"resolved":[51],"an":[53,83],"Eulerian":[54],"framework,":[56],"wrapping":[58],"signed":[60],"distance":[61],"function":[62],"around":[63],"each":[66],"time":[67],"move.":[70],"For":[71],"accuracy":[72],"efficiency,":[74],"we":[75],"have":[76,88,190],"developed":[77],"high-order":[79],"\u201canchoring\u201d":[80],"algorithm":[81],"implicit":[84,135],"PDE-based":[85,113],"redistancing.":[86],"We":[87,189],"demonstrated":[89,191],"that":[90,192],"method":[92],"3rd-order":[94],"accurate":[95],"space,":[97],"near":[98],"markers,":[100],"therefore":[102],"1st-order":[103],"convergent":[104],"curvature;":[106],"this":[107],"contrast":[110,208],"to":[111,118,129,155,209],"traditional":[112],"reinitialization":[114],"algorithms,":[115],"which":[116,179,213],"tend":[117],"slightly":[119],"relocate":[120],"zero":[122],"can":[126,198],"be":[127,130,199],"shown":[128],"nonconvergent":[131],"curvature.":[133],"pseudo-time":[136,197],"discretization":[137],"redistancing":[140,212],"equation":[141],"implemented":[143],"within":[144],"Jacobian-free":[146],"Newton\u2013Krylov":[147],"(JFNK)":[148],"framework":[149],"combined":[150],"with":[151,203,218],"ILU(k)":[152],"preconditioning.":[153],"Due":[154],"LS":[157],"localization,":[158],"bandwidth":[160],"Jacobian":[163],"matrix":[164],"nearly":[166],"constant,":[167],"ILU":[170],"preconditioning":[171],"scales":[172],"as":[173],"$\\sim":[174],"N\\log(\\sqrt{N})$":[175],"two":[177],"dimensions,":[178],"implies":[180],"efficiency":[181],"good":[183],"scalability":[184],"overall":[187],"algorithm.":[188],"steady-state":[194],"solutions":[195],"achieved":[200],"very":[201],"efficiently,":[202],"$\\approx10$":[204],"iterations":[205,217],"($\\mathrm{CFL}\\approx10^4$),":[206],"explicit":[211],"requires":[214],"hundreds":[215],"$\\mathrm{CFL}\\leq1$.":[219]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}