File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Recursive aggregate interaction matrix algorithm for multiple scatterers

TitleRecursive aggregate interaction matrix algorithm for multiple scatterers
Authors
Issue Date1995
Citation
Ieee Transactions On Antennas And Propagation, 1995, v. 43 n. 12, p. 1483-1486 How to Cite?
AbstractThe recursive aggregate interaction matrix algorithm (RAIMA) for calculating a wave scattering solution is developed. This algorithm combines the strength of both the recursive aggregate T matrix algorithm (RATMA) and the recursive interaction matrix algorithm (RIMA) that have been previously developed. The resultant algorithm is robust for scattering problems involving highly singular Green's functions by avoiding the violation of the addition theorem. It also has reduced computational complexity for inverting the volume integral equation of scattering. The computational complexity of RAIMA is O(N7/3) in three dimensions and O(N2) in two dimensions.
Persistent Identifierhttp://hdl.handle.net/10722/182559
ISSN
2015 Impact Factor: 2.053
2015 SCImago Journal Rankings: 2.130
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChew, WCen_US
dc.contributor.authorLu, CCen_US
dc.date.accessioned2013-05-02T05:15:51Z-
dc.date.available2013-05-02T05:15:51Z-
dc.date.issued1995en_US
dc.identifier.citationIeee Transactions On Antennas And Propagation, 1995, v. 43 n. 12, p. 1483-1486en_US
dc.identifier.issn0018-926Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/182559-
dc.description.abstractThe recursive aggregate interaction matrix algorithm (RAIMA) for calculating a wave scattering solution is developed. This algorithm combines the strength of both the recursive aggregate T matrix algorithm (RATMA) and the recursive interaction matrix algorithm (RIMA) that have been previously developed. The resultant algorithm is robust for scattering problems involving highly singular Green's functions by avoiding the violation of the addition theorem. It also has reduced computational complexity for inverting the volume integral equation of scattering. The computational complexity of RAIMA is O(N7/3) in three dimensions and O(N2) in two dimensions.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Antennas and Propagationen_US
dc.titleRecursive aggregate interaction matrix algorithm for multiple scatterersen_US
dc.typeArticleen_US
dc.identifier.emailChew, WC: wcchew@hku.hken_US
dc.identifier.authorityChew, WC=rp00656en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/8.475942en_US
dc.identifier.scopuseid_2-s2.0-0029488897en_US
dc.identifier.volume43en_US
dc.identifier.issue12en_US
dc.identifier.spage1483en_US
dc.identifier.epage1486en_US
dc.identifier.isiWOS:A1995TK50000023-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChew, WC=36014436300en_US
dc.identifier.scopusauthoridLu, CC=7404804587en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats