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

Citations:
 Scopus: 0
 Appears in Collections:
Article: Fast algorithm for solution of a scattering problem using a recursive aggregate τ̄ matrix method
Title  Fast algorithm for solution of a scattering problem using a recursive aggregate τ̄ matrix method 

Authors  
Issue Date  1990 
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, 1990, v. 3 n. 5, p. 164169 How to Cite? 
Abstract  An algorithm based on the recursive operator algorithm is proposed to solve for the scattered field from an arbitrarily shaped, inhomogenous scatterer. In this method, the scattering problem is first converted to an Nscatterer problem. Then, an addon procedure is developed to obtain recursively an (n + 1)scatterer solution from an nscatterer solution by introducing an aggregate τ̄ matrix in the recursive scheme. The nth aggregate τ̄(n) matrix introduced is equivalent to a global $TAŪ matrix for n scatterers so that in the next recursion, only the twoscatterer problem needs to be solved: One scatterer is the sum of the previous n scatterers, characterized by an nth aggregate τ̄(n) matrix; the other is the (n + 1)th isolated scatterer, characterized by $TAŪn+1(1). If M is the number of harmonics used in the isolated scatterer $TAŪ matrix and P is the number of harmonics used in the translation formulas, the computational effort at each recursion will be proportional to P2M. (Here we assume M is less than P.) Consequently, the total computational effort to obtain the Nscatterer aggregate τ̄(N) matrix will be proportional to P2MN. In the lowfrequency limit, the algorithm is linear in N because P, the number of the harmonics in the translation formulas, is independent of the size of the object. 
Persistent Identifier  http://hdl.handle.net/10722/182504 
ISSN  2019 Impact Factor: 0.957 2015 SCImago Journal Rankings: 0.372 
DC Field  Value  Language 

dc.contributor.author  Chew, WC  en_US 
dc.contributor.author  Wang, YM  en_US 
dc.date.accessioned  20130502T05:15:38Z   
dc.date.available  20130502T05:15:38Z   
dc.date.issued  1990  en_US 
dc.identifier.citation  Microwave And Optical Technology Letters, 1990, v. 3 n. 5, p. 164169  en_US 
dc.identifier.issn  08952477  en_US 
dc.identifier.uri  http://hdl.handle.net/10722/182504   
dc.description.abstract  An algorithm based on the recursive operator algorithm is proposed to solve for the scattered field from an arbitrarily shaped, inhomogenous scatterer. In this method, the scattering problem is first converted to an Nscatterer problem. Then, an addon procedure is developed to obtain recursively an (n + 1)scatterer solution from an nscatterer solution by introducing an aggregate τ̄ matrix in the recursive scheme. The nth aggregate τ̄(n) matrix introduced is equivalent to a global $TAŪ matrix for n scatterers so that in the next recursion, only the twoscatterer problem needs to be solved: One scatterer is the sum of the previous n scatterers, characterized by an nth aggregate τ̄(n) matrix; the other is the (n + 1)th isolated scatterer, characterized by $TAŪn+1(1). If M is the number of harmonics used in the isolated scatterer $TAŪ matrix and P is the number of harmonics used in the translation formulas, the computational effort at each recursion will be proportional to P2M. (Here we assume M is less than P.) Consequently, the total computational effort to obtain the Nscatterer aggregate τ̄(N) matrix will be proportional to P2MN. In the lowfrequency limit, the algorithm is linear in N because P, the number of the harmonics in the translation formulas, is independent of the size of the object.  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  Fast algorithm for solution of a scattering problem using a recursive aggregate τ̄ matrix method  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.00025433864  en_US 
dc.identifier.volume  3  en_US 
dc.identifier.issue  5  en_US 
dc.identifier.spage  164  en_US 
dc.identifier.epage  169  en_US 
dc.publisher.place  United States  en_US 
dc.identifier.scopusauthorid  Chew, WC=36014436300  en_US 
dc.identifier.scopusauthorid  Wang, YM=13310238600  en_US 