2000 character limit reached
Removing the Barrier to Scalability in Parallel FMM (1008.2410v1)
Published 14 Aug 2010 in cs.CE, cs.NA, and physics.comp-ph
Abstract: The Fast Multipole Method (FMM) is well known to possess a bottleneck arising from decreasing workload on higher levels of the FMM tree [Greengard and Gropp, Comp. Math. Appl., 20(7), 1990]. We show that this potential bottleneck can be eliminated by overlapping multipole and local expansion computations with direct kernel evaluations on the finest level grid.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.