返回
An Explicit Newmark-FDTD Algorithm With Subgridding Technique
DOI:10.1109/LAWP.2020.3033567.png)
摘要
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.
Keyword:
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总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.8
论文数:
1.0W
被引数:
2.8W
机构
引用论文
The Power of Lists: IDPs and Disaster Governmentality after the Attabad Landslide in Northern Pakistan列表的力量:阿塔巴德滑坡后巴基斯坦北部的国内流离失所者与灾害治理术
Ethnos
IF0
Whitemen, the Ipili, and the City of Gold: A History of the Politics of Race and Development in Highlands New Guinea白人、伊皮利人与黄金之城:高地新几内亚种族与发展政治史
Ethnohistory
IF0

