Nodal configurations and voronoi tessellations for triangular spectral elements
Bibliographic record
Abstract
By combining the high-order accuracy of spectral expansions with the locality and geometric flexibility of finite elements, spectral elements are an attractive option for the next generation of numerical climate models. Crucial to their construction is the configuration of nodes in an element — casual placement leads to polynomial fits exhibiting Runge phenomena manifested by wild spatial oscillations. I provide highorder triangular elements suitable for incorporation into existing spectral element codes. Constructed from a variety of measures of optimality, these nodes possess the best interpolation error norms discovered to date. Motivated by the need to accurately determine these error norms, I present an optimization method suitable for finding extrema in a triangle. It marries a branch and bound algorithm to a quadtree smoothing scheme. The resulting scheme is both robust and efficient, promising general applicability. In order to qualitatively evaluate these nodal distributions, I introduce the concept of a Lagrangian Voronoi tessellation. This partitioning of the triangle illustrates the regions over which each node dominates. I argue that distant and disconnected regions are undesirable as they exhibit a non-physical influence. Finally, I have discovered a link between point distributions in the simplex and on the hypersphere. Through a simple transformation, a distance metric is defined permitting the construction of Voronoi diagrams and the calculation of mesh norms.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 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.000 | 0.000 |
| 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".