.png){kind=icon}
Return
An Explicit Newmark-FDTD Algorithm With Subgridding Technique
.png){kind=icon}
PRE
AI
DOI：10.1109/LAWP.2020.3033567.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We address the electromagnetic problem involving small structures, and put forward an improved, explicit finite-difference time-domain (FDTD) algorithm based on the Newmark discretization with subgridding technique. This algorithm achieves a stable, low-reflection, and straightforward subgridding with an arbitrary grid refinement ratio by adopting hanging variables. The Newmark method is employed to discretize the numerical system generated by the subgridding method. Besides, the Neumann series is used to obtain the inverse of the coefficient matrix. It makes the time-marching explicit and stable with a uniform large time step only determined by the coarse grid size in the whole computational domain. The series expansion avoids the matrix inversion operation, which largely enhances the calculation efficiency compared to the traditional Newmark-FDTD method. Numerical results prove the reliability and robustness of the proposed method.
Keywords:
Finite difference methods
Magnetic fields
Time-domain analysis
Stability analysis
Electric fields
Mathematical model
Eigenvalues and eigenfunctions
Explicit iteration
hanging variables
Newmark
FDTD
subgridding technique
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
1.0W
Citations:
2.8W
Organization
Cited Papers
The Power of Lists: IDPs and Disaster Governmentality after the Attabad Landslide in Northern Pakistan.png)
Ethnos
EthnosIF0
PREAI
ShareSaveShareSaveWhitemen, the Ipili, and the City of Gold: A History of the Politics of Race and Development in Highlands New GuineaEthnohistory
OAAI
EthnohistoryIF0
OAAIShareSaveShareSave
View more