A generalized recursive algorithm for wave-scattering solutions in two dimensions

Abstract
A generalized recursive algorithm valid for both the E z and H z wave scattering of densely packed scatterers in two dimensions is derived. This is unlike previously derived recursive algorithms which have been found to be valid only for E z polarized waves. In this generalized recursive algorithm, a scatterer is first divided into N subscatterers. The n-subscatterer solution is then used to solve the (n + n′)-subscatterer solution. The computational complexity of such an algorithm is found to be of O(N 2) in two dimensions while providing a solution valid for all angles of incidence. This is better than the method of moments with Gaussian elimination, which has an O(N 3) complexity.link_to_subscribed_fulltex

This publication has 12 references indexed in Scilit: