By Topic

Efficient Implementation for 3-D Laguerre-Based Finite-Difference Time-Domain Method

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
$33 $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

4 Author(s)
Yan-Tao Duan ; Nanjing Engineering Institute, Nanjing, China ; Bin Chen ; Da-Gang Fang ; Bi-Hua Zhou

When the Laguerre-based finite-difference time-domain (FDTD) method is used for electromagnetic problems, a huge sparse matrix equation results, which is very expensive to solve. We previously introduced an efficient algorithm for implementing an unconditionally stable 2-D Laguerre-based FDTD method. We numerically verified that the efficient algorithm can save CPU time and memory storage greatly while maintaining comparable computational accuracy. This paper presents new efficient algorithm for implementing unconditionally stable 3-D Laguerre-based FDTD method. To do so, a factorization-splitting scheme using two sub-steps is adopted to solve the produced huge sparse matrix equation. For a full update cycle, the presented scheme solves six tri-diagonal matrices for the electric field components and computes three explicit equations for the magnetic field components. A perfectly matched layer absorbing boundary condition is also extended to this approach. In order to demonstrate the accuracy and efficiency of the proposed method, numerical examples are given.

Published in:

IEEE Transactions on Microwave Theory and Techniques  (Volume:59 ,  Issue: 1 )