Parabolic Systems in Catalytic Reactor Modeling
Bibliographic record
Abstract
Several numerical properties associated to the modeling of chemical reactors as sets of parabolic problems with nonlinear boundary conditions of Robin type are studied. The main issue in the modelisation and solution procedure is the nonlinearity and presence of boundary singularities that are essential to these systems and their relationship with the error estimations for adaptivity. The focus of this work is, in consequence, to assess different types of error estimators associated to linearization based in a Picard-like scheme. A system of parabolic (non-stationary) reaction-advection-diffusion equations with boundary conditions of numerically demanding singular nonlinear Robin type is posed and algorithms for their numerical solution are proposed. The models are stated and solved in the adaptive finite element software environment ALBERTA. The numerical examples are associated to problems drawn from Chemical Engineering (Simplified Catalytic Reactors) with the aim of providing approximate solutions and sound `a posteriori' error estimates oriented to the adaptation of meshes and timesteps. The schematic and simplified modeling and simulation of the reactor is a critical issue in this article, due to the characteristics of the original problem. In this sense the justification of the simplifications that are necessary in order to obtain reasonable numerical approximations is treated.
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.001 |
| Bibliometrics | 0.001 | 0.001 |
| 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.002 | 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".