Fast Evaluation of Multiquadric RBF Sums by a Cartesian Treecode

DOI10.1137/090779851zbMath1232.65006OpenAlexW1989482487MaRDI QIDQ3116436

Lei Wang, Robert Krasny

Publication date: 23 February 2012

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090779851

zbMATH Keywords

Taylor seriesLaurent seriesfast summationtreecodemultiquadric radial basis function

Mathematics Subject Classification ID

Multidimensional problems (41A63) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58) Numerical summation of series (65B10)

Related Items (9)

The uselessness of the fast Gauss transform for summing Gaussian radial basis function series ⋮ Fast and scalable evaluation of pairwise potentials ⋮ Cyclically parallelized treecode for fast computations of electrostatic interactions on molecular surfaces ⋮ A hybrid stochastic interpolation and compression method for kernel matrices ⋮ An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries ⋮ A Treecode Algorithm for 3D Stokeslets and Stresslets ⋮ A Kernel-Independent Treecode for General Rotne-Prager-Yamakawa Tensor ⋮ A Kernel-Independent Treecode Based on Barycentric Lagrange Interpolation ⋮ RBF-vortex methods for the barotropic vorticity equation on a sphere

This page was built for publication: Fast Evaluation of Multiquadric RBF Sums by a Cartesian Treecode