{"id":"https://openalex.org/W2006700733","doi":"https://doi.org/10.1137/080727890","title":"Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation","display_name":"Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2006700733","doi":"https://doi.org/10.1137/080727890","mag":"2006700733"},"language":"en","primary_location":{"id":"doi:10.1137/080727890","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080727890","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/A5101519068","display_name":"Qiqi Wang","orcid":"https://orcid.org/0000-0001-9669-2563"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qiqi Wang","raw_affiliation_strings":["qiqi@stanford.edu and moin@stanford.edu and jops@stanford.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"qiqi@stanford.edu and moin@stanford.edu and jops@stanford.edu#TAB#","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003773421","display_name":"Parviz Moin","orcid":"https://orcid.org/0000-0002-0491-7065"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Parviz Moin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5047377841","display_name":"Gianluca Iaccarino","orcid":"https://orcid.org/0000-0003-3659-7745"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gianluca Iaccarino","raw_affiliation_strings":["Center for Turbulence Research, Stanford University, Stanford, CA 94305"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Turbulence Research, Stanford University, Stanford, CA 94305","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.2077,"has_fulltext":false,"cited_by_count":137,"citation_normalized_percentile":{"value":0.95704794,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"31","issue":"4","first_page":"2549","last_page":"2567"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9980000257492065,"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.9980000257492065,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9969000220298767,"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.9957000017166138,"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/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.6812763214111328},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6791259050369263},{"id":"https://openalex.org/keywords/adjoint-equation","display_name":"Adjoint equation","score":0.5293358564376831},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5174673199653625},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4540175199508667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43672293424606323},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38985636830329895},{"id":"https://openalex.org/keywords/partial-differential-equation","display_name":"Partial differential equation","score":0.3678302764892578}],"concepts":[{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.6812763214111328},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6791259050369263},{"id":"https://openalex.org/C165551260","wikidata":"https://www.wikidata.org/wiki/Q4428962","display_name":"Adjoint equation","level":3,"score":0.5293358564376831},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5174673199653625},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4540175199508667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43672293424606323},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38985636830329895},{"id":"https://openalex.org/C93779851","wikidata":"https://www.wikidata.org/wiki/Q271977","display_name":"Partial differential equation","level":2,"score":0.3678302764892578},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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":1,"locations":[{"id":"doi:10.1137/080727890","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080727890","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":[{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1507478338","https://openalex.org/W1574577663","https://openalex.org/W1585773866","https://openalex.org/W1967134278","https://openalex.org/W1970661577","https://openalex.org/W1971868893","https://openalex.org/W1974961323","https://openalex.org/W2017479642","https://openalex.org/W2020527870","https://openalex.org/W2027619967","https://openalex.org/W2079257099","https://openalex.org/W2165187821"],"related_works":["https://openalex.org/W3048332761","https://openalex.org/W2985995409","https://openalex.org/W2804047031","https://openalex.org/W2125545644","https://openalex.org/W4388311650","https://openalex.org/W1974056099","https://openalex.org/W4245343541","https://openalex.org/W2386077341","https://openalex.org/W563589758","https://openalex.org/W1972932559"],"abstract_inverted_index":{"Adjoint":[0],"equations":[1,4,22],"of":[2,35,75,78,99,112,125,145,170],"differential":[3],"have":[5,60,138],"seen":[6],"widespread":[7],"applications":[8,49],"in":[9,19,39,154,164],"optimization,":[10],"inverse":[11],"problems,":[12],"and":[13,43,152],"uncertainty":[14],"quantification.":[15],"A":[16],"major":[17],"challenge":[18],"solving":[20,155],"adjoint":[21,41,156],"for":[23,121],"time":[24,79,87,100,118,126,136],"dependent":[25],"systems":[26],"has":[27,161],"been":[28,62],"the":[29,33,36,40,44,52,76,97,115,135,139,168],"need":[30],"to":[31],"use":[32],"solution":[34,54],"original":[37],"system":[38],"calculation":[42],"associated":[45],"memory":[46],"requirement.":[47],"In":[48],"where":[50],"storing":[51],"entire":[53],"history":[55],"is":[56,102,148,172],"impractical,":[57],"checkpointing":[58,66,93],"methods":[59,83],"frequently":[61],"used.":[63],"However,":[64],"traditional":[65],"algorithms":[67],"such":[68],"as":[69,117],"revolve":[70],"require":[71],"a":[72,91,103,109],"priori":[73,104],"knowledge":[74],"number":[77,98,111,124],"steps,":[80],"making":[81],"these":[82],"incompatible":[84],"with":[85],"adaptive":[86],"stepping.":[88],"We":[89],"propose":[90],"dynamic":[92],"algorithm":[94,107,147,159],"applicable":[95],"when":[96,167],"steps":[101],"unknown.":[105],"Our":[106],"maintains":[108],"specified":[110],"checkpoints":[113,130],"on":[114],"fly":[116],"integration":[119,137],"proceeds":[120],"an":[122],"arbitrary":[123],"steps.":[127],"The":[128,143],"resulting":[129],"at":[131],"any":[132],"snapshot":[133],"during":[134],"optimal":[140],"repetition":[141],"number.":[142],"efficiency":[144],"our":[146],"demonstrated":[149],"both":[150],"analytically":[151],"experimentally":[153],"equations.":[157],"This":[158],"also":[160],"significant":[162],"advantage":[163],"automatic":[165],"differentiation":[166],"length":[169],"execution":[171],"variable.":[173]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":10}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}