Parallel Adaptive Mesh Refinement Scheme for Three-Dimensional Turbulent Non-Premixed Combustion
Bibliographic record
Abstract
A parallel adaptive mesh refinement (AMR) algorithm is described for predicting tur-bulent non-premixed gaseous combusting flows in three space dimensions. The Favre-averaged Navier-Stokes equations governing a reactive mixture of thermally perfect gases, the two transport equations of the k-ω turbulence model, and the time-averaged species transport equations, are all solved using a fully coupled finite-volume formulation on body-fitted multi-block hexahedral mesh. The numerical algorithm adopts a cell-centred upwind finite-volume discretization procedure and uses limited solution reconstruction, approxi-mate Riemann solver based flux functions to determine the inviscid (hyperbolic) flux at cell interfaces. The viscous (elliptic) components of the cell face flux are evaluated by em-ploying a hybrid average gradient-diamond path approach. For the treatment of near-wall turbulence, both low-Reynolds-number and wall-function formulations of the k-ω model are used, with a procedure for automatically switching from one to the other, depend-ing on mesh resolution. A flexible block-based hierarchical octree data structure is used to maintain the connectivity of the solution blocks in the multi-block mesh and facilitate automatic solution-directed mesh adaptation according to physics-based refinement cri-teria. This AMR approach allows for anisotropic mesh refinement and the block-based data structure readily permits efficient and scalable implementations of the algorithm on multi-processor architectures. Numerical results for turbulent non-premixed methane-air diffusion flames are described to demonstrate the validity and potential of the parallel AMR approach for predicting complex combusting flows. I.
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.001 |
| 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.002 | 0.001 |
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".