Communication Complexity of the Fast Multipole. Method and its Algebraic Variants ... • We have proved a new upper bound for the communication complexity of FMM !

Jun 8, 2014 · The combination provides asymptotically optimal computational and communication complexity and applicability to large classes of operators that ...

Sep 18, 2014 · We present a new communication complexity estimate for fast multipole methods on such architectures. We also show how the data structures and ...

Many parallelization techniques that have been de- veloped for the FMM can be applied to its algebraic variant. The matrix-free nature of FMM and the larger ...

We present a new communication complexity estimate for fast multipole methods on such architectures. We also show how the data structures and access patterns of ...

This work describes implementation aspects of a hybrid of these two compelling hierarchical algorithms on hierarchical distributed-shared memory ...

Communication Complexity of the Fast Multipole Method andits Algebraic VariantsRio Yokota1, George Turkiyyah1, David Keyes1A combination of hierarchical ...

Dive into the research topics of 'Communication complexity of the fast multipole method and its algebraic variants'. Together they form a unique fingerprint.

We present a new communication complexity estimate for fast multipole methods on such architectures. We also show how the data structures and access patterns of ...

Communication Complexity of the Fast Multipole Method and its Algebraic Variants. R. Yokota, G. Turkiyyah, and D. Keyes. Supercomput. Front.