A Compressible Nonhydrostatic Cell-Integrated Semi-Lagrangian Semi-Implicit Solver (CSLAM-NH) with Consistent and Conservative Transport
Bibliographic record
Abstract
Abstract A cell-integrated semi-Lagrangian (CISL) semi-implicit nonhydrostatic solver for the fully compressible moist Euler equations in two-dimensional Cartesian (x–z) geometry is presented. The semi-implicit CISL solver uses the inherently conservative semi-Lagrangian multitracer transport scheme (CSLAM) and a new flux-form semi-implicit formulation of the continuity equation that ensures numerically consistent transport. The flux-form semi-implicit formulation is based on a recent successful approach in a shallow-water equations (SWE) solver (CSLAM-SW). With the new approach, the CISL semi-implicit nonhydrostatic solver (CSLAM-NH) is able to ensure conservative and consistent transport by avoiding the need for a time-independent mean reference state. Like its SWE counterpart, the nonhydrostatic solver presented here is designed to be similar to typical semi-Lagrangian semi-implicit schemes, such that only a single linear Helmholtz equation solution and a single call to CSLAM are required per time step. To demonstrate its stability and accuracy, the solver is applied to a set of three idealized test cases: a density current (dry), a gravity wave (dry), and a squall line (moist). A fourth test case shows that shape preservation of passive tracers is ensured by coupling the semi-implicit CISL formulation with existing shape-preserving filters. Results show that CSLAM-NH solutions compare well with other existing solvers for the three test cases, and that it is shape preserving.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".