Recursion relations for three-dimensional scalar addition theorem

W. C. Chew

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Efficient recursion relations for the elements of the translation matrix are derived. These recursion relations are a lot more efficient than the previous ones. It is noted that the efficient evaluation of the addition theorem is important in a number of scattering applications, especially in fast recursive algorithms.

Original languageEnglish (US)
Title of host publication1991 Digest
PublisherPubl by IEEE
Number of pages4
ISBN (Print)0780301447
StatePublished - 1991
Externally publishedYes
EventAntennas and Propagation Society Symposium - London, Ont, Can
Duration: Jun 24 1991Jun 28 1991

Publication series

NameAP-S International Symposium (Digest) (IEEE Antennas and Propagation Society)
ISSN (Print)0272-4693


OtherAntennas and Propagation Society Symposium
CityLondon, Ont, Can

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Recursion relations for three-dimensional scalar addition theorem'. Together they form a unique fingerprint.

Cite this