Show simple item record

Data Structures, Optimal Choice of Parameters, and Complexity Results for Generalized Multilevel Fast Multipole Methods in $d$ Dimensions

dc.contributor.authorGumerov, Nail A.en_US
dc.contributor.authorDuraiswami, Ramanien_US
dc.contributor.authorBorovikov, Eugene A.en_US
dc.date.accessioned2004-05-31T23:26:55Z
dc.date.available2004-05-31T23:26:55Z
dc.date.created2003-02en_US
dc.date.issued2003-04-04en_US
dc.identifier.urihttp://hdl.handle.net/1903/1270
dc.description.abstractWe present an overview of the Fast Multipole Method, explain the use of optimal data structures and present complexity results for the algorithm. We explain how octree structures and bit interleaving can be simply used to create efficient versions of the multipole algorithm in $d$ dimensions. We then present simulations that demonstrate various aspects of the algorithm, including optimal selection of the clustering parameter, the influence of the error bound on the complexity, and others. The use of these optimal parameters results in a many-fold speed-up of the FMM, and prove very useful in practice. UMIACS-TR-2003-28en_US
dc.format.extent844413 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4458en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-2003-28en_US
dc.titleData Structures, Optimal Choice of Parameters, and Complexity Results for Generalized Multilevel Fast Multipole Methods in $d$ Dimensionsen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record