File Download
There are no files associated with this item.
Supplementary

Citations:
 Scopus: 0
 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  
Issue Date  1991 
Publisher  John Wiley & Sons, Inc. The Journal's web site is located at http://www3.interscience.wiley.com/cgibin/jhome/37176 
Citation  Microwave And Optical Technology Letters, 1991, v. 4 n. 4, p. 155157 How to Cite? 
Abstract  A fast recursive algorithm has been developed to solve for the scattering solution of a large 2D 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 twodimensional scatterer with about 12,000 unknowns, taking about 30 s on a CRAY2 supercomputer. 
Persistent Identifier  http://hdl.handle.net/10722/182513 
ISSN  2015 Impact Factor: 0.545 2015 SCImago Journal Rankings: 0.372 
DC Field  Value  Language 

dc.contributor.author  Wang, YM  en_US 
dc.contributor.author  Chew, WC  en_US 
dc.date.accessioned  20130502T05:15:40Z   
dc.date.available  20130502T05:15:40Z   
dc.date.issued  1991  en_US 
dc.identifier.citation  Microwave And Optical Technology Letters, 1991, v. 4 n. 4, p. 155157  en_US 
dc.identifier.issn  08952477  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 2D 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 twodimensional scatterer with about 12,000 unknowns, taking about 30 s on a CRAY2 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/cgibin/jhome/37176  en_US 
dc.relation.ispartof  Microwave and Optical Technology Letters  en_US 
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_2s2.00026125635  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.publisher.place  United States  en_US 
dc.identifier.scopusauthorid  Wang, YM=13310238600  en_US 
dc.identifier.scopusauthorid  Chew, WC=36014436300  en_US 