There are no files associated with this item.

##### Supplementary
• 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 Chew, WCWang, YM 1990 John Wiley & Sons, Inc. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/37176 Microwave And Optical Technology Letters, 1990, v. 3 n. 5, p. 164-169 How to Cite? 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 N-scatterer problem. Then, an add-on procedure is developed to obtain recursively an (n + 1)-scatterer solution from an n-scatterer 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 two-scatterer 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 N-scatterer aggregate τ̄(N) matrix will be proportional to P2MN. In the low-frequency 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. http://hdl.handle.net/10722/182504 0895-24772019 Impact Factor: 0.9572015 SCImago Journal Rankings: 0.372

DC FieldValueLanguage
dc.contributor.authorChew, WCen_US
dc.contributor.authorWang, YMen_US
dc.date.accessioned2013-05-02T05:15:38Z-
dc.date.available2013-05-02T05:15:38Z-
dc.date.issued1990en_US
dc.identifier.citationMicrowave And Optical Technology Letters, 1990, v. 3 n. 5, p. 164-169en_US
dc.identifier.issn0895-2477en_US
dc.identifier.urihttp://hdl.handle.net/10722/182504-
dc.description.abstractAn 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 N-scatterer problem. Then, an add-on procedure is developed to obtain recursively an (n + 1)-scatterer solution from an n-scatterer 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 two-scatterer 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 N-scatterer aggregate τ̄(N) matrix will be proportional to P2MN. In the low-frequency 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.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.titleFast algorithm for solution of a scattering problem using a recursive aggregate τ̄ matrix methoden_US
dc.typeArticleen_US
dc.identifier.emailChew, WC: wcchew@hku.hken_US
dc.identifier.authorityChew, WC=rp00656en_US
dc.identifier.scopuseid_2-s2.0-0025433864en_US
dc.identifier.volume3en_US
dc.identifier.issue5en_US
dc.identifier.spage164en_US
dc.identifier.epage169en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChew, WC=36014436300en_US
dc.identifier.scopusauthoridWang, YM=13310238600en_US