## Abstract This letter gives the comparison of the 3D hybrid implicit–explicit finite‐difference time‐domain (HIE‐FDTD) method with the ADI‐FDTD method through numerical examples. It shows that the HIE‐FDTD method has higher accuracy than the ADI‐FDTD method, especially for larger rate of field va
Accuracy improved ADI-FDTD methods
✍ Scribed by Iftikhar Ahmed; Zhizhang (David) Chen
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 173 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0894-3370
- DOI
- 10.1002/jnm.628
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
FDTD method plays an important role for simulation of different structures in various fields of engineering, such as RF/microwaves, photonics and VLSI. However, due to the CFL stability constraint, the FDTD time step is still small and the related CPU time is still large for modelling fine geometry where small cell sizes are required to resolve fields. As a result, the unconditionally stable CFL‐condition‐free ADI‐FDTD method is becoming a popular alternative to the FDTD method. The ADI‐FDTD method allows the use of larger time steps; however, it comes at the cost of larger errors. To mitigate the problem of these larger errors, in this paper we propose to modify the conventional ADI‐FDTD algorithm. The modifications are based on the fact that because the ADI‐FDTD is a truncated form of the Crank–Nicolson (CN) method, the truncated terms can be re‐introduced approximately into the ADI algorithms to improve accuracy. Two accuracy‐improved ADI‐FDTD algorithms are derived and then validated for two‐dimensional cases. Unfortunately, in the three‐dimensional case the proposed methods are not found to be unconditionally stable. Copyright © 2006 John Wiley & Sons, Ltd.
📜 SIMILAR VOLUMES
## Abstract A 2D higher‐order alternating‐direction‐implicit (ADI) finite‐difference time‐domain method based on a compact scheme is presented in this paper. This compact ADI method improves the efficiency of computation by reducing the bandwidth of the matrix to be inversed from seven to five for
## Abstract We present a parallel implementation of the three‐dimensional alternating direction implicit finite‐difference time‐domain (ADI‐FDTD) method in Cartesian coordinates using the message passing interface (MPI) library. Parallel implementations not only speed up computations but also incre
## Abstract In this paper, an improved finite‐difference time‐domain (FDTD) algorithm is proposed in order to eliminate the restraint by the Courant–Friedrich–Levy condition. The new algorithm is developed based on an alternating‐direction implicit (ADI) approach. In this method, the conventional t
## Abstract In this paper, a higher‐order alternative‐direction‐implicit (ADI) finite‐difference time‐domain (FDTD) method is presented. The dispersion analysis is performed and the results are compared with those derived from the regular ADI‐FDTD method. Based on the dispersion analysis, a guideli
## Abstract The perfect‐electric‐conductor (PEC) condition implementation for the alternating‐direction‐implicit finite‐difference time‐domain (ADI‐FDTD) method is discussed in this article. By comparing different implementation strategies, it shows that the most accurate implementation method is t