Recursion relations for three-dimensional scalar addition theorem

Weng Cho Chew

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

Abstract

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
Pages1639-1642
Number of pages4
ISBN (Print)0780301447
StatePublished - Dec 1 1991
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)
Volume3
ISSN (Print)0272-4693

Other

OtherAntennas and Propagation Society Symposium
CityLondon, Ont, Can
Period6/24/916/28/91

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

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

  • Cite this

    Chew, W. C. (1991). Recursion relations for three-dimensional scalar addition theorem. In 1991 Digest (pp. 1639-1642). (AP-S International Symposium (Digest) (IEEE Antennas and Propagation Society); Vol. 3). Publ by IEEE.