Fully-Discrete Provably Lyapunov Consistent Discretizations for Convection-Diffusion-Reaction PDE Systems
Bibliographic record
Abstract
Abstract Convection-diffusion-reaction equations are a class of second-order partial differential equations (PDEs) widely used to model phenomena involving the change of concentration/population of one or more substances/species distributed in space. Understanding and preserving their stability properties in numerical simulations is crucial for accurate predictions, system analysis, and decision-making. This work focuses on the development of a comprehensive numerical framework for a class of convection-diffusion-reaction systems with a dissipative Lyapunov (or entropy or free energy) functional, $${\tilde{V}}$$ V ~ . This non-increasing Lyapunov functional is the driving quantity of the stability and properties of the system. We introduce a systematic methodology for constructing discretizations that mimic the stability analysis of the continuous model using Lyapunov’s direct method-type approach. The spatial algorithms are based on collocated discontinuous Galerkin (DG) methods with the summation-by-parts (SBP) property and the simultaneous approximation term (SAT) approach for imposing interface coupling and boundary conditions. Relaxation Runge-Kutta schemes are used to integrate in time and achieve fully discrete Lyapunov consistency. To verify the properties of the new schemes, we numerically solve a system of convection-diffusion-reaction PDEs governing the dynamic evolution of monomer and dimer concentrations during the dimerization process. Numerical results demonstrated the accuracy and consistency of the proposed discretizations. The new framework can enable further advancements in the analysis, control, and understanding of general convection-diffusion-reaction systems.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| 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".