科研之友
微信
新浪微博
Facebook
分享链接
摘要
A fast and numerically stable algorithm is described for computing the discrete Hankel transform of order 0 as well as evaluating Schlomilch and Fourier-Bessel expansions in O(N(logN)(2)/loglogN) 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.
- 出版日期2015
- 单位MIT
