A Dissipation Theory for Three-Dimensional FDTD With Application to Stability Analysis and Subgridding
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) algorithm is a popular numerical method for solving electromagnetic problems. FDTD simulations can suffer from instability due to the explicit nature of the method. Stability enforcement is particularly challenging in scenarios where a setup is composed of multiple components, such as grids of different resolution, advanced boundary conditions, reduced-order models, and lumped elements. We propose a dissipation theory for 3-D FDTD inspired by the principle of energy conservation. We view the FDTD update equations for a 3-D region as a dynamical system and show under which conditions the system is dissipative. By requiring each component of an FDTD-like scheme to be dissipative, the stability of the overall coupled scheme follows by construction. The proposed framework enables the creation of provably stable schemes in an easy and modular fashion, since conditions are imposed on the individual components rather than on the overall coupled scheme as in existing approaches. With the proposed framework, we derive a new subgridding scheme with guaranteed stability, low reflections, support for material traverse and arbitrary (odd) grid refinement ratio.
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