A compatible embedded-hybridized discontinuous Galerkin method for the Stokes--Darcy-transport problem
Bibliographic record
Abstract
We present a stability and error analysis of an embedded-hybridized discontinuous Galerkin (EDG-HDG) finite element method for coupled Stokes--Darcy flow and transport. The flow problem, governed by the Stokes--Darcy equations, is discretized by a recently introduced exactly mass conserving EDG-HDG method while an embedded discontinuous Galerkin (EDG) method is used to discretize the transport equation. We show that the coupled flow and transport discretization is compatible and stable. Furthermore, we show existence and uniqueness of the semi-discrete transport problem and develop optimal a priori error estimates. We provide numerical examples illustrating the theoretical results. In particular, we compare the compatible EDG-HDG discretization to a discretization of the coupled Stokes--Darcy and transport problem that is not compatible. We demonstrate that where the incompatible discretization may result in spurious oscillations in the solution to the transport problem, the compatible discretization is free of oscillations. An additional numerical example with realistic parameters is also presented.
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.000 | 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.001 | 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".