FAST ALGORITHM FOR SCATTERING FROM PLANAR ARRAYS OF CONDUCTING PATCHES

A direct (noniterative) algorithm for the solution of the electromagne tic scattering from three-dimensional planar arrays of conducting patc hes is developed, For an N-unknown problem, the computational complexi ty of this new solution technique is shown to be O(N-2 log(2)N), which is considerably lower than the O(N-3) computational complexity of the conventional direct solution techniques, The advantages of the reduct ion in the computational complexity is pronounced in the solution of l arge electromagnetics problems, such as scattering from large and fini te arrays of patches, synthesis and analysis of finite-sized frequency selective surfaces (FSS's), and radiation and scattering from large p hased-array antennas, to name a few.