Papers › Flow reconstruction by multiresolution optimization of a discrete loss with automatic...

Flow reconstruction by multiresolution optimization of a discrete loss with automatic differentiation

8 Mar 2023arXiv:2303.04679links table onlyarchive 2025-07-28

Petr Karnakov, Sergey Litvinov, Petros Koumoutsakos

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We present a potent computational method for the solution of inverse problems in fluid mechanics. We consider inverse problems formulated in terms of a deterministic loss function that can accommodate data and regularization terms. We introduce a multigrid decomposition technique that accelerates the convergence of gradient-based methods for optimization problems with parameters on a grid. We incorporate this multigrid technique to the ODIL (Optimizing a DIscrete Loss) framework. The multiresolution ODIL (mODIL) accelerates by an order of magnitude the original formalism and improves the avoidance of local minima. Moreover, mODIL accommodates the use of automatic differentiation for calculating the gradients of the loss function, thus facilitating the implementation of the framework. We demonstrate the capabilities of mODIL on a variety of inverse and flow reconstruction problems: solution reconstruction for the Burgers equation, inferring conductivity from temperature measurements, and inferring the body shape from wake velocity measurements in three dimensions. We also provide a comparative study with the related, popular Physics-Informed Neural Networks (PINNs) method. We demonstrate that mODIL has three to five orders of magnitude lower computational cost than PINNs in benchmark problems including simple PDEs and lid-driven cavity problems. Our results suggest that mODIL is a very potent, fast and consistent method for solving inverse problems in fluid mechanics.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2303.04679")

Code

Syntology Ran 0 of 16 code samples harvested from 1 repository linked to this paper; 16 have no recorded run.

By repository: official repository: 16 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

cselab/odil officialmentioned in papermentioned on GitHubjaxMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

16 samples harvested; 0 ran; 0 honoured the contract we drafted; 16 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

16unverified

Licence: 0 of the 16 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from cselab/odil. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

cache_to_file cselab/odil/src/odil/cache.py official repository unverified MIT (permissive) · 4273b21d2936b32b · report
get_cmap cselab/odil/src/odil/plot.py official repository unverified MIT (permissive) · a8278e57206d1bfa · report
get_colormap_data cselab/odil/src/odil/plot.py official repository unverified MIT (permissive) · 21d1a888b6d64ab7 · report
get_error cselab/odil/src/odil/util.py official repository unverified MIT (permissive) · 9c50d0e45ae4e4e4 · report
interp_to_finer cselab/odil/src/odil/core.py official repository unverified MIT (permissive) · 59e3a2251adc7b83 · report
make_neural_net cselab/odil/src/odil/core.py official repository unverified MIT (permissive) · 6bdfc895e1593b47 · report
make_optimizer cselab/odil/src/odil/optimizer.py official repository unverified MIT (permissive) · e1e44850adde7fe3 · report
optimize_grad cselab/odil/src/odil/util.py official repository unverified MIT (permissive) · e88c87222c6454f6 · report
optimize_newton cselab/odil/src/odil/util.py official repository unverified MIT (permissive) · 9e6f094c159099b8 · report
parse_raw_xmf cselab/odil/src/odil/io.py official repository unverified MIT (permissive) · 8c8dbcafe7fc36fc · report
plot_1d cselab/odil/src/odil/plot.py official repository unverified MIT (permissive) · f368b17e2b766e97 · report
read_raw cselab/odil/src/odil/io.py official repository unverified MIT (permissive) · 6cfbfd3990e106d9 · report
read_raw_with_xmf cselab/odil/src/odil/io.py official repository unverified MIT (permissive) · c9b49d097355788c · report
restrict_to_coarser cselab/odil/src/odil/core.py official repository unverified MIT (permissive) · f51ce2d92462204c · report
savefig cselab/odil/src/odil/plotutil.py official repository unverified MIT (permissive) · 853fdbdeaddf52b4 · report
solve cselab/odil/src/odil/linsolver.py official repository unverified MIT (permissive) · 98b02d0c221514de · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections