Dual algorithms for fast calculation of the Fourier-Bessel transform

DOI10.1109/TASSP.1981.1163658MaRDI QIDQ3038578zbMATH OpenOpenAlexFDO

Authors 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 expansiondual algorithmsfast Fourier transformFourier-Bessel transformFourier-selectionsummation method

Mathematics Subject Classification ID

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

Cited in

(12)

• 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
• A stable algorithm for Hankel transforms using hybrid of Block-pulse and Legendre polynomials
• A sinc rule for the Hankel transform
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3038578)