Show simple item record

dc.contributor.authorHu, Yu Charlie
dc.contributor.authorJohnsson, S. Lennart
dc.date.accessioned2016-03-04T18:42:36Z
dc.date.issued1996
dc.identifier.citationHu, Yu Charlie and S. Lennart Johnsson. 1996. On the Accuracy of Anderson's Fast N-body Algorithm. Harvard Computer Science Group Technical Report TR-16-96.en_US
dc.identifier.urihttp://nrs.harvard.edu/urn-3:HUL.InstRepos:25686816
dc.description.abstractWe present an empirical study of the accuracy-cost tradeoffs of Anderson's method. The various parameters that control the degree of approximation of the computational elements and the separateness of interacting computational elements govern both the arithmetic complexity and the accuracy of the method. Our experiment shows that for a given error requirement, using a near-field containing only nearest neighbor boxes and a hierarchy depth that minimizes the number of arithmetic operations minimizes the total number of arithmetic operations.en_US
dc.description.sponsorshipEngineering and Applied Sciencesen_US
dc.language.isoen_USen_US
dash.licenseLAA
dc.titleOn the Accuracy of Anderson's Fast N-body Algorithmen_US
dc.typeResearch Paper or Reporten_US
dc.description.versionVersion of Recorden_US
dc.date.available2016-03-04T18:42:36Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record