Recursive T-matrix algorithms for the solution of electromagnetic scattering from strip and patch geometries

Two recursive T-matrix algorithms are presented and their reduced computational complexities and reduced memory requirements are demonstrated. These algorithms are applied to the problem of electromagnetic scattering from conducting strips and patches with canonical geometries. The geometries are reminiscent of finite-sized frequency selective surfaces. Computational complexities of O(N/sup 2/) and O(N/sup 7/3/) and memory requirements of O(N) and O(N/sup 4/3/) are shown to be feasible for two-dimensional and three-dimensional geometries, respectively. The formulation uses only two components of the electric field. Therefore, the vector electromagnetic problem of scattering from three-dimensional patch geometries can be solved using scalar addition theorems for spherical harmonic wave functions. For a two-dimensional strip problem, both TM and TE polarizations can be solved simultaneously using this formulation. Numerical scattering results in the form of radar cross sections (RCS) are validated by comparison with the method of moments.<
>