File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Recursive T-matrix algorithms for the solution of electromagnetic scattering from strip and patch geometries

TitleRecursive T-matrix algorithms for the solution of electromagnetic scattering from strip and patch geometries
Authors
Issue Date1993
Citation
Ieee Transactions On Antennas And Propagation, 1993, v. 41 n. 1, p. 91-99 How to Cite?
AbstractTwo recursive T-matrix algorithms (RTMA's) are presented and their reduced computational complexities and reduced memory requirements are demonstrated. These algorithms are applied to the problem of electromagnetic scattering from conducting strip and patch geometries. For a systematic development, canonical geometries of strips and patches are chosen. These geometries are reminiscent of finite-sized frequency selective surface (FSS's). Computational complexities of O(N2) and O(N7/3) and memory requirements of O(N) and O(N4/3) are shown to be feasible for two-dimensional and three-dimensional geometries, respectively. The formulation uses only two components of the electric field. Therefore, the vector electromagnetic problem of scattering from three-dimensional patch geometries can be solved using scalar - rather than vector - addition theorems for spherical harmonic wave functions. For a two-dimensional strip problem, both TM and TE polarizations can be solved simultaneously using this formulation. Numerical scattering results are presented in the form of radar cross sections (RCS's) and validated by comparison with the method of moments (MoM).
Persistent Identifierhttp://hdl.handle.net/10722/182529
ISSN
2015 Impact Factor: 2.053
2015 SCImago Journal Rankings: 2.130
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorGuerel, Leventen_US
dc.contributor.authorChew, Weng Choen_US
dc.date.accessioned2013-05-02T05:15:45Z-
dc.date.available2013-05-02T05:15:45Z-
dc.date.issued1993en_US
dc.identifier.citationIeee Transactions On Antennas And Propagation, 1993, v. 41 n. 1, p. 91-99en_US
dc.identifier.issn0018-926Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/182529-
dc.description.abstractTwo recursive T-matrix algorithms (RTMA's) are presented and their reduced computational complexities and reduced memory requirements are demonstrated. These algorithms are applied to the problem of electromagnetic scattering from conducting strip and patch geometries. For a systematic development, canonical geometries of strips and patches are chosen. These geometries are reminiscent of finite-sized frequency selective surface (FSS's). Computational complexities of O(N2) and O(N7/3) and memory requirements of O(N) and O(N4/3) are shown to be feasible for two-dimensional and three-dimensional geometries, respectively. The formulation uses only two components of the electric field. Therefore, the vector electromagnetic problem of scattering from three-dimensional patch geometries can be solved using scalar - rather than vector - addition theorems for spherical harmonic wave functions. For a two-dimensional strip problem, both TM and TE polarizations can be solved simultaneously using this formulation. Numerical scattering results are presented in the form of radar cross sections (RCS's) and validated by comparison with the method of moments (MoM).en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Antennas and Propagationen_US
dc.titleRecursive T-matrix algorithms for the solution of electromagnetic scattering from strip and patch geometriesen_US
dc.typeArticleen_US
dc.identifier.emailChew, Weng Cho: wcchew@hku.hken_US
dc.identifier.authorityChew, Weng Cho=rp00656en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/8.210120en_US
dc.identifier.scopuseid_2-s2.0-0027271779en_US
dc.identifier.volume41en_US
dc.identifier.issue1en_US
dc.identifier.spage91en_US
dc.identifier.epage99en_US
dc.identifier.isiWOS:A1993KX38400013-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridGuerel, Levent=6506526977en_US
dc.identifier.scopusauthoridChew, Weng Cho=36014436300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats