Mathematica 9 is now available
Services & Resources / Wolfram Forums
MathGroup Archive
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2006

[Date Index] [Thread Index] [Author Index]

Search the Archive

RE: 2D FT of f(r): Fast Hankel Transforms

  • To: mathgroup at
  • Subject: [mg64165] RE: [mg64157] 2D FT of f(r): Fast Hankel Transforms
  • From: "David Annetts" <davidannetts at>
  • Date: Fri, 3 Feb 2006 01:03:52 -0500 (EST)
  • Sender: owner-wri-mathgroup at


> Are Fast (or the so-called quasi-Fast) Hankel Transforms 
> implemented or implementable in Mathematica?
> Two-dimensional Fourier Transforms of functions f[r] where 
> r=Sqrt[x^2+y^2] are actually one-dimensional Hankel 
> Transforms of order zero. So I was wondering if one could use 
> somehow 1D FFTs to optimize 2D FTs of f[r].

You can implement them as a convolution with a digital filter.  Google for
various papers so you can derive coefficients, but one I'd recommend is
JOHANSEN, HK, AND SORENSEN, K. Fast Hankel transforms in Geophysical
Prospecting from a "fair while ago".



  • Prev by Date: Re: Trigonometric form of complex numbers
  • Next by Date: Re: t-test question
  • Previous by thread: 2D FT of f(r): Fast Hankel Transforms
  • Next by thread: Re: 2D FT of f(r): Fast Hankel Transforms