File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A recursive algorithm for reducing algorithmic complexity of scattering problems
| Title | A recursive algorithm for reducing algorithmic complexity of scattering problems |
|---|---|
| Authors | |
| Issue Date | 1990 |
| Citation | Ieee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1990, v. 1, p. 52-55 How to Cite? |
| Abstract | A recursive algorithm for calculating the exact solution of field scattering from a dielectric object is proposed. As in the method of moments, the object is first divided into N subobjects. Then, every subject is treated as a single scatterer in an N-scatterer problem. The recursive algorithm is then employed to calculate the (n + 1)-scatterer tensor-T matrix from the n-scatterer tensor-T matrix. With this recursive algorithm, the N-scatterer tensor-T matrix can be derived. From this N-scatterer tensor T-matrix, the scattered field from the object can be obtained. This results in an N2 and a linear in N algorithm in the long wavelength limit rather than the N3 algorithm as in the method of moments. |
| Persistent Identifier | http://hdl.handle.net/10722/182819 |
| ISSN | 2019 SCImago Journal Rankings: 0.108 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chew, WC | en_US |
| dc.contributor.author | Wang, YM | en_US |
| dc.date.accessioned | 2013-05-02T05:17:12Z | - |
| dc.date.available | 2013-05-02T05:17:12Z | - |
| dc.date.issued | 1990 | en_US |
| dc.identifier.citation | Ieee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1990, v. 1, p. 52-55 | en_US |
| dc.identifier.issn | 0272-4693 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10722/182819 | - |
| dc.description.abstract | A recursive algorithm for calculating the exact solution of field scattering from a dielectric object is proposed. As in the method of moments, the object is first divided into N subobjects. Then, every subject is treated as a single scatterer in an N-scatterer problem. The recursive algorithm is then employed to calculate the (n + 1)-scatterer tensor-T matrix from the n-scatterer tensor-T matrix. With this recursive algorithm, the N-scatterer tensor-T matrix can be derived. From this N-scatterer tensor T-matrix, the scattered field from the object can be obtained. This results in an N2 and a linear in N algorithm in the long wavelength limit rather than the N3 algorithm as in the method of moments. | en_US |
| dc.language | eng | en_US |
| dc.relation.ispartof | IEEE Antennas and Propagation Society, AP-S International Symposium (Digest) | en_US |
| dc.title | A recursive algorithm for reducing algorithmic complexity of scattering problems | en_US |
| dc.type | Conference_Paper | 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-0025555906 | en_US |
| dc.identifier.volume | 1 | en_US |
| dc.identifier.spage | 52 | en_US |
| dc.identifier.epage | 55 | 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 |
| dc.identifier.issnl | 0272-4693 | - |