Fast discrete convolution in \(\mathbb{R}^2\) with radial kernels using non-uniform fast Fourier transform with nonequispaced frequencies
From MaRDI portal
Publication:2287853
DOI10.1007/s11075-019-00670-5zbMath1431.65252OpenAlexW2919600450MaRDI QIDQ2287853
Publication date: 22 January 2020
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-019-00670-5
radial kernelnon-uniform fast Fourier transformefficient Bessel decompositionfast discrete convolution
Numerical methods for discrete and fast Fourier transforms (65T50) Approximate quadratures (41A55) Bessel and Airy functions, cylinder functions, ({}_0F_1) (33C10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The sparse cardinal sine decomposition and its application for fast numerical convolution
- Fixed-radius near neighbors search algorithms for points and segments
- Fixed-radius near neighbors search
- Scattering theory for the d'Alembert equation in exterior domains
- The complexity of finding fixed-radius near neighbors
- Rapid solution of integral equations of scattering theory in two dimensions
- Diagonal forms of translation operators for the Helmholtz equation in three dimensions
- The type 3 nonuniform FFT and its applications
- A fast adaptive multipole algorithm in three dimensions
- Fast convolution with radial kernels at nonequispaced knots
- Geometrical Structure of Laplacian Eigenfunctions
- Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
- Multidimensional binary search trees used for associative searching
- Fast Fourier Transforms for Nonequispaced Data
- Accelerating the Nonuniform Fast Fourier Transform
- An Algorithm for the Machine Calculation of Complex Fourier Series
This page was built for publication: Fast discrete convolution in \(\mathbb{R}^2\) with radial kernels using non-uniform fast Fourier transform with nonequispaced frequencies
