A High-Order Central ENO Finite-Volume Scheme for Three-Dimensional Turbulent Reactive Flows on Unstructured Mesh
Bibliographic record
Abstract
High-order discretization techniques offer the potential to significantly reduce the computational costs necessary to obtain accurate predictions when compared to lower-order methods. However, efficient, universallyapplicable, high-order discretizations remain somewhat illusive, especially for more arbitrary unstructured meshes and for large-eddy simulation (LES) of turbulent reacting flows. A novel, high-order, central essentially non-oscillatory (CENO), cell-centered, finite-volume scheme is proposed for the solution of the conservation equations of turbulent, reactive, low speed flows on three-dimensional unstructured meshes. The proposed scheme is applied to the pseudo-compressibility formulation of the Favre-filtered governing equations and the resulting discretized equations are solved with a parallel implicit Newton-Krylov algorithm. Temporal derivatives are discretized using the family of high-order backward difference formulas (BDF) and the resulting equations are solved via a dual-time stepping approach. Large-eddy simulations of a laboratory-scale turbulent flame is carried out and the proposed finite-volume scheme is validated against experimental measurements. The high-order scheme is demonstrated to provide both reliable and accurate solutions for complex turbulent reactive flows.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| 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".