Unconditionally-stable FDTD method based on Crank-Nicolson scheme for solving three-dimensional Maxwell equations
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
The approximate-factorisation-splitting (CNAFS) method as an efficient implementation of the Crank-Nicolson scheme for solving the three-dimensional Maxwell equations in the time domain, using much less CPU time and memory than a direct implementation, is presented. At each time step, the CNAFS method solves tridiagonal matrices successively instead of solving a huge sparse matrix. It is shown that CNAFS is unconditionally stable and has much smaller anisotropy than the alternating-direction implicit (ADI) method, though the numerical dispersion is the same as in the ADI method along the axes. In addition, for a given mesh density, there will be one value of the Courant number at which the CNAFS method has zero anisotropy, whereas the Crank-Nicolson scheme always has anisotropy. Analysis shows that both ADI and CNAFS have time step-size limits to avoid numerical attenuation, although both are still unconditionally stable beyond their limit.
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