Moving Mesh Methods for Singular Problems on a Sphere Using Perturbed Harmonic Mappings
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This work is concerned with developing moving mesh strategies for solving problems defined on a sphere. To construct mappings between the physical domain and the logical domain, it has been demonstrated that harmonic mapping approaches are useful for a general class of solution domains. However, it is known that the curvature of the sphere is positive, which makes the harmonic mapping on a sphere not unique. To fix the uniqueness issue, we follow Sacks and Uhlenbeck [Ann. of Math. (2), 113 (1981), pp. 1–24] to use a perturbed harmonic mapping in mesh generation. A detailed moving mesh strategy including mesh redistribution and solution updating on a sphere will be presented. The moving mesh scheme based on the perturbed harmonic mapping is then applied to the moving steep front problem and the Fokker–Planck equations with high potential intensities on a sphere. The numerical experiments show that with a moderate number of grid points our proposed moving mesh algorithm can accurately resolve detailed features of singular problems on a sphere.
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.
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.003 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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 it