The method of moments used in polymerization reaction engineering for 70 years: An overview, tutorial, and minilibrary
Bibliographic record
Abstract
Abstract In the last seven decades, the method of moments (MoM) has become an invaluable tool in the field of polymerization reaction engineering, due to the simplicity of translating a complex set of population balance equations (PBE) into a system with a limited number of equations. In this work, we offer an overview of the MoM, describing the derivation of the moment equations in a basic kinetic mechanism. Some tools and strategies for the derivation of the moment equations are reviewed and explained in detail, such as the binomial theorem, the method of series expansion and pattern identification (SEPI), extensively used by the community, and a graphical approach of summation inversion. The treatment for multivariate distributions is also exposed, taking advantage of the complete and partial moment techniques. The derivation of the MoM contribution by kinetic mechanisms beyond the basic ones or involving special difficulties, such as depropagation, long chain branching (LCB), random chain scission, LCB and β‐scission, short chain branching (SCB) and scission, internal double bond (IDB) (polymerization), termination by combination, reversible deactivation radical polymerization (RDRP), and intermolecular transesterification reactions (ITRs), are explained in a tutorial way. Additionally, the fundamentals of the MoM in copolymerization and the application of the pseudo‐homopolymerization approach are briefly described. An introduction of the MoM to emulsion polymerization is also presented. Finally, some advanced applications of MoM in recent works are exposed: MoM models with chain‐length dependent or diffusion‐controlled termination, and the extension of the MoM for the prediction of the molecular weight distribution (MWD).
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.002 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.003 | 0.004 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.007 | 0.006 |
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".