File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Fast direct (noniterative) solvers for integral-equation formulations of scattering problems
Title | Fast direct (noniterative) solvers for integral-equation formulations of scattering problems |
---|---|
Authors | |
Issue Date | 1998 |
Citation | Ieee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1998, v. 1, p. 298-301 How to Cite? |
Abstract | A family of direct (noniterative) solvers with reduced computational complexity is proposed for solving problems involving resonant or near-resonant structures. Based on the recursive interaction matrix algorithm, the solvers exploit the aggregation concept of the recursive aggregate T-matrix algorithm to accelerate the solution. Direct algorithms are developed to compute the scattered field and the current coefficient, and invert the impedance matrix. Computational complexities of these algorithms are expressed in terms of the number of harmonics P required to express the scattered field of a larger scatterer made up of N scatterers. The exact P-N relation is determined by the geometry. |
Persistent Identifier | http://hdl.handle.net/10722/182890 |
ISSN | 2019 SCImago Journal Rankings: 0.108 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gurel, Levent | en_US |
dc.contributor.author | Chew, Weng Cho | en_US |
dc.date.accessioned | 2013-05-02T05:17:32Z | - |
dc.date.available | 2013-05-02T05:17:32Z | - |
dc.date.issued | 1998 | en_US |
dc.identifier.citation | Ieee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1998, v. 1, p. 298-301 | en_US |
dc.identifier.issn | 0272-4693 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/182890 | - |
dc.description.abstract | A family of direct (noniterative) solvers with reduced computational complexity is proposed for solving problems involving resonant or near-resonant structures. Based on the recursive interaction matrix algorithm, the solvers exploit the aggregation concept of the recursive aggregate T-matrix algorithm to accelerate the solution. Direct algorithms are developed to compute the scattered field and the current coefficient, and invert the impedance matrix. Computational complexities of these algorithms are expressed in terms of the number of harmonics P required to express the scattered field of a larger scatterer made up of N scatterers. The exact P-N relation is determined by the geometry. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | IEEE Antennas and Propagation Society, AP-S International Symposium (Digest) | en_US |
dc.title | Fast direct (noniterative) solvers for integral-equation formulations of scattering problems | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Chew, Weng Cho: wcchew@hku.hk | en_US |
dc.identifier.authority | Chew, Weng Cho=rp00656 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-0031622271 | en_US |
dc.identifier.volume | 1 | en_US |
dc.identifier.spage | 298 | en_US |
dc.identifier.epage | 301 | en_US |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Gurel, Levent=7004393069 | en_US |
dc.identifier.scopusauthorid | Chew, Weng Cho=36014436300 | en_US |
dc.identifier.issnl | 0272-4693 | - |