2006•International Journal of Numerical Modelling Electronic Networks Devices and FieldsOpen access

Accuracy improved ADI‐FDTD methods

Iftikhar Ahmed, Zhizhang David Chen

Open full text 5 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Finite-difference time-domain method, Stability (learning theory), Computer science, Algorithm, Constraint (computer-aided design), Mathematics, Physics, Optics

Related papers

Back to paper searchBrowse research topicsOriginal source
Accuracy improved ADI‐FDTD methods — Research Paper | ScholarLens