A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Communication Complexity of the Fast Multipole Method and its Algebraic Variants
2014
Supercomputing Frontiers and Innovations
A combination of hierarchical tree-like data structures and data access patterns from fast multipole methods and hierarchical low-rank approximation of linear operators from H-matrix methods appears to form an algorithmic path forward for efficient implementation of many linear algebraic operations of scientific computing at the exascale. The combination provides asymptotically optimal computational and communication complexity and applicability to large classes of operators that commonly arise
doi:10.14529/jsfi140104
fatcat:s4dd4w2bjzfhlmjpvjujsn7tfy