File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Fast direct (noniterative) solvers for integral-equation formulations of scattering problems

TitleFast direct (noniterative) solvers for integral-equation formulations of scattering problems
Authors
Issue Date1998
Citation
Ieee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1998, v. 1, p. 298-301 How to Cite?
AbstractA 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 Identifierhttp://hdl.handle.net/10722/182890
ISSN
2019 SCImago Journal Rankings: 0.108

 

DC FieldValueLanguage
dc.contributor.authorGurel, Leventen_US
dc.contributor.authorChew, Weng Choen_US
dc.date.accessioned2013-05-02T05:17:32Z-
dc.date.available2013-05-02T05:17:32Z-
dc.date.issued1998en_US
dc.identifier.citationIeee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1998, v. 1, p. 298-301en_US
dc.identifier.issn0272-4693en_US
dc.identifier.urihttp://hdl.handle.net/10722/182890-
dc.description.abstractA 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.languageengen_US
dc.relation.ispartofIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)en_US
dc.titleFast direct (noniterative) solvers for integral-equation formulations of scattering problemsen_US
dc.typeConference_Paperen_US
dc.identifier.emailChew, Weng Cho: wcchew@hku.hken_US
dc.identifier.authorityChew, Weng Cho=rp00656en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0031622271en_US
dc.identifier.volume1en_US
dc.identifier.spage298en_US
dc.identifier.epage301en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridGurel, Levent=7004393069en_US
dc.identifier.scopusauthoridChew, Weng Cho=36014436300en_US
dc.identifier.issnl0272-4693-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats