A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions

From MaRDI portal




Abstract: A fast and numerically stable algorithm is described for computing the discrete Hankel transform of order 0 as well as evaluating Schl"{o}milch and Fourier--Bessel expansions in mathcalO(N(logN)2/log!logN) operations. The algorithm is based on an asymptotic expansion for Bessel functions of large arguments, the fast Fourier transform, and the Neumann addition formula. All the algorithmic parameters are selected from error bounds to achieve a near-optimal computational cost for any accuracy goal. Numerical results demonstrate the efficiency of the resulting algorithm.





Describes a project that uses

Uses Software






This page was built for publication: A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions

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