A recursive algorithm for reducing algorithmic complexity of scattering problems

W. C. Chew, Y. M. Wang

Research output: Contribution to journalConference article

Abstract

A recursive algorithm for calculating the exact solution of field scattering from a dielectric object is proposed. As in the method of moments, the object is first divided into N subobjects. Then, every subject is treated as a single scatterer in an N-scatterer problem. The recursive algorithm is then employed to calculate the (n + 1)-scatterer tensor-T matrix from the n-scatterer tensor-T matrix. With this recursive algorithm, the N-scatterer tensor-T matrix can be derived. From this N-scatterer tensor T-matrix, the scattered field from the object can be obtained. This results in an N2 and a linear in N algorithm in the long wavelength limit rather than the N3 algorithm as in the method of moments.

Original languageEnglish (US)
Pages (from-to)52-55
Number of pages4
JournalIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
Volume1
DOIs
StatePublished - Jan 1 1990
Event1990 Antennas and Propagation Symposium Digest - Dallas, TX, USA
Duration: May 7 1990May 11 1990

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A recursive algorithm for reducing algorithmic complexity of scattering problems'. Together they form a unique fingerprint.

Cite this