Fast evaluation of multiquadric RBF sums by a Cartesian treecode

DOI10.1137/090779851MaRDI QIDQ3116436zbMATH OpenOpenAlexFDO

Authors Robert Krasny, Lei Wang

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

fast summationLaurent seriesmultiquadric radial basis functionTaylor seriestreecode

Mathematics Subject Classification ID

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

Recommendations

• A fast treecode for multiquadric interpolation with varying shape parameters
• Fast multilevel evaluation of smooth radial basis function expansions
• Fast evaluation of radial basis functions. I
• A kernel independent fast multipole algorithm for radial basis functions
• Fast evaluation of radial basis functions: Methods for generalized multiquadrics in R^n

Cited in

(10)

• An O(N N) hierarchical random compression method for kernel matrices by sampling partial matrix entries
• A fast treecode for multiquadric interpolation with varying shape parameters
• 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
• 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
• RBF-vortex methods for the barotropic vorticity equation on a sphere
• The uselessness of the fast Gauss transform for summing Gaussian radial basis function series

This page was built for publication: Fast evaluation of multiquadric RBF sums by a Cartesian treecode

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3116436)