Fast and efficient simulation of 3D creeping flow in ducts using a space‐marching algorithm
Bibliographic record
Abstract
Abstract In this paper, an alternative solution algorithm for the creeping, 3D viscoelastic flow simulation is offered. It is based on the Parabolized Navier‐Stokes Equations formulation (PNSE), which reduces the 3D problem to a sequence of 2D problems marched along a preferred direction (the dominant flow in the duct). This algorithm is extended to the limit Re approaching 0 (creeping flow) and the viscoelastic component of the extra‐stress tensor that appears in the momentum equation is treated as a body force. The numerical results obtained with Criminale‐Ericksen‐Filbey (CEF) and Modified Phan‐Thien Tanner (MPTT) models are compared against previous numerical and experimental data. As an application of the code, prediction of viscoelastic developing flow in channels is studied, since it is a common feature in many polymer processing applications, such as extrusion coating, film blowing, injection molding, and others in which there are confined flow in ducts after metering in extruder screw. The present algorithm offers a fast and efficient solution approach to the complex problem of 3D viscoelastic flow, allowing the detailed visualization of flow phenomena that would otherwise require significant computational resources. POLYM. ENG. SCI. 45:249–259, 2005. © 2005 Society of Plastics Engineers.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".