2012-03-17T22:37:17Z (GMT) by Rio Yokota Lorena A. Barba
<p>Diagram illustrating the algorithmic flow of the fast multipole method, FMM, showing all the operations (kernels) required: P2M is the transformation of points to multipole expansions (point-to-multipole); M2M is the translation of multipole expansions from a deep level in the tree to parent levels (multipole-to-multipole); M2L is the transformation of multipole expansions (valid far from an evaluation point) to local expansions (valid nearby an evaluation point); L2L is the translation of local expansions down the tree; L2P is the evaluation of local expansions at evaluation points.</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>