Optimal Closures in a Simple Model for Turbulent Flows
Bibliographic record
Abstract
In this work we introduce a computational framework for determining optimal closures of the eddy-viscosity type for large-eddy simulations (LESs) of a broad class of PDE models, such as the Navier--Stokes equation. This problem is cast in terms of PDE-constrained optimization where an error functional representing the misfit between the target and predicted observations is minimized with respect to the functional form of the eddy viscosity in the closure relation. Since this leads to a PDE optimization problem with a nonstandard structure, the solution is obtained computationally with a flexible and efficient gradient approach relying on a combination of modified adjoint-based analysis and Sobolev gradients. By formulating this problem in the continuous setting we are able to determine the optimal closure relations in a very general form subject only to some minimal assumptions. The proposed framework is thoroughly tested on a model problem involving the LES of the one-dimensional Kuramoto--Sivashinsky equation, where optimal forms of the eddy viscosity are obtained as generalizations of the standard Smagorinsky model. It is demonstrated that while the solution trajectories corresponding to the direct numerical simulation and LES still diverge exponentially, with such optimal eddy viscosities the rate of divergence is significantly reduced as compared to the Smagorinsky model. By systematically finding optimal forms of the eddy viscosity within a certain general class of closure models, this framework can thus provide insights about the fundamental performance limitations of these models.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".