By Topic

Efficient Algorithms for Crank–Nicolson-Based Finite-Difference Time-Domain Methods

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Eng Leong Tan ; Nanyang Technol. Univ., Singapore

This paper presents new efficient algorithms for implementing 3-D Crank-Nicolson-based finite-difference time-domain (FDTD) methods. Two recent methods are considered, namely, the Crank-Nicolson direct-splitting (CNDS) and Crank-Nicolson cycle-sweep-uniform (CNCSU) FDTD methods. The algorithms involve update equations whose right-hand sides are much simpler and more concise than the original ones. Analytical proof is provided to show the equivalence of original and present methods. Comparison of their implementations signifies substantial reductions of the floating-point operations count in the new algorithms. Other computational aspects are also optimized, particularly in regard to the for-looping overhead and the memory space requirement. Through numerical simulation and Fourier stability analysis, it is found that while the CNDS FDTD is unconditionally stable, the CNCSU FDTD may actually become unstable.

Published in:

Microwave Theory and Techniques, IEEE Transactions on  (Volume:56 ,  Issue: 2 )