AIMx: An Extended Adaptive Integral Method for the Fast Electromagnetic Modeling of Complex Structures
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
Surface integral equation (SIE) methods are of great interest for the efficient electromagnetic modeling of various devices, from integrated circuits to antenna arrays. Existing acceleration algorithms for SIEs, such as the adaptive integral method (AIM), enable the fast approximation of interactions between well-separated mesh elements. Nearby interactions involve the singularity of the kernel, and must instead be computed accurately with direct integration at each frequency of interest, which can be computationally expensive. We propose a novel algorithm for reducing the cost-per-frequency of near-region computations for both homogeneous and layered background media. In the proposed extended AIM (AIMx), the SIE operators are decomposed into a frequency-independent term containing the singularity of the kernel, and a nonsingular frequency-dependent term. Direct integration is only required for the frequency-independent term and can be reused at each frequency, leading to significantly faster frequency sweeps. The frequency-dependent term is captured with good accuracy using fast Fourier transform (FFT)-based acceleration even in the near region, as confirmed with an error analysis. The accuracy and efficiency of the proposed method are demonstrated through numerical examples drawn from several applications, and CPU times are significantly reduced by factors ranging from 3 to 16.
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.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 it