An Improved Fast Multipole Algorithm for Potential Fields on the Line

Authors:
Norman Yarvin;Vladimir Rokhlin
Affiliations:
-;-
Venue:
SIAM Journal on Numerical Analysis
Year:
1999

Citing 0
Cited 4

A kernel-independent adaptive fast multipole algorithm in two and three dimensions

Journal of Computational Physics
A wideband fast multipole method for the Helmholtz equation in three dimensions

Journal of Computational Physics
Fast algorithms for spherical harmonic expansions, II

Journal of Computational Physics
Multi-agent based simulations using fast multipole method: application to large scale simulations of flocking dynamical systems

Artificial Intelligence Review

Quantified Score

Hi-index	0.02

Visualization

Abstract

A new version of the fast multipole method (FMM) for the evaluation of potential fields on the line is introduced. It uses a new representation of potential fields, based on generalized Gaussian quadratures [J. Ma, V. Rokhlin, and S. Wandzura, SIAM J. Numer. Anal., 33 (1996), pp. 971--996; N. Yarvin and V. Rokhlin, SIAM J. Sci. Comput., 20 (1999), pp. 699--718]. In this representation, most translation operators are diagonal. To efficiently incorporate this representation into the FMM, an apparatus is introduced for transforming between different types of expansions. This apparatus is highly general and is based on formulae for the least squares approximation of linear operators. The performance of the method is illustrated with several numerical examples; it is roughly twice as fast as previously published algorithms.