File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Application of the fast recursive algorithm to a large inhomogeneous scatterer for TM polarization

TitleApplication of the fast recursive algorithm to a large inhomogeneous scatterer for TM polarization
Authors
Issue Date1991
PublisherJohn Wiley & Sons, Inc. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/37176
Citation
Microwave And Optical Technology Letters, 1991, v. 4 n. 4, p. 155-157 How to Cite?
AbstractA fast recursive algorithm has been developed to solve for the scattering solution of a large 2-D inhomogeneous body for TM waves. The inhomogeneous body is first divided into N subscatterers. The algorithm uses an aggregate T̄ matrix and translation formulas to solve for the solution of n + 1 subscatterers from the solution for n subscatterers. The computational complexity of the algorithm is of O(NMP2), where NM is the number of unknowns and P is the number of harmonics required in the translation formulas. The memory requirement is proportional to the number of unknowns. The algorithm has been used to solve for the scattering solution of a 10-λ-diameter two-dimensional scatterer with about 12,000 unknowns, taking about 30 s on a CRAY-2 supercomputer.
Persistent Identifierhttp://hdl.handle.net/10722/182513
ISSN
2015 Impact Factor: 0.545
2015 SCImago Journal Rankings: 0.372

 

DC FieldValueLanguage
dc.contributor.authorWang, YMen_US
dc.contributor.authorChew, WCen_US
dc.date.accessioned2013-05-02T05:15:40Z-
dc.date.available2013-05-02T05:15:40Z-
dc.date.issued1991en_US
dc.identifier.citationMicrowave And Optical Technology Letters, 1991, v. 4 n. 4, p. 155-157en_US
dc.identifier.issn0895-2477en_US
dc.identifier.urihttp://hdl.handle.net/10722/182513-
dc.description.abstractA fast recursive algorithm has been developed to solve for the scattering solution of a large 2-D inhomogeneous body for TM waves. The inhomogeneous body is first divided into N subscatterers. The algorithm uses an aggregate T̄ matrix and translation formulas to solve for the solution of n + 1 subscatterers from the solution for n subscatterers. The computational complexity of the algorithm is of O(NMP2), where NM is the number of unknowns and P is the number of harmonics required in the translation formulas. The memory requirement is proportional to the number of unknowns. The algorithm has been used to solve for the scattering solution of a 10-λ-diameter two-dimensional scatterer with about 12,000 unknowns, taking about 30 s on a CRAY-2 supercomputer.en_US
dc.languageengen_US
dc.publisherJohn Wiley & Sons, Inc. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/37176en_US
dc.relation.ispartofMicrowave and Optical Technology Lettersen_US
dc.titleApplication of the fast recursive algorithm to a large inhomogeneous scatterer for TM polarizationen_US
dc.typeArticleen_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-0026125635en_US
dc.identifier.volume4en_US
dc.identifier.issue4en_US
dc.identifier.spage155en_US
dc.identifier.epage157en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridWang, YM=13310238600en_US
dc.identifier.scopusauthoridChew, WC=36014436300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats