Search Results for ""

There are two types of functions known as Hankel functions. The more common one is a complex function (also called a Bessel function of the third kind, or Weber Function) ...

The Hankel functions of the first kind are defined as H_n^((1))(z)=J_n(z)+iY_n(z), (1) where J_n(z) is a Bessel function of the first kind and Y_n(z) is a Bessel function of ...

H_n^((2))(z)=J_n(z)-iY_n(z), (1) where J_n(z) is a Bessel function of the first kind and Y_n(z) is a Bessel function of the second kind. Hankel functions of the second kind ...

A square matrix with constant skew diagonals. In other words, a Hankel matrix is a matrix in which the (i,j)th entry depends only on the sum i+j. Such matrices are sometimes ...

The Hankel transform (of order zero) is an integral transform equivalent to a two-dimensional Fourier transform with a radially symmetric integral kernel and also called the ...

J_m(x)=(x^m)/(2^(m-1)sqrt(pi)Gamma(m+1/2))int_0^1cos(xt)(1-t^2)^(m-1/2)dt, where J_m(x) is a Bessel function of the first kind and Gamma(z) is the gamma function. Hankel's ...

The symbol defined by (v,n) = (2^(-2n){(4v^2-1)(4v^2-3^2)...[4v^2-(2n-1)^2]})/(n!) (1) = ((-1)^ncos(piv)Gamma(1/2+n-v)Gamma(1/2+n+v))/(pin!), (2) where Gamma(z) is the gamma ...

An apodization function, also called the Hann function, frequently used to reduce leakage in discrete Fourier transforms. The illustrations above show the Hanning function, ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...

J_n(z) = 1/(2pi)int_(-pi)^pie^(izcost)e^(in(t-pi/2))dt (1) = (i^(-n))/piint_0^pie^(izcost)cos(nt)dt (2) = 1/piint_0^picos(zsint-nt)dt (3) for n=0, 1, 2, ..., where J_n(z) is ...