Computational Fluid-Dynamics Modeling of the Flow and Sediment Transport in Stormwater Retention Ponds: A Review
Bibliographic record
Abstract
This paper reviews the application of computational fluid dynamics (CFD) to numerically model the two-phase flow of water and sediment in the complex environment of a stormwater retention pond. The review is intended to draw the attention of the hydraulic engineering community, specifically those involved in pond design, to the recent advancements in computational modeling of sediment transport in ponds. It provides an up-to-date survey of current simulation capability, focusing on the potential of fully three-dimensional methods for solving sediment transport in complex pond flows. An additional goal of this paper is to alert new researchers engaged in stormwater retention pond design to the research opportunities presented by CFD. Even though pond configurations have become more complex to improve their performance, many studies have continued to rely solely on single-phase models. At the present time, unsteady three-dimensional two-phase models are becoming available to study these problems. Of the multiphase models that might be considered, the particle tracking (Eulerian-Lagrangian) method and two-fluid (Eulerian-Eulerian) method both are potentially applicable to modeling sediment transport in pond-type flows. To date, only the particle-tracking method has been applied to stormwater retention ponds. The two-fluid method is capable of simulating sediment transport in retention ponds. It would be advantageous for a simulation of large-scale ponds in which the number of particles required for particle-tracking becomes excessive. Currently, fully three-dimensional CFD methods are being successfully used to model a variety of multiphase flows in mechanical and chemical engineering, as well as some specific applications in hydraulic engineering. Its application to predict sediment transport in a retention pond shows significant promise, especially when the effect of turbulence becomes challenging to model.
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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.002 |
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".