Fast convolution with radial kernels at nonequispaced knots

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

Daniel Potts, A. Nieslony, Gabriele Drauschke

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

algorithmerror estimatesregularizationnumerical examplesfast Fourier transformradial basis functionfast multipole methodfast summationscattered data approximationfast Gauss transformnonequispaced knotsthinplate spline approximation

Mathematics Subject Classification ID

Related Items (20)

The uselessness of the fast Gauss transform for summing Gaussian radial basis function series ⋮ The GLT class as a generalized Fourier analysis and applications ⋮ Fast and exact projected convolution for non-equidistant grids ⋮ Non-uniform FFT for the finite element computation of the micromagnetic scalar potential ⋮ Faster fast evaluation of thin plate splines in two dimensions ⋮ 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 ⋮ Accelerating the calculation of dipolar interactions in particle based simulations with open boundary conditions by means of the P\(^{2}\)NFFT method ⋮ On certain (block) Toeplitz matrices related to radial functions ⋮ Spectral analysis and preconditioning techniques for radial basis function collocation matrices ⋮ Fast Gauss transforms with complex parameters using NFFTs ⋮ A Fourier Extension Based Numerical Integration Scheme for Fast and High-Order Approximation of Convolutions with Weakly Singular Kernels ⋮ Fast ewald summation based on NFFT with mixed periodicity ⋮ Fast discrete convolution in \(\mathbb{R}^2\) with radial kernels using non-uniform fast Fourier transform with nonequispaced frequencies ⋮ Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products ⋮ A High-Order, Analytically Divergence-Free Approximation Method for the Time-Dependent Stokes Problem ⋮ Adaptive cross-approximation for surface reconstruction using radial basis functions ⋮ The sparse cardinal sine decomposition and its application for fast numerical convolution ⋮ Consistency of variational continuous-domain quantization via kinetic theory ⋮ Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication

Uses Software

• FFTW
• NFFT
• NUFFT

Cites Work

• 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
• Matrix-free iterative solution strategies for large dense linear systems
• 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

This page was built for publication: Fast convolution with radial kernels at nonequispaced knots