By Topic

An Algorithm for Efficient Solution of Finite-Difference Frequency-Domain (FDFD) Methods [EM Programmer's Notebook]

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

4 Author(s)
Demir, V. ; Dept. of Electr. Eng., Northern Illinois Univ., DeKalb, IL, USA ; Alkan, E. ; Elsherbeni, A.Z. ; Arvas, E.

Finite-Difference Frequency-Domain methods (FDFD) require solution of large linear systems of equations. These large systems are represented by matrix equations including highly sparse coefficient matrices, and they can often only be solved by using iterative methods. This paper presents an algorithm in which the matrix-equation solution approach in an iterative method is replaced by a multi-step solution process. Instead of using a coefficient matrix, the coefficients in the FDFD formulations are kept as three-dimensional arrays, and they are treated as operators. The algorithm is used together with the Bi-Conjugate Gradients Stabilized (BICGSTAB) method. This is applied to a three-dimensional FDFD method to solve for scattering from dielectric objects. It is also applied to two other FDFD methods (a single-grid and a double-grid FDFD) to solve for scattering from chiral objects. It has been shown that the presented algorithm effectively reduces the solution time and memory requirements.

Published in:

Antennas and Propagation Magazine, IEEE  (Volume:51 ,  Issue: 6 )