Hankel transform

From Wikipedia, the free encyclopedia
(Redirected from Fourier-Bessel transform)
Jump to navigation Jump to search

Template:Short description Script error: No such module "Distinguish".

In mathematics, the Hankel transform expresses any given function f(r) as the weighted sum of an infinite number of Bessel functions of the first kind Template:Math. The Bessel functions in the sum are all of the same order ν, but differ in a scaling factor k along the r axis. The necessary coefficient Template:Math of each Bessel function in the sum, as a function of the scaling factor k constitutes the transformed function. The Hankel transform is an integral transform and was first developed by the mathematician Hermann Hankel. It is also known as the Fourier–Bessel transform. Just as the Fourier transform for an infinite interval is related to the Fourier series over a finite interval, so the Hankel transform over an infinite interval is related to the Fourier–Bessel series over a finite interval.

Definition

The Hankel transform of order ν of a function f(r) is given by

Fν(k)=0f(r)Jν(kr)rdr,

where Jν is the Bessel function of the first kind of order ν with ν1/2. The inverse Hankel transform of Template:Math is defined as

f(r)=0Fν(k)Jν(kr)kdk,

which can be readily verified using the orthogonality relationship described below.

Domain of definition

Inverting a Hankel transform of a function f(r) is valid at every point at which f(r) is continuous, provided that the function is defined in (0, ∞), is piecewise continuous and of bounded variation in every finite subinterval in (0, ∞), and

0|f(r)|r12dr<.

However, like the Fourier transform, the domain can be extended by a density argument to include some functions whose above integral is not finite, for example f(r)=(1+r)3/2.

Alternative definition

An alternative definition says that the Hankel transform of g(r) is[1]

hν(k)=0g(r)Jν(kr)krdr.

The two definitions are related:

If g(r)=f(r)r, then hν(k)=Fν(k)k.

This means that, as with the previous definition, the Hankel transform defined this way is also its own inverse:

g(r)=0hν(k)Jν(kr)krdk.

The obvious domain now has the condition

0|g(r)|dr<,

but this can be extended. According to the reference given above, we can take the integral as the limit as the upper limit goes to infinity (an improper integral rather than a Lebesgue integral), and in this way the Hankel transform and its inverse work for all functions in L2(0, ∞).

Transforming Laplace's equation

The Hankel transform can be used to transform and solve Laplace's equation expressed in cylindrical coordinates. Under the Hankel transform, the Bessel operator becomes a multiplication by k2.[2] In the axisymmetric case, the partial differential equation is transformed as

0{2ur2+1rur+2uz2}=k2U+2z2U,

where U=0u. Therefore, the Laplacian in cylindrical coordinates becomes an ordinary differential equation in the transformed function U.

Orthogonality

The Bessel functions form an orthogonal basis with respect to the weighting factor r:[3]

0Jν(kr)Jν(kr)rdr=δ(kk)k,k,k>0.

The Plancherel theorem and Parseval's theorem

If f(r) and g(r) are such that their Hankel transforms Template:Math and Template:Math are well defined, then the Plancherel theorem states

0f(r)g(r)rdr=0Fν(k)Gν(k)kdk.

Parseval's theorem, which states

0|f(r)|2rdr=0|Fν(k)|2kdk,

is a special case of the Plancherel theorem. These theorems can be proven using the orthogonality property.

Relation to the multidimensional Fourier transform

The Hankel transform appears when one writes the multidimensional Fourier transform in hyperspherical coordinates, which is the reason why the Hankel transform often appears in physical problems with cylindrical or spherical symmetry.

Consider a function f(𝐫) of a d-dimensional vector Template:Math. Its d-dimensional Fourier transform is defined asF(𝐤)=df(𝐫)ei𝐤𝐫d𝐫.To rewrite it in hyperspherical coordinates, we can use the decomposition of a plane wave into d-dimensional hyperspherical harmonics Yl,m:[4]ei𝐤𝐫=(2π)d/2(kr)1d/2l=0+(i)lJd/21+l(kr)mYl,m(Ω𝐤)Yl,m*(Ω𝐫),where Ω𝐫 and Ω𝐤 are the sets of all hyperspherical angles in the 𝐫-space and 𝐤-space. This gives the following expression for the d-dimensional Fourier transform in hyperspherical coordinates:F(𝐤)=(2π)d/2k1d/2l=0+(i)lmYl,m(Ω𝐤)0+Jd/21+l(kr)rd/2drf(𝐫)Yl,m*(Ω𝐫)dΩ𝐫.If we expand f(𝐫) and F(𝐤) in hyperspherical harmonics:f(𝐫)=l=0+mfl,m(r)Yl,m(Ω𝐫),F(𝐤)=l=0+mFl,m(k)Yl,m(Ω𝐤),the Fourier transform in hyperspherical coordinates simplifies tokd/21Fl,m(k)=(2π)d/2(i)l0+rd/21fl,m(r)Jd/21+l(kr)rdr.This means that functions with angular dependence in form of a hyperspherical harmonic retain it upon the multidimensional Fourier transform, while the radial part undergoes the Hankel transform (up to some extra factors like rd/21).

Special cases

Fourier transform in two dimensions

If a two-dimensional function Template:Math is expanded in a multipole series,

f(r,θ)=m=fm(r)eimθ𝐫,

then its two-dimensional Fourier transform is given byF(𝐤)=2πmimeimθ𝐤Fm(k),whereFm(k)=0fm(r)Jm(kr)rdris the m-th order Hankel transform of fm(r) (in this case m plays the role of the angular momentum, which was denoted by l in the previous section).

Fourier transform in three dimensions

If a three-dimensional function Template:Math is expanded in a multipole series over spherical harmonics,

f(r,θ𝐫,φ𝐫)=l=0+m=l+lfl,m(r)Yl,m(θ𝐫,φ𝐫),

then its three-dimensional Fourier transform is given byF(k,θ𝐤,φ𝐤)=(2π)3/2l=0+(i)lm=l+lFl,m(k)Yl,m(θ𝐤,φ𝐤),wherekFl,m(k)=0+rfl,m(r)Jl+1/2(kr)rdr.is the Hankel transform of rfl,m(r) of order (l+1/2).

This kind of Hankel transform of half-integer order is also known as the spherical Bessel transform.

Fourier transform in Template:Math dimensions (radially symmetric case)

If a Template:Math-dimensional function Template:Math does not depend on angular coordinates, then its Template:Math-dimensional Fourier transform Template:Math also does not depend on angular coordinates and is given by[5]kd/21F(k)=(2π)d/20+rd/21f(r)Jd/21(kr)rdr.which is the Hankel transform of rd/21f(r) of order (d/21) up to a factor of (2π)d/2.

2D functions inside a limited radius

If a two-dimensional function Template:Math is expanded in a multipole series and the expansion coefficients Template:Math are sufficiently smooth near the origin and zero outside a radius Template:Mvar, the radial part Template:Math may be expanded into a power series of Template:Math:

fm(r)=rmt0fm,t(1(rR)2)t,0rR,

such that the two-dimensional Fourier transform of Template:Math becomes

F(𝐤)=2πmimeimθktfm,t0Rrm(1(rR)2)tJm(kr)rdr=2πmimeimθkRm+2tfm,t01xm+1(1x2)tJm(kxR)dx(x=rR)=2πmimeimθkRm+2tfm,tt!2t(kR)1+tJm+t+1(kR),

where the last equality follows from §6.567.1 of.[6] The expansion coefficients Template:Math are accessible with discrete Fourier transform techniques:[7] if the radial distance is scaled with

r/Rsinθ,1(r/R)2=cos2θ,

the Fourier-Chebyshev series coefficients Template:Math emerge as

f(r)rmjgm,jcos(jθ)=rmjgm,jTj(cosθ).

Using the re-expansion

cos(jθ)=2j1cosjθj12j3cosj2θ+j2(j31)2j5cosj4θj3(j42)2j7cosj6θ+

yields Template:Math expressed as sums of Template:Math.

This is one flavor of fast Hankel transform techniques.

Relation to the Fourier and Abel transforms

The Hankel transform is one member of the FHA cycle of integral operators. In two dimensions, if we define Template:Mvar as the Abel transform operator, Template:Mvar as the Fourier transform operator, and Template:Mvar as the zeroth-order Hankel transform operator, then the special case of the projection-slice theorem for circularly symmetric functions states that

FA=H.

In other words, applying the Abel transform to a 1-dimensional function and then applying the Fourier transform to that result is the same as applying the Hankel transform to that function. This concept can be extended to higher dimensions.

Numerical evaluation

A simple and efficient approach to the numerical evaluation of the Hankel transform is based on the observation that it can be cast in the form of a convolution by a logarithmic change of variables[8] r=r0eρ,k=k0eκ. In these new variables, the Hankel transform reads F~ν(κ)=f~(ρ)J~ν(κρ)dρ, where f~(ρ)=(r0eρ)1nf(r0eρ), F~ν(κ)=(k0eκ)1+nFν(k0eκ), J~ν(κρ)=(k0r0eκρ)1+nJν(k0r0eκρ).

Now the integral can be calculated numerically with O(NlogN) complexity using fast Fourier transform. The algorithm can be further simplified by using a known analytical expression for the Fourier transform of J~ν:[9] +J~ν(x)eiqxdx=Γ(ν+1+niq2)Γ(ν+1n+iq2)2niqeiqln(k0r0). The optimal choice of parameters r0,k0,n depends on the properties of f(r), in particular its asymptotic behavior at r0 and r.

This algorithm is known as the "quasi-fast Hankel transform", or simply "fast Hankel transform".

Since it is based on fast Fourier transform in logarithmic variables, f(r) has to be defined on a logarithmic grid. For functions defined on a uniform grid, a number of other algorithms exist, including straightforward quadrature, methods based on the projection-slice theorem, and methods using the asymptotic expansion of Bessel functions.[10]

Some Hankel transform pairs

[11]

f(r) F0(k)
1 δ(k)k
1r 1k
r 1k3
r3 9k5
rm 2m+1Γ(m2+1)km+2Γ(m2),2<R{m}<12
1r2+z2 ek|z|k
1z2+r2 K0(kz),z
eiarr ia2k2,a>0,k<a
1k2a2,a>0,k>a
e12a2r2 1a2ek22a2
1rJ0(lr)esr 2π(k+l)2+s2K(4kl(k+l)2+s2)
r2f(r) d2F0dk2+1kdF0dk
f(r) Fν(k)
rs 2s+1ks+2Γ(12(2+ν+s))Γ(12(νs))
rν2sΓ(s,r2h) 12(k2)2sν2γ(1s+ν,k24h)
er2rνU(a,b,r2) Γ(2+νb)2Γ(2+νb+a)(k2)νek241F1(a,2+ab+ν,k24)
rnJμ(lr)esr Expressable in terms of elliptic integrals.[12]
r2f(r) d2Fνdk2+1kdFνdkν2k2Fν

Template:Math is a modified Bessel function of the second kind. Template:Math is the complete elliptic integral of the first kind.

The expression

d2F0dk2+1kdF0dk

coincides with the expression for the Laplace operator in polar coordinates Template:Math applied to a spherically symmetric function Template:Math

The Hankel transform of Zernike polynomials are essentially Bessel Functions (Noll 1976):

Rnm(r)=(1)nm20Jn+1(k)Jm(kr)dk

for even Template:Math.

See also

References

Template:Reflist Template:Div col

  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".

Template:Div col end Template:Authority control

  1. Script error: No such module "citation/CS1".
  2. Script error: No such module "citation/CS1".
  3. Script error: No such module "Citation/CS1".
  4. Script error: No such module "citation/CS1".
  5. Script error: No such module "citation/CS1".
  6. Script error: No such module "citation/CS1".
  7. Script error: No such module "Citation/CS1".
  8. Script error: No such module "Citation/CS1".
  9. Script error: No such module "Citation/CS1".
  10. Script error: No such module "Citation/CS1".
  11. Script error: No such module "citation/CS1".
  12. Script error: No such module "Citation/CS1".