Iterative DGFM Solver Extensions for Fast Sparse Array Analysis

This paper considers the efficient method of moments (MoM) solution of large irregular sparse antenna arrays consisting of disjoint identical perfect electric conducting antennas, via an iterative solution scheme utilising only localised solutions. The scheme is based on the domain Green’s function method (DGFM). Two algorithmic extensions are proposed. The first is tiling, which reduces the required number of local solutions and thus also the computational cost. The second is an error-approximation step, which accelerates iterative convergence.