A General Filter for Stretched-Grid Models: Application in Two-Dimension Polar Geometry
Bibliographic record
Abstract
Abstract Variable-resolution grids are used in global atmospheric models to improve the representation of regional scales over an area of interest: they have reduced computational cost compared to uniform high-resolution grids, and avoid the nesting issues of limited-area models. To address some concerns associated with the stretching and anisotropy of the variable-resolution computational grid, a general convolution filter operator was developed. The convolution filter that was initially applied in Cartesian geometry in a companion paper is here adapted to cylindrical polar coordinates as an intermediate step toward spherical polar latitude–longitude grids. Both polar grids face the so-called “pole problem” because of the convergence of meridians at the poles. In this work the authors will present some details related to the adaptation of the filter to cylindrical polar coordinates for both uniform as well as stretched grids. The results show that the developed operator is skillful in removing the extraneous fine scales around the pole, with a computational cost smaller than that of common polar filters. The results on a stretched grid for vector and scalar test functions are satisfactory and the filter’s response can be optimized for different types of test function and noise one wishes to remove.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 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".