A FAST MOM SOLVER FOR LARGE ARRAYS OF PRINTED ANTENNAS: PRECONDITIONED GIFFT (GREEN'S FUNCTION INTERPOLATION AND FFT)

摘要

A new type of fast MoM solution scheme for large arrays with arbitrary contours and/or missing elements is developed using standard basis functions. The efficiency of the method relies on approximating the Green's function as a sum of separable interpolation functions defined on a relatively sparse uniform grid, along with use of the FFT. Preliminary results show the effectiveness of the method for planar arrays of printed antennas. Both fill and solve times, as well as memory requirements, are improved with respect to standard MoM solvers.