A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions
A fast and numerically stable algorithm is described for computing the discrete Hankel transform of order 0 as well as evaluating Schlömilch and Fourier--Bessel expansions in O(N(log N)[superscript 2]/loglog N) operations. The algorithm is based on an asymptotic expansion for Bessel functions of lar...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Society for Industrial and Applied Mathematics
2015
|
| Online Access: | http://hdl.handle.net/1721.1/100550 |
| Summary: | A fast and numerically stable algorithm is described for computing the discrete Hankel transform of order 0 as well as evaluating Schlömilch and Fourier--Bessel expansions in O(N(log N)[superscript 2]/loglog N) 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. |
|---|