Fast computation of zero order Hankel transform

DOI10.1016/0016-0032(83)90098-4zbMath0571.65109OpenAlexW2095351459MaRDI QIDQ1061472

B. George

Publication date: 1983

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(83)90098-4

zbMATH Keywords

numerical examplesfast Fourier transformfast computationFFT evaluationzero order Hankel transform

Mathematics Subject Classification ID

Special integral transforms (Legendre, Hilbert, etc.) (44A15) Numerical methods for integral transforms (65R10)

Related Items (2)

Algorithms to numerically evaluate the Hankel transform ⋮ A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions

Cites Work

• Numerical Fourier and Bessel transforms in logarithmic variables
• Dual algorithms for fast calculation of the Fourier-Bessel transform
• Numerical evaluation of Hankel transforms via Gaussian-Laguerre polynomial expansions
• Computation of the Hankel transform using projections
• Unnamed Item

This page was built for publication: Fast computation of zero order Hankel transform