Fast Evaluation of Multiquadric RBF Sums by a Cartesian Treecode

Abstract

Abstract.A treecode is presented for evaluating sums defined in terms of the multiquadric radial basis function (RBF), φ(x) = (|x| 2 + c 2 ) 1/2 , where x ∈ R 3 and c ≥ 0. Given a set of N nodes, evaluating an RBF sum directly requires CPU time that scales like O(N 2 ). For a given level of accuracy, the treecode reduces the CPU time to O(N log N ) using a far-field expansion of φ(x). We consider two options for the far-field expansion: (1) a Laurent series previously used in applications of the Fast Multipole Method to multiquadric RBFs, and (2) a certain Taylor series previously used in treecode particle simulations, but not yet in the context of multiquadric RBFs. It is known that the Laurent series converges when the RBF parameter c lies in an interval 0 ≤ c ≤c, wherec is proportional to the minimum node spacing, but here we show that the Taylor series converges uniformly for c ≥ 0. We implement the treecode in Cartesian coordinates and use a recurrence relation to compute the Taylor coefficients. Numerical results exhibit the treecode error, CPU time, and memory usage in two test cases, random nodes in a cube and on the surface of a sphere. The treecode approach presented here is applicable to generalized multiquadrics in any dimension.

Preconditioned Krylov Subspace Methods for Sampling Multivariate Gaussian Distributions

“…The Matérn covariance matrices are more ill-conditioned for larger values of ν. When using iterative methods which require multiplying a dense covariance matrix by a vector, there exist fast algorithms, faster than O(n 2 ), that do not involve explicitly forming the matrix, e.g., [20,25].…”

RBF-vortex methods for the barotropic vorticity equation on a sphere

“…Cost can also be greatly reduced by using fast multipole methods and treecodes such as [1,50,81] to sum the "far field" parts of RBF series. Unfortunately, treecodes are not accelerative for interactions between neighboring RBFs [15].…”

The uselessness of the Fast Gauss Transform for summing Gaussian radial basis function series

“…(A full list of symbols is given in Table 1.) Treecodes are similar but use a Taylor series as a proxy [33].…”