File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Recursive algorithms for calculating the scattering from N strips or patches

TitleRecursive algorithms for calculating the scattering from N strips or patches
Authors
Issue Date1990
Citation
Ieee Transactions On Antennas And Propagation, 1990, v. 38 n. 4, p. 507-515 How to Cite?
AbstractUsing the definition of recursive relations for the reflection operator for N strips or patches, two easily programmable recursive algorithms are developed to calculate the scattering by N strips or patches. One algorithm is for arbitrary excitation, and the other is for a fixed excitation. The recursive algorithms require the inversion of small matrices at each stage and hence are suitable for programming on smaller computers. If the N strips or patches are identical and equally spaced, symmetry can be exploited to speed up the algorithms. A program was developed to calculate scattering by N strips, and the result is shown to converge to scattering by a large strip when the N strips are contiguous.
Persistent Identifierhttp://hdl.handle.net/10722/182499
ISSN
2015 Impact Factor: 2.053
2015 SCImago Journal Rankings: 2.130
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorGurel, Leventen_US
dc.contributor.authorChew, Weng Choen_US
dc.date.accessioned2013-05-02T05:15:37Z-
dc.date.available2013-05-02T05:15:37Z-
dc.date.issued1990en_US
dc.identifier.citationIeee Transactions On Antennas And Propagation, 1990, v. 38 n. 4, p. 507-515en_US
dc.identifier.issn0018-926Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/182499-
dc.description.abstractUsing the definition of recursive relations for the reflection operator for N strips or patches, two easily programmable recursive algorithms are developed to calculate the scattering by N strips or patches. One algorithm is for arbitrary excitation, and the other is for a fixed excitation. The recursive algorithms require the inversion of small matrices at each stage and hence are suitable for programming on smaller computers. If the N strips or patches are identical and equally spaced, symmetry can be exploited to speed up the algorithms. A program was developed to calculate scattering by N strips, and the result is shown to converge to scattering by a large strip when the N strips are contiguous.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Antennas and Propagationen_US
dc.titleRecursive algorithms for calculating the scattering from N strips or patchesen_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.52269en_US
dc.identifier.scopuseid_2-s2.0-0025419127en_US
dc.identifier.volume38en_US
dc.identifier.issue4en_US
dc.identifier.spage507en_US
dc.identifier.epage515en_US
dc.identifier.isiWOS:A1990CZ50800010-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridGurel, Levent=7004393069en_US
dc.identifier.scopusauthoridChew, Weng Cho=36014436300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats