Development of three-dimensional unconditionally stable finite-difference time-domain methods
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 finite-difference time-domain (FDTD) method has been widely applied in solving electromagnetic problems. Its capability of handling electrically large or high-Q structure problems is, however, limited by the requirements of large computation memory and time. Such requirements are due to the numerical dispersion errors and the CFL stability condition. So far, most of the research efforts have been focused in developing schemes such as MRTD and PSTD that possess low numerical dispersion and therefore require low computation memory. In this paper, we will present another direction in improving the FDTD computation efficiency: removal of the CPL stability condition. In other words, we will present an unconditionally stable 3D finite-difference time-domain method where the FDTD time step, is no longer restricted by the CPL stability condition but by the modelling accuracy of the FDTD algorithm only. As a result, FDTD iteration number and CPU time are reduced. To further reduce numerical dispersion, anisotropy and memory of the method, a high-order scheme is also presented. Theoretical studies and numerical examples will be presented to validate the proposed schemes.
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.012 | 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