Parallel three‐dimensional simulation of the injection molding process
Bibliographic record
Abstract
Abstract This paper describes the development of a parallel three‐dimensional unstructured non‐isothermal flow solver for the simulation of the injection molding process. The numerical model accounts for multiphase flow in which the melt and air regions are considered to be a continuous incompressible fluid with distinct physical properties. This aspect avoids the complex reconstruction of the interface. A collocated finite volume method is employed, which can switch between first‐ and second‐order accuracy in both space and time. The pressure implicit with splitting of operators algorithm is used to compute the transient flow variables and couple velocity and pressure. The temperature equation is solved using a transport equation with convection and diffusion terms. An upwind differencing scheme is used for the discretization of the convection term to enforce a bounded solution. In order to capture the sharp interface, a bounded compressive high‐resolution scheme is employed. Parallelization of the code is achieved using the PETSc framework and a single program multiple data message passing model. Predicted numerical solutions for several example problems are considered. The first case validates the solution algorithm for moderate Reynolds number flows using a structured mesh. The second case employs an unstructured hybrid mesh showing the capability of the solver to describe highly viscous flows closer to realistic injection molding conditions. The final case presents the non‐isothermal filling of a thick cavity using three mesh sizes and up to 80 processors to assess parallel performance. The proposed algorithm is shown to have good accuracy and scalability. Copyright © 2008 John Wiley & Sons, Ltd.
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.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".