A Generalized Recursive Algorithm for Wave-Scattering Solutions in Two Dimensions

Weng Cho Chew; Yi Ming Wang; Gregory Otto; Robert L. Wagner; Levent Gürel; Qing Huo Liu

doi:10.1109/22.127521

A Generalized Recursive Algorithm for Wave-Scattering Solutions in Two Dimensions

Weng Cho Chew
, Yi Ming Wang
, Gregory Otto
, Robert L. Wagner
, Levent Gürel
, Qing Huo Liu

Research output: Contribution to journal › Article › peer-review

Abstract

A generalized recursive algorithm valid for both the E_zand H_zwave scattering of densely packed scatterers in two dimensions is derived. This is unlike previously derived recursive algorithms which have been found to be valid only for E_zpolarized waves [l]-[7]. In this generalized recursive algorithm, a scatterer is first divided into N subscatterers. The n-subscatterer solution is then used to solve the (n + n')-subscatterer solution. The computational complexity of such an algorithm is found to be of O(N²) in two dimensions, and mean-while, providing a solution valid for all angles of incidence. This is better than the method of moments with Gaussian elimination which has an O(N³) complexity.

Original language	English (US)
Pages (from-to)	716-723
Number of pages	8
Journal	IEEE Transactions on Microwave Theory and Techniques
Volume	40
Issue number	4
DOIs	https://doi.org/10.1109/22.127521
State	Published - Apr 1992
Externally published	Yes

ASJC Scopus subject areas

Radiation
Condensed Matter Physics
Electrical and Electronic Engineering

Online availability

10.1109/22.127521

Library availability

Discover UIUC Full Text

Cite this

@article{d92f5dc142d140bea974fc54bef3356a,

title = "A Generalized Recursive Algorithm for Wave-Scattering Solutions in Two Dimensions",

abstract = "A generalized recursive algorithm valid for both the Ezand Hzwave scattering of densely packed scatterers in two dimensions is derived. This is unlike previously derived recursive algorithms which have been found to be valid only for Ezpolarized waves [l]-[7]. In this generalized recursive algorithm, a scatterer is first divided into N subscatterers. The n-subscatterer solution is then used to solve the (n + n')-subscatterer solution. The computational complexity of such an algorithm is found to be of O(N2) in two dimensions, and mean-while, providing a solution valid for all angles of incidence. This is better than the method of moments with Gaussian elimination which has an O(N3) complexity.",

author = "Chew, \{Weng Cho\} and Wang, \{Yi Ming\} and Gregory Otto and Wagner, \{Robert L.\} and Levent G{\"u}rel and Liu, \{Qing Huo\}",

note = "Manuscript received March 15, 1991; revised November 5, 1991. This work was supported by the National Science Foundation under grant NSF ECS-85-25891, the Office of Naval Research under grant N00014-89-J1286, and the Army Research Office under contract DAAL03-87-KO006 to the University of Illinois Advanced Construction Technology Center. The computer time was provided by the National Center for Supercomputing Applications (NCSA) at the University of Illinois. Urbana-Champaign. W. C. Chew, Y.-M. Wang, G. Otto, and R. L. Wagner are with the Department of Electrical and Computer Engineering, University of Illinois, 1406 W. Green St., Urbana, 1L 61801-2991. L. Giirel was with the Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign. He is presently with the T. J. Watson Research Center of IBM, Yorktown Heights, NY 10598. Q. H. Liu was with the Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign. He is presently with Schlumberger-Doll Research, Ridgefield. CT 06877. IEEE Log Number 9106037.",

year = "1992",

month = apr,

doi = "10.1109/22.127521",

language = "English (US)",

volume = "40",

pages = "716--723",

journal = "IEEE Transactions on Microwave Theory and Techniques",

issn = "0018-9480",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - A Generalized Recursive Algorithm for Wave-Scattering Solutions in Two Dimensions

AU - Chew, Weng Cho

AU - Wang, Yi Ming

AU - Otto, Gregory

AU - Wagner, Robert L.

AU - Gürel, Levent

AU - Liu, Qing Huo

N1 - Manuscript received March 15, 1991; revised November 5, 1991. This work was supported by the National Science Foundation under grant NSF ECS-85-25891, the Office of Naval Research under grant N00014-89-J1286, and the Army Research Office under contract DAAL03-87-KO006 to the University of Illinois Advanced Construction Technology Center. The computer time was provided by the National Center for Supercomputing Applications (NCSA) at the University of Illinois. Urbana-Champaign. W. C. Chew, Y.-M. Wang, G. Otto, and R. L. Wagner are with the Department of Electrical and Computer Engineering, University of Illinois, 1406 W. Green St., Urbana, 1L 61801-2991. L. Giirel was with the Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign. He is presently with the T. J. Watson Research Center of IBM, Yorktown Heights, NY 10598. Q. H. Liu was with the Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign. He is presently with Schlumberger-Doll Research, Ridgefield. CT 06877. IEEE Log Number 9106037.

PY - 1992/4

Y1 - 1992/4

N2 - A generalized recursive algorithm valid for both the Ezand Hzwave scattering of densely packed scatterers in two dimensions is derived. This is unlike previously derived recursive algorithms which have been found to be valid only for Ezpolarized waves [l]-[7]. In this generalized recursive algorithm, a scatterer is first divided into N subscatterers. The n-subscatterer solution is then used to solve the (n + n')-subscatterer solution. The computational complexity of such an algorithm is found to be of O(N2) in two dimensions, and mean-while, providing a solution valid for all angles of incidence. This is better than the method of moments with Gaussian elimination which has an O(N3) complexity.

AB - A generalized recursive algorithm valid for both the Ezand Hzwave scattering of densely packed scatterers in two dimensions is derived. This is unlike previously derived recursive algorithms which have been found to be valid only for Ezpolarized waves [l]-[7]. In this generalized recursive algorithm, a scatterer is first divided into N subscatterers. The n-subscatterer solution is then used to solve the (n + n')-subscatterer solution. The computational complexity of such an algorithm is found to be of O(N2) in two dimensions, and mean-while, providing a solution valid for all angles of incidence. This is better than the method of moments with Gaussian elimination which has an O(N3) complexity.

UR - https://www.scopus.com/pages/publications/0026851496

UR - https://www.scopus.com/pages/publications/0026851496#tab=citedBy

U2 - 10.1109/22.127521

DO - 10.1109/22.127521

M3 - Article

AN - SCOPUS:0026851496

SN - 0018-9480

VL - 40

SP - 716

EP - 723

JO - IEEE Transactions on Microwave Theory and Techniques

JF - IEEE Transactions on Microwave Theory and Techniques

IS - 4

ER -

A Generalized Recursive Algorithm for Wave-Scattering Solutions in Two Dimensions

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this