File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A fast algorithm for electrically small composite objects

TitleA fast algorithm for electrically small composite objects
Authors
Issue Date2004
PublisherI E E E. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000033
Citation
Ieee Antennas And Propagation Society, Ap-S International Symposium (Digest), 2004, v. 4, p. 3960-3963 How to Cite?
AbstractA multi-tree scheme to apply low-frequency multilevel fast multipole algorithm (LF-MLFMA) to electrically small composite objects, is described. An implementation of basis rearrangement is also presented to make the algorithm stable and capable of solving problems with large number of unknowns. For the scalar potential part in impedance matrix, divergence is taken on tree (RWG) basis to represent charges. When number of unknowns increases, the iteration count increases and eventually iterative solver fails to converge. The interactions between single patches are calculated by applying LF-MLFMA with O(N) CPU time and memory usage.
Persistent Identifierhttp://hdl.handle.net/10722/182992
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorChu, Yen_US
dc.contributor.authorChew, WCen_US
dc.date.accessioned2013-05-02T05:18:00Z-
dc.date.available2013-05-02T05:18:00Z-
dc.date.issued2004en_US
dc.identifier.citationIeee Antennas And Propagation Society, Ap-S International Symposium (Digest), 2004, v. 4, p. 3960-3963en_US
dc.identifier.issn1522-3965en_US
dc.identifier.urihttp://hdl.handle.net/10722/182992-
dc.description.abstractA multi-tree scheme to apply low-frequency multilevel fast multipole algorithm (LF-MLFMA) to electrically small composite objects, is described. An implementation of basis rearrangement is also presented to make the algorithm stable and capable of solving problems with large number of unknowns. For the scalar potential part in impedance matrix, divergence is taken on tree (RWG) basis to represent charges. When number of unknowns increases, the iteration count increases and eventually iterative solver fails to converge. The interactions between single patches are calculated by applying LF-MLFMA with O(N) CPU time and memory usage.en_US
dc.languageengen_US
dc.publisherI E E E. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000033en_US
dc.relation.ispartofIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)en_US
dc.titleA fast algorithm for electrically small composite objectsen_US
dc.typeConference_Paperen_US
dc.identifier.emailChew, WC: wcchew@hku.hken_US
dc.identifier.authorityChew, WC=rp00656en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-4544347305en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-4544347305&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume4en_US
dc.identifier.spage3960en_US
dc.identifier.epage3963en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChu, Y=8688952100en_US
dc.identifier.scopusauthoridChew, WC=36014436300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats