{"id":"https://openalex.org/W7116088458","doi":"https://doi.org/10.48550/arxiv.2512.14877","title":"Extending the explicit constraint force method to inverse problems","display_name":"Extending the explicit constraint force method to inverse problems","publication_year":2025,"publication_date":"2025-12-16","ids":{"openalex":"https://openalex.org/W7116088458","doi":"https://doi.org/10.48550/arxiv.2512.14877"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2512.14877","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.14877","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2512.14877","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Rowan, Conor","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Rowan, Conor","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11205","display_name":"Numerical methods in inverse problems","score":0.21960000693798065,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/T11205","display_name":"Numerical methods in inverse problems","score":0.21960000693798065,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.18330000340938568,"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"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.04490000009536743,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/inverse-problem","display_name":"Inverse problem","score":0.6845999956130981},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.604200005531311},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5266000032424927},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4758000075817108},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4327999949455261},{"id":"https://openalex.org/keywords/polynomial-chaos","display_name":"Polynomial chaos","score":0.42480000853538513},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.41200000047683716},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.39570000767707825}],"concepts":[{"id":"https://openalex.org/C135252773","wikidata":"https://www.wikidata.org/wiki/Q1567213","display_name":"Inverse problem","level":2,"score":0.6845999956130981},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.604200005531311},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5523999929428101},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5266000032424927},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4961000084877014},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4758000075817108},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.44760000705718994},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4327999949455261},{"id":"https://openalex.org/C197656079","wikidata":"https://www.wikidata.org/wiki/Q17147719","display_name":"Polynomial chaos","level":3,"score":0.42480000853538513},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.41200000047683716},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.39570000767707825},{"id":"https://openalex.org/C9357733","wikidata":"https://www.wikidata.org/wiki/Q6878417","display_name":"Missing data","level":2,"score":0.39500001072883606},{"id":"https://openalex.org/C76134657","wikidata":"https://www.wikidata.org/wiki/Q370634","display_name":"Generalized inverse","level":3,"score":0.37220001220703125},{"id":"https://openalex.org/C182310444","wikidata":"https://www.wikidata.org/wiki/Q1332643","display_name":"Boundary value problem","level":2,"score":0.34869998693466187},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.3361999988555908},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32359999418258667},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.32109999656677246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3188999891281128},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.2651999890804291},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.2540000081062317},{"id":"https://openalex.org/C21556879","wikidata":"https://www.wikidata.org/wiki/Q43219517","display_name":"Moore\u2013Penrose pseudoinverse","level":3,"score":0.2524999976158142}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2512.14877","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.14877","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2512.14877","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.14877","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Recently,":[0],"the":[1,17,41,50,55,58,61,64,73,84,88,111,133,147,187,197,208],"explicit":[2],"constraint":[3,144],"force":[4],"method":[5,126],"(ECFM)":[6],"was":[7],"introduced":[8],"as":[9,36,211],"a":[10,27,37,92,114,125],"principled":[11],"approach":[12,94,116,140],"to":[13,39,77,91,107,117,127,164,178,195,202,206],"solution":[14,23,43,56],"reconstruction":[15],"in":[16,186],"presence":[18],"of":[19,26,63,67,75,87,105,162,182,191,200],"missing":[20,51,166],"physics.":[21],"In":[22,45],"reconstruction,":[24],"parameters":[25,52],"physical":[28],"model":[29,135],"are":[30,176],"estimated":[31],"from":[32,172],"sparse":[33],"measurement":[34,120,173],"data":[35],"means":[38],"obtain":[40],"full":[42],"field.":[44],"contrast,":[46],"inverse":[47,79,89,129,216],"problems":[48,130,183],"target":[49],"and":[53,110,146,151,169,205],"estimate":[54],"along":[57],"way.":[59],"Noting":[60],"similarity":[62],"mathematical":[65,198],"formulations":[66],"these":[68],"two":[69,96],"tasks,":[70],"we":[71,82,123,159],"investigate":[72],"use":[74],"ECFM":[76,85,106,163,201],"solve":[78,128],"problems.":[80],"First,":[81],"compare":[83],"formulation":[86],"problem":[90],"standard":[93],"using":[95],"numerical":[97,156],"examples.":[98],"The":[99,189],"first":[100],"example":[101],"provides":[102],"an":[103,212],"extension":[104],"dynamic":[108],"problems,":[109],"second":[112],"offers":[113],"novel":[115,203],"treat":[118],"noisy":[119],"data.":[121],"Next,":[122],"introduce":[124],"for":[131,215],"which":[132,175],"parameterized":[134],"has":[136],"stochastic":[137],"components.":[138],"This":[139],"is":[141,152,194],"based":[142],"on":[143],"forces":[145],"polynomial":[148],"chaos":[149],"expansion,":[150],"illustrated":[153],"with":[154],"another":[155],"example.":[157],"Finally,":[158],"discuss":[160],"extensions":[161],"recover":[165],"boundary":[167],"conditions":[168],"domain":[170],"geometries":[171],"data,":[174],"shown":[177],"be":[179],"special":[180],"cases":[181],"treated":[184],"previously":[185],"literature.":[188],"purpose":[190],"this":[192],"work":[193],"extend":[196],"framework":[199],"applications":[204],"gauge":[207],"method's":[209],"viability":[210],"alternative":[213],"strategy":[214],"analysis.":[217]},"counts_by_year":[],"updated_date":"2025-12-19T19:45:34.690201","created_date":"2025-12-19T00:00:00"}