An efficient solution of Finite-Difference Frequency-Domain (FDFD) equations

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-vector product in an iterative method is replaced by a three-step process. It has been shown that the presented algorithm effectively reduces the solution time and memory requirements.