File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Scopus: eid_2-s2.0-0026125635
- WOS: WOS:A1991FF09900006
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Application of the fast recursive algorithm to a large inhomogeneous scatterer for TM polarization
Title | Application of the fast recursive algorithm to a large inhomogeneous scatterer for TM polarization |
---|---|
Authors | |
Keywords | inhomogeneous scatterer numerical methods Recursive algorithm |
Issue Date | 1991 |
Publisher | John 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? |
Abstract | A 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 Identifier | http://hdl.handle.net/10722/182513 |
ISSN | 2023 Impact Factor: 1.0 2023 SCImago Journal Rankings: 0.376 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wang, YM | en_US |
dc.contributor.author | Chew, WC | en_US |
dc.date.accessioned | 2013-05-02T05:15:40Z | - |
dc.date.available | 2013-05-02T05:15:40Z | - |
dc.date.issued | 1991 | en_US |
dc.identifier.citation | Microwave And Optical Technology Letters, 1991, v. 4 n. 4, p. 155-157 | en_US |
dc.identifier.issn | 0895-2477 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/182513 | - |
dc.description.abstract | A 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.language | eng | en_US |
dc.publisher | John Wiley & Sons, Inc. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/37176 | en_US |
dc.relation.ispartof | Microwave and Optical Technology Letters | en_US |
dc.subject | inhomogeneous scatterer | - |
dc.subject | numerical methods | - |
dc.subject | Recursive algorithm | - |
dc.title | Application of the fast recursive algorithm to a large inhomogeneous scatterer for TM polarization | en_US |
dc.type | Article | en_US |
dc.identifier.email | Chew, WC: wcchew@hku.hk | en_US |
dc.identifier.authority | Chew, WC=rp00656 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-0026125635 | en_US |
dc.identifier.volume | 4 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.spage | 155 | en_US |
dc.identifier.epage | 157 | en_US |
dc.identifier.isi | WOS:A1991FF09900006 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Wang, YM=13310238600 | en_US |
dc.identifier.scopusauthorid | Chew, WC=36014436300 | en_US |
dc.identifier.issnl | 0895-2477 | - |