Particle subgrid scale modeling in large-eddy simulation of particle-laden turbulence
Bibliographic record
Abstract
This thesis is concerned with particle subgrid scale (SGS) modeling in large-eddy simulation (LES) of particle-laden turbulence. Although most particle-laden LES studies have neglected the effect of the subgrid scales on the particles, several particle SGS models have been proposed in the literature. In this research, the approximate deconvolution method (ADM), and the stochastic models of Fukagata et al. (2004), Shotorban and Mashayek (2006) and Berrouk et al. (2007) are analyzed. The particle SGS models are assessed by conducting both a priori and a posteriori tests of a periodic box of decaying, homogeneous and isotropic turbulence with an initial Reynolds number of Re=74. The model results are compared with particle statistics from a direct numerical simulation (DNS). Particles with a large range of Stokes numbers are tested using various filter sizes and stochastic model constant values. Simulations with and without gravity are performed to evaluate the ability of the models to account for the crossing trajectory and continuity effects. The results show that ADM improves results but is only capable of recovering a portion of the SGS turbulent kinetic energy. Conversely, the stochastic models are able to recover sufficient energy, but show a large range of results dependent on Stokes number and filter size. The stochastic models generally perform best at small Stokes numbers. Due to the random component, the stochastic models are unable to predict preferential concentration.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| 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".