Fast Multipole Method, Tree-Code and Related Approximate Algorithms.
Trading Exactness for Efficiency.

CSIC Building (#406), Seminar Room 4122.
Directions: home.cscamm.umd.edu/directions

Fast Multipole: It's All About Adding Functions in Finite Precision

Dr. Alan Edelman

MIT

Abstract:   We present the fast multipole method as a variant of the parallel prefix algorithm where the summands are functions, not numbers. We then "round" using an approximation algorithm. This line of thinking suggests that non-tree algorithms can also be suitable. Joint work with Per-Olof Persson.

[LECTURE SLIDES]