Pressure and Acceleration Determination Methods Using PIV Velocity Data
Bibliographic record
Abstract
Simultaneous knowledge of the entire pressure, acceleration and velocity fields in a region of a flow is a major factor in understanding and modeling a case under study, especially for fluid dynamic and engineering applications. At present, the accuracy of the velocity map coming from particle image velocimetry (PIV) using higher order cross-correlation algorithms with advanced post processing including filters, removing and replacing the odd data, and smoothing functions is in an acceptable range. Using PIV velocity data to determine the acceleration and pressure distribution causes a kind of error accumulation; thus, the inaccuracy of the acceleration and pressure data is several times greater than that of the velocity data; therefore, the need for accurate algorithms cannot be ignored. In this paper, a synthetic image generation code is used to create benchmark images for an unsteady forced vortex flow with known velocity, acceleration and pressure data. These known data are necessary to investigate the accuracy of the results. Different acceleration methods including pseudo-tracing, regression and central finite difference are introduced and compared. In addition, the influence of some involved parameters, the time interval between the velocity fields (Δt), cell size and overlapping is studied synthetically. The results show that the methods strongly depend on the time interval Δt, and increasing it improves the accuracy until a critical Δt is reached. In steady flows, the methods are time independent, but for the tracing method, a time step is introduced. The tracing method among all methods represents the most accurate acceleration results for both steady and unsteady flows. Navier-Stokes equations are used as the pressure-estimation method since they show more details of the flow field. Pressure gradients are integrated by using a numerical integration method that shows high accuracy for images with no bluff body inside them.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 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.003 | 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".