Dual algorithms for fast calculation of the Fourier-Bessel transform
From MaRDI portal
Publication:3038578
DOI10.1109/TASSP.1981.1163658zbMath0525.65094MaRDI QIDQ3038578
Publication date: 1981
Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tassp.1981.1163658
asymptotic expansion; fast Fourier transform; Fourier-Bessel transform; dual algorithms; Fourier-selectionsummation method
65R10: Numerical methods for integral transforms
42A38: Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type
65T40: Numerical methods for trigonometric approximation and interpolation
Related Items
A stable algorithm for Hankel transforms using hybrid of Block-pulse and Legendre polynomials, Efficient algorithms to compute Hankel transforms using wavelets, Numerical evaluation of the Hankel transform by using linear Legendre multi-wavelets, A stable algorithm for numerical evaluation of Hankel transforms using Haar wavelets, An improved method for computing Hankel transform, Fast computation of zero order Hankel transform, A dual algorithm for fast calculation of the \(H^ 1_ 0\)-transform, Simultaneous calculation of Fourier-Bessel transforms up to order N, Numerical evaluation of the Hankel transform, Algorithms to numerically evaluate the Hankel transform, A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions
