On the Accuracy of Anderson’s fast N –body algorithm
1997 (English)Conference paper (Refereed)
We 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.
Place, publisher, year, edition, pages
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-91171OAI: oai:DiVA.org:kth-91171DiVA: diva2:508447
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing
NR 201408052012-03-082012-03-08Bibliographically approved