Godunov-Type Solutions for Transient Pipe Flow Implicitly Incorporating Brunone Unsteady Friction
Bibliographic record
Abstract
An approach combining the Brunone unsteady friction model and first- and second-order Godunov-type scheme (GTS) is developed to simulate transient pipe flow. The exact solution to the Riemann problem calculates the mass and momentum fluxes while implicitly considering the Brunone unsteady friction factor. The boundary cells can either be computed by applying the Rankine–Hugoniot condition or through virtual boundary cells adapted to achieve a uniform solution for both interior and boundary cells. Predictions of the proposed model are compared both with experimental data and with method of characteristics (MOC) predictions. Results show the first-order GTS and MOC scheme have identical accuracy, but both approaches sometimes produce severe attenuation when used with small Courant numbers. The presented second-order GTS numerical model is more accurate, stable, and efficient, even for Courant numbers less than one, a particularly important attribute for unsteady-friction simulations, which inevitably create numerical dissipation in both the MOC and proposed first-order Godunov-type schemes. In fact, even with a coarse discretization, the new second-order GTS Brunone model accurately reproduces the entire experimental pressure oscillations including their physical damping in all transient flows considered here.
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.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| 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".