Answers are grounded in this paper and cite their sources.
An analytical form that provides a computationally efficient algorithm for numerical evaluation of the Hankel transform of nth order by fast-Fourier-transform techniques is presented and tested with some well-known functions.
No takes yet. Share an insight, caveat, or question.
Ferrari et al. (1999) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: