A kernel-independent treecode based on barycentric Lagrange interpolation

Abstract

A kernel-independent treecode (KITC) is presented for fast summation of particle interactions. The method employs barycentric Lagrange interpolation at Chebyshev points to approximate well-separated particle-cluster interactions. The KITC requires only kernel evaluations, is suitable for non-oscillatory kernels, and it utilizes a scale-invariance property of barycentric Lagrange interpolation. For a given level of accuracy, the treecode reduces the operation count for pairwise interactions from $O(N^2)$ to $O(N\log N)$, where $N$ is the number of particles in the system. The algorithm is demonstrated for systems of regularized Stokeslets and rotlets in 3D, and numerical results show the treecode performance in terms of error, CPU time, and memory consumption. The KITC is a relatively simple algorithm with low memory consumption, and this enables a straightforward OpenMP parallelization.

20 pages, 5 figures

References in corpus (1)

• Regularized Single and Double Layer Integrals in 3D Stokes Flow

Cited by in corpus (6)

• Fast Multipole Method For 3-D Helmholtz Equation In Layered Media
• A GPU-Accelerated Fast Summation Method Based on Barycentric Lagrange Interpolation and Dual Tree Traversal
• Fast Multipole Method for 3-D Linearized Poisson-Boltzmann Equation in Layered Media
• A domain decomposition solution of the Stokes-Darcy system in 3D based on boundary integrals
• Treecode-accelerated Green Iteration for Kohn-Sham Density Functional Theory
• Relativistic Space-Charge Field Calculation by Interpolation-Based Treecode