Abstract
Using the definition of recursive relations for the reflection operator for N strips or patches, two easily programmable recursive algorithms are developed to calculate the scattering by N strips or patches. One algorithm is for arbitrary excitation, and the other is for a fixed excitation. The recursive algorithms require the inversion of small matrices at each stage and hence are suitable for programming on smaller computers. If the N strips or patches are identical and equally spaced, symmetry can be exploited to speed up the algorithms. A program was developed to calculate scattering by N strips, and the result is shown to converge to scattering by a large strip when the N strips are contiguous.link_to_subscribed_fulltex

This publication has 11 references indexed in Scilit: