Bibliographic record
Abstract
Abstract Numerical solution of many non-isothermal flow problems requires robust isenthalpic flash. However, isenthalpic flash is challenging when the total enthalpy is sensitive to temperature, which is referred to as narrow-boiling behavior. This paper presents a robust algorithm for three-phase isenthalpic flash for water-containing hydrocarbon mixtures. The algorithm is an extension of the direct substitution (DS) presented in the literature and our previous research for two phases. A detailed analysis is given for the narrow-boiling behavior and its effects on the DS algorithm. A new method is also presented for K-value estimates for three phases for water-containing hydrocarbon mixtures. The thermodynamic model used is the Peng-Robinson equation of state with the van der Waals mixing rules. The narrow-boiling behavior occurs when the Gibbs free energy varies in temperature-composition space in such a way that a small temperature change yields significant changes of equilibrium phase compositions relative to the overall composition. The system of equations used in the DS algorithm becomes nearly degenerate for narrow-boiling fluids. The three-phase DS algorithm in this paper adaptively switches between Newton's iteration step and the bisection step depending on the Jacobian condition number. The bisection algorithm solves for temperature based solely on the enthalpy constraint only when narrow-boiling behavior is identified. The DS algorithm is tested with a number of different isenthalpic flash calculations. Results show the robustness of the DS algorithm for narrow-boiling fluids.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| 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.004 | 0.001 |
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".