File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fast polynomial representation for the translation operators of an MLFMA

TitleFast polynomial representation for the translation operators of an MLFMA
Authors
Issue Date2001
PublisherJohn Wiley & Sons, Inc. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/37176
Citation
Microwave And Optical Technology Letters, 2001, v. 28 n. 5, p. 298-303 How to Cite?
AbstractDiagonal translation operators form the core of the dynamic multilevel fast multipole algorithm (MLFMA). An application of the MLFMA requires knowledge of these operators over a large number of samples. In fact, the cost of a naive evaluation is O(N3/2), where N is the number of unknowns. More importantly, in a distributed memory computer, if the operators are precomputed and replicated in every processor, the memory requirements scale as O(Np), where p is the number of processors. In this paper, we construct fast polynomial representations of the diagonal operators which require O(√N) storage, and which can be computed in O(N log (1/q)) time, where q is the desired precision. We report some numerical results demonstrating the performance of the new representations.
Persistent Identifierhttp://hdl.handle.net/10722/182648
ISSN
2015 Impact Factor: 0.545
2015 SCImago Journal Rankings: 0.372
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorVelamparambil, Sen_US
dc.contributor.authorChew, WCen_US
dc.date.accessioned2013-05-02T05:16:15Z-
dc.date.available2013-05-02T05:16:15Z-
dc.date.issued2001en_US
dc.identifier.citationMicrowave And Optical Technology Letters, 2001, v. 28 n. 5, p. 298-303en_US
dc.identifier.issn0895-2477en_US
dc.identifier.urihttp://hdl.handle.net/10722/182648-
dc.description.abstractDiagonal translation operators form the core of the dynamic multilevel fast multipole algorithm (MLFMA). An application of the MLFMA requires knowledge of these operators over a large number of samples. In fact, the cost of a naive evaluation is O(N3/2), where N is the number of unknowns. More importantly, in a distributed memory computer, if the operators are precomputed and replicated in every processor, the memory requirements scale as O(Np), where p is the number of processors. In this paper, we construct fast polynomial representations of the diagonal operators which require O(√N) storage, and which can be computed in O(N log (1/q)) time, where q is the desired precision. We report some numerical results demonstrating the performance of the new representations.en_US
dc.languageengen_US
dc.publisherJohn Wiley & Sons, Inc. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/37176en_US
dc.relation.ispartofMicrowave and Optical Technology Lettersen_US
dc.titleFast polynomial representation for the translation operators of an MLFMAen_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.1002/1098-2760(20010305)28:5<298::AID-MOP1023>3.0.CO;2-Len_US
dc.identifier.scopuseid_2-s2.0-0035280654en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0035280654&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume28en_US
dc.identifier.issue5en_US
dc.identifier.spage298en_US
dc.identifier.epage303en_US
dc.identifier.isiWOS:000166929000003-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridVelamparambil, S=6602793534en_US
dc.identifier.scopusauthoridChew, WC=36014436300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats