Convolutional CFS-PML for the 2-D Crank–Nicolson FDTD Scheme and Its Application in Simulation of Ultralow Frequency Electromagnetic Problems
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
A convolutional implementation of the perfectly matched layer (PML) absorbing boundary condition (ABC) with complex frequency-shifted (CFS) constitutive parameters is developed for the original 2-D Crank-Nicolson (CN) scheme of the finite-difference time-domain (FDTD) method. The proposed CN-FDTD method leverages the benefits of both CFS-PML and the unconditionally stable CN scheme, overcoming the stability limits of the conventional FDTD method and decreasing the numerical reflection of evanescent waves. The effectiveness of the proposed scheme is validated by conducting an analysis of the absorbing boundary reflection error and the simulation speed. For an ultralow frequency and small-scale problem with an extremely fine spatial mesh size (<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$2\times 10^{7}$ </tex-math></inline-formula> times smaller than the minimum exited wavelength) and using time steps <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$4\times 10^{6}$ </tex-math></inline-formula> times larger than those in conventional FDTD, we achieved a CPU time improvement of up to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$2.9360\times 10^{4}$ </tex-math></inline-formula> times compared to the conventional FDTD method, with less than 3% numerical error.
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