THE UNIFED-FFT GRID TOTALIZING ALGORITHM FOR FAST O(N LOG N) METHOD OF MOMENTS ELECTROMAGNETIC ANALYSIS WITH ACCURACY TO MACHINE PRECISION (Invited Paper)
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
While considerable progress has been made in the realm of speed-enhanced electromagnetic (EM) solvers, these fast solvers generally achieve their results through methods that introduce additional error components by way of geometric type approximations, sparse-matrix type approximations, multilevel type decomposition of interactions, and assumptions regarding the stochastic nature of EM problems. This work introduces the O(N log N ) Unified-FFT grid totalizing (UFFT-GT) method, a derivative of method of moments (MoM), which achieves fast analysis with minimal to zero reduction in accuracy relative to direct MoM solution. The method uniquely combines FFT-enhanced Matrix Fill Operations (MFO) that are calculated to machine precision with FFT-enhanced Matrix Solve Operations (MSO) that are also calculated to machine precision, for an expedient solution that does not compromise accuracy.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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 it