About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
A Generalized Recursive Algorithm for Wave-Scattering Solutions in Two Dimensions
Abstract
A generalized recursive algorithm valid for both the Eand Hwave 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 Epolarized waves [l]-[7]. 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(N2) in two dimensions, and mean-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(N3) complexity. © 1992 IEEE