10.6084/m9.figshare.91439.v1 Lorena A. Barba Lorena A. Barba Rio Yokota Rio Yokota TreeSweeps.pdf figshare 2012 fmm treecode Computational Physics Applied Computer Science 2012-03-17 22:36:10 Dataset https://figshare.com/articles/dataset/TreeSweeps_pdf/91439 <p>Illustration of the components in a fast multipole method (FMM), with the upward sweep depicted on the left side of the tree, and the downward sweep depicted on the right side of the tree. In the FMM, multipole expansions are created at the leaf level of the tree (P2M operation), they are then translated upwards to the center of the parent cells in the multipole-to-multipole (M2M) translation, then transformed to a local expansion in the multipole-to-local (M2L) operation for the siblings at all levels deeper than level 1. The local expansions are translated downward to children cells in the local-to-local (L2L) operation and finally, the local expansions are added at the leaf level and evaluated in the local-to-particle (L2P) operation.</p> <p>This figure appeared in the following paper, under (c) 2011 The Authors.</p> <p>“A tuned and scalable fast multipole method as a preeminent algorithm for exascale systems”, Rio Yokota, L A Barba. Int. J. High-perf. Comput. (2011) Preprint arXiv:1106.2176 - doi:10.1177/1094342011429952</p> <p>The figure is here shared under CC-BY.</p>