File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A recursive algorithm for reducing algorithmic complexity of scattering problems

TitleA recursive algorithm for reducing algorithmic complexity of scattering problems
Authors
Issue Date1990
Citation
Ieee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1990, v. 1, p. 52-55 How to Cite?
AbstractA 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.
Persistent Identifierhttp://hdl.handle.net/10722/182819
ISSN

 

DC FieldValueLanguage
dc.contributor.authorChew, WCen_US
dc.contributor.authorWang, YMen_US
dc.date.accessioned2013-05-02T05:17:12Z-
dc.date.available2013-05-02T05:17:12Z-
dc.date.issued1990en_US
dc.identifier.citationIeee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1990, v. 1, p. 52-55en_US
dc.identifier.issn0272-4693en_US
dc.identifier.urihttp://hdl.handle.net/10722/182819-
dc.description.abstractA 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.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)en_US
dc.titleA recursive algorithm for reducing algorithmic complexity of scattering problemsen_US
dc.typeConference_Paperen_US
dc.identifier.emailChew, WC: wcchew@hku.hken_US
dc.identifier.authorityChew, WC=rp00656en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0025555906en_US
dc.identifier.volume1en_US
dc.identifier.spage52en_US
dc.identifier.epage55en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChew, WC=36014436300en_US
dc.identifier.scopusauthoridWang, YM=13310238600en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats