Dual algorithms for fast calculation of the Fourier-Bessel transform

DOI10.1109/TASSP.1981.1163658zbMath0525.65094OpenAlexW2153975146MaRDI QIDQ3038578

Sebastien M. Candel

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

zbMATH Keywords

asymptotic expansionfast Fourier transformFourier-Bessel transformdual algorithmsFourier-selectionsummation method

Mathematics Subject Classification ID

Numerical methods for integral transforms (65R10) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items (11)

A dual algorithm for fast calculation of the \(H^ 1_ 0\)-transform ⋮ Algorithms to numerically evaluate the Hankel transform ⋮ A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions ⋮ A stable algorithm for Hankel transforms using hybrid of Block-pulse and Legendre polynomials ⋮ Simultaneous calculation of Fourier-Bessel transforms up to order N ⋮ A stable algorithm for numerical evaluation of Hankel transforms using Haar wavelets ⋮ Efficient algorithms to compute Hankel transforms using wavelets ⋮ Numerical evaluation of the Hankel transform by using linear Legendre multi-wavelets ⋮ Numerical evaluation of the Hankel transform ⋮ An improved method for computing Hankel transform ⋮ Fast computation of zero order Hankel transform

This page was built for publication: Dual algorithms for fast calculation of the Fourier-Bessel transform