File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A novel implementation of multilevel fast multipole algorithm for higher order galerkin's method

TitleA novel implementation of multilevel fast multipole algorithm for higher order galerkin's method
Authors
KeywordsFast Solvers
Galerkin's Method
Issue Date2000
Citation
Ieee Transactions On Antennas And Propagation, 2000, v. 48 n. 8, p. 1192-1197 How to Cite?
AbstractA new approach is proposed to reduce the memory requirements of the multilevel fast multipole algorithm (MLFMA) when applied to the higher order Galerkin's method. This approach represents higher order basis functions by a set of point sources such that a matrix-vector multiply is equivalent to calculating the fields at a number of points from given current sources at these points. The MLFMA is then applied to calculate the point-to-point interactions. This permits the use of more levels in MLFMA than applying MLFMA to basis-to-basis interactions directly and, thus, reduces the memory requirements significantly. © 2000 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/182441
ISSN
2015 Impact Factor: 2.053
2015 SCImago Journal Rankings: 2.130
References

 

DC FieldValueLanguage
dc.contributor.authorDonepudi, KCen_US
dc.contributor.authorSong, Jen_US
dc.contributor.authorJin, JMen_US
dc.contributor.authorKang, Gen_US
dc.contributor.authorChew, WCen_US
dc.date.accessioned2013-05-02T05:15:21Z-
dc.date.available2013-05-02T05:15:21Z-
dc.date.issued2000en_US
dc.identifier.citationIeee Transactions On Antennas And Propagation, 2000, v. 48 n. 8, p. 1192-1197en_US
dc.identifier.issn0018-926Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/182441-
dc.description.abstractA new approach is proposed to reduce the memory requirements of the multilevel fast multipole algorithm (MLFMA) when applied to the higher order Galerkin's method. This approach represents higher order basis functions by a set of point sources such that a matrix-vector multiply is equivalent to calculating the fields at a number of points from given current sources at these points. The MLFMA is then applied to calculate the point-to-point interactions. This permits the use of more levels in MLFMA than applying MLFMA to basis-to-basis interactions directly and, thus, reduces the memory requirements significantly. © 2000 IEEE.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Antennas and Propagationen_US
dc.subjectFast Solversen_US
dc.subjectGalerkin's Methoden_US
dc.titleA novel implementation of multilevel fast multipole algorithm for higher order galerkin's methoden_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.884486en_US
dc.identifier.scopuseid_2-s2.0-0001437417en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0001437417&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume48en_US
dc.identifier.issue8en_US
dc.identifier.spage1192en_US
dc.identifier.epage1197en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridDonepudi, KC=6603623868en_US
dc.identifier.scopusauthoridSong, J=7404788341en_US
dc.identifier.scopusauthoridJin, JM=7403588231en_US
dc.identifier.scopusauthoridKang, G=36671331600en_US
dc.identifier.scopusauthoridChew, WC=36014436300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats