File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A generalized recursive algorithm for wave-scattering solutions in two dimensions

TitleA generalized recursive algorithm for wave-scattering solutions in two dimensions
Authors
Issue Date1992
Citation
Ieee Transactions On Microwave Theory And Techniques, 1992, v. 40 n. 4, p. 716-723 How to Cite?
AbstractA generalized recursive algorithm valid for both the E z and H z wave scattering of densely packed scatterers in two dimensions is derived. This is unlike previously derived recursive algorithms which have been found to be valid only for E z polarized waves. In this generalized recursive algorithm, a scatterer is first divided into N subscatterers. The n-subscatterer solution is then used to solve the (n + n′)-subscatterer solution. The computational complexity of such an algorithm is found to be of O(N 2) in two dimensions while providing a solution valid for all angles of incidence. This is better than the method of moments with Gaussian elimination, which has an O(N 3) complexity.
Persistent Identifierhttp://hdl.handle.net/10722/182523
ISSN
2015 Impact Factor: 2.284
2015 SCImago Journal Rankings: 1.346
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChew, Weng Choen_US
dc.contributor.authorGurel, Leventen_US
dc.contributor.authorWang, YiMingen_US
dc.contributor.authorOtto, Gregoryen_US
dc.contributor.authorWagner, Robert Len_US
dc.contributor.authorLiu, Qing Huoen_US
dc.date.accessioned2013-05-02T05:15:43Z-
dc.date.available2013-05-02T05:15:43Z-
dc.date.issued1992en_US
dc.identifier.citationIeee Transactions On Microwave Theory And Techniques, 1992, v. 40 n. 4, p. 716-723en_US
dc.identifier.issn0018-9480en_US
dc.identifier.urihttp://hdl.handle.net/10722/182523-
dc.description.abstractA generalized recursive algorithm valid for both the E z and H z wave scattering of densely packed scatterers in two dimensions is derived. This is unlike previously derived recursive algorithms which have been found to be valid only for E z polarized waves. In this generalized recursive algorithm, a scatterer is first divided into N subscatterers. The n-subscatterer solution is then used to solve the (n + n′)-subscatterer solution. The computational complexity of such an algorithm is found to be of O(N 2) in two dimensions while providing a solution valid for all angles of incidence. This is better than the method of moments with Gaussian elimination, which has an O(N 3) complexity.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Microwave Theory and Techniquesen_US
dc.titleA generalized recursive algorithm for wave-scattering solutions in two dimensionsen_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/22.127521en_US
dc.identifier.scopuseid_2-s2.0-0026851496en_US
dc.identifier.volume40en_US
dc.identifier.issue4en_US
dc.identifier.spage716en_US
dc.identifier.epage723en_US
dc.identifier.isiWOS:A1992HL98500015-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChew, Weng Cho=36014436300en_US
dc.identifier.scopusauthoridGurel, Levent=7004393069en_US
dc.identifier.scopusauthoridWang, YiMing=13310049900en_US
dc.identifier.scopusauthoridOtto, Gregory=35446329800en_US
dc.identifier.scopusauthoridWagner, Robert L=55451873000en_US
dc.identifier.scopusauthoridLiu, Qing Huo=26643168800en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats