File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Recursive T-matrix algorithms for 1-D and 2-D clusterings of strips

TitleRecursive T-matrix algorithms for 1-D and 2-D clusterings of strips
Authors
Issue Date1991
Citation
Ap-S International Symposium (Digest) (Ieee Antennas And Propagation Society), 1991, v. 1, p. 276-279 How to Cite?
AbstractTwo recursive T-matrix algorithms were introduced by W.C. Chew (1989) W.C. Chew and Y.M. Wang (1990). In the present work, the authors discuss the application of these algorithms to conducting strip geometries, and analyze the complexities of the algorithms. The two algorithms are shown to have complexities of O(N2P) and O(NP2), where N is the number of unknowns in the problem, and P is the number of terms that satisfies a convergence criterion in the addition theorems for the cylindrical wave functions.
Persistent Identifierhttp://hdl.handle.net/10722/182824
ISSN

 

DC FieldValueLanguage
dc.contributor.authorGurel, Len_US
dc.contributor.authorChew, WCen_US
dc.date.accessioned2013-05-02T05:17:13Z-
dc.date.available2013-05-02T05:17:13Z-
dc.date.issued1991en_US
dc.identifier.citationAp-S International Symposium (Digest) (Ieee Antennas And Propagation Society), 1991, v. 1, p. 276-279en_US
dc.identifier.issn0272-4693en_US
dc.identifier.urihttp://hdl.handle.net/10722/182824-
dc.description.abstractTwo recursive T-matrix algorithms were introduced by W.C. Chew (1989) W.C. Chew and Y.M. Wang (1990). In the present work, the authors discuss the application of these algorithms to conducting strip geometries, and analyze the complexities of the algorithms. The two algorithms are shown to have complexities of O(N2P) and O(NP2), where N is the number of unknowns in the problem, and P is the number of terms that satisfies a convergence criterion in the addition theorems for the cylindrical wave functions.en_US
dc.languageengen_US
dc.relation.ispartofAP-S International Symposium (Digest) (IEEE Antennas and Propagation Society)en_US
dc.titleRecursive T-matrix algorithms for 1-D and 2-D clusterings of stripsen_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-0026383540en_US
dc.identifier.volume1en_US
dc.identifier.spage276en_US
dc.identifier.epage279en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridGurel, L=7004393069en_US
dc.identifier.scopusauthoridChew, WC=36014436300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats