Fast convolution with radial kernels at nonequispaced knots

DOI10.1007/s00211-004-0538-5zbMath1056.65146MaRDI QIDQ1882396

Daniel Potts, Gabriele Drauschke, A. Nieslony

Publication date: 1 October 2004

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-004-0538-5

zbMATH Keywords

algorithm; error estimates; regularization; numerical examples; fast Fourier transform; radial basis function; fast multipole method; fast summation; scattered data approximation; fast Gauss transform; nonequispaced knots; thinplate spline approximation

Mathematics Subject Classification ID

65T50: Numerical methods for discrete and fast Fourier transforms

65T40: Numerical methods for trigonometric approximation and interpolation

Related Items

Spectral analysis and preconditioning techniques for radial basis function collocation matrices, Fast Gauss transforms with complex parameters using NFFTs, Faster fast evaluation of thin plate splines in two dimensions, The uselessness of the fast Gauss transform for summing Gaussian radial basis function series, The GLT class as a generalized Fourier analysis and applications, Adaptive cross-approximation for surface reconstruction using radial basis functions, A discrete adapted hierarchical basis solver for radial basis function interpolation, Computing the survival probability density function in jump-diffusion models: a new approach based on radial basis functions, On certain (block) Toeplitz matrices related to radial functions, Fast and exact projected convolution for non-equidistant grids, Consistency of variational continuous-domain quantization via kinetic theory

Uses Software

• FFTW
• NFFT
• NUFFT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the fast matrix multiplication in the boundary element method by panel clustering
• A new version of the fast Gauss transform
• Mosaic-skeleton approximations
• A note on fast Fourier transforms for nonequispaced grids
• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• A fast algorithm for filtering and wavelet decomposition on the sphere
• Spectral approximation of the free-space heat kernel
• On the fast Fourier transform of functions with singularities
• A Matrix Version of the Fast Multipole Method
• Fast Evaluation of Radial Basis Functions: Methods for Generalized Multiquadrics in $\RR^\protectn$
• Application of the Fast Gauss Transform to Option Pricing
• An Improved Fast Multipole Algorithm for Potential Fields on the Line
• Fast Fourier Transforms for Nonequispaced Data
• Fast evaluation of radial basis functions: methods for two-dimensional polyharmonic splines
• Fast Evaluation of Radial Basis Functions: Moment-Based Methods
• Fast Summation at Nonequispaced Knots by NFFT
• The Fast Gauss Transform
• A fast algorithm for particle simulations