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

Author

Chew, Weng Cho ; Gurel, Levent ; Wang, Yi-Ming ; Otto, Gregory ; Wagner, Robert L. ; Liu, Qing Huo

Author_Institution

Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA

Volume

40

Issue

4

fYear

1992

fDate

4/1/1992 12:00:00 AM

Firstpage

716

Lastpage

723

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²) 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³) complexity

Keywords

computational complexity; electromagnetic wave scattering; matrix algebra; E_z wave scattering; EM waves; H_z wave scattering; computational complexity; densely packed scatterers; generalized recursive algorithm; polarized waves; subscatterers; two dimensions; wave-scattering solutions; Application software; Clustering algorithms; Computational complexity; Engine cylinders; Gradient methods; Military computing; Moment methods; Nonuniform electric fields; Polarization; Scattering;

fLanguage

English

Journal_Title

Microwave Theory and Techniques, IEEE Transactions on

Publisher

ieee

ISSN

0018-9480

Type

jour

DOI

10.1109/22.127521

Filename

127521