High-precision potential-field and gradient-component transformations and derivative computations using cubic B-splines
Bibliographic record
Abstract
Abstract Potential-field and gradient-component transformations and derivative computations are necessary for many techniques of data enhancement, direct interpretation, and inversion. We advance new unified formulas for fast interpolation, differentiation, and integration and propose flexible high-precision algorithms to perform 3D and 2D potential-field- and gradient component transformations and derivative computations in the space domain using cubic B-splines. The spline-based algorithms are applicable to uniform or nonuniform rectangular grids for the 3D case and to regular or irregular grids for the 2D case. The fast Fourier transform (FFT) techniques require uniform grid spacing. The spline-based horizontal-derivative computations can be done at any point in the computational domain, whereas the FFT methods use only grid points. Comparisons between spline and FFT techniques through two gravity-gradient examples and one magnetic example show that results computed with the spline technique agree better with the exact theoretical data than do results computed with the FFT technique.
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.000 | 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".