Shortening the Computation Time of the Polymer Flow Model for Olefin Copolymerization Using Quasi Steady-State Approximations
Bibliographic record
Abstract
We developed two distinct quasi steady-state approximation (QSSA) solutions to speed up the computation time of the polymer flow model for ethylene/1-olefin copolymerization. One solution assumed that the radial monomer fraction profiles were constant and the other that they were variable. The two QSSA solutions were compared with dynamic solutions that assumed either uniform (approximate dynamic solution) or nonuniform radial distributions (rigorous dynamic solution) of active site concentration in the polymer particle. The adequacy of the QSSA solutions was evaluated at different ethylene and 1-olefin Thiele moduli using particle growth factors, ethylene and 1-olefin mass transfer efficiencies, polymer molecular weight distributions and averages, and short chain branch distributions. After a short period of time, both QSSA solutions matched the approximate dynamic solution well, but they agreed with the rigorous dynamic solution only when the Thiele modulus for ethylene was not too high. The Thiele modulus for 1-olefin had a lesser effect on the model predictions. As the Thiele modulus increased, both QSSA solutions deviated more from the rigorous dynamic solution, but this does not limit the use of these solutions under relevant industrial conditions because severe mass transfer resistances are undesirable in commercial reactors. Finally, the QSSA solutions were integrated with a Monte Carlo model to simulate distributions of polymer particles with different sizes and reactor residence times. These simulations confirmed that the proposed QSSA solutions are more adequate to simulate large polymer particle populations than traditional methods used to solve single-particle models.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".