Fast computation of zero order Hankel transform
type: Item
instance of: scholarly article
title: Fast computation of zero order Hankel transform
zbMATH Open document ID: 0571.65109
DOI: 10.1016/0016-0032(83)90098-4
author: B. George
published in: Journal of the Franklin Institute
publication date: 1983-01-01T00:00:00Z
review text: An algorithm for numerical evaluation of zero order Hankel transform is developed. The method involves one FFT evaluation and a summation of the interpolated FFT components. It compares favorably with other available techniques with regard to speed, accuracy, and ease of usage.
Mathematics Subject Classification ID: 65R10
Mathematics Subject Classification ID: 44A15
zbMATH DE Number: 3911664
zbMATH Keywords: fast computation
zbMATH Keywords: fast Fourier transform
zbMATH Keywords: numerical examples
zbMATH Keywords: zero order Hankel transform
zbMATH Keywords: FFT evaluation
MaRDI profile type: Publication
full work available at URL: 0016-0032(83)90098-4
OpenAlex ID: W2095351459
cites work: Q3280242
cites work: Computation of the Hankel transform using projections
cites work: Numerical evaluation of Hankel transforms via Gaussian-Laguerre polynomial expansions
cites work: Numerical Fourier and Bessel transforms in logarithmic variables
cites work: Dual algorithms for fast calculation of the Fourier-Bessel transform
description: scientific article; zbMATH DE number 3911664