Search Results for ""

A bijective map between two metric spaces that preserves distances, i.e., d(f(x),f(y))=d(x,y), where f is the map and d(a,b) is the distance function. Isometries are ...

The Hartley Transform is an integral transform which shares some features with the Fourier transform, but which, in the most common convention, multiplies the integral kernel ...

The continuous Fourier transform is defined as f(nu) = F_t[f(t)](nu) (1) = int_(-infty)^inftyf(t)e^(-2piinut)dt. (2) Now consider generalization to the case of a discrete ...

There are two sorts of transforms known as the fractional Fourier transform. The linear fractional Fourier transform is a discrete Fourier transform in which the exponent is ...

Simplemindedly, a number theoretic transform is a generalization of a fast Fourier transform obtained by replacing e^(-2piik/N) with an nth primitive root of unity. This ...

Cantellation, also known as (polyhedron) expansion (Stott 1910, not to be confused with general geometric expansion) is the process of radially displacing the edges or faces ...

Tetradics transform dyadics in much the same way that dyadics transform vectors. They are represented using Hebrew characters and have 81 components (Morse and Feshbach 1953, ...

The integral transform obtained by defining omega=-tan(1/2delta), (1) and writing H(omega)=R(omega)+iX(omega), (2) where R(omega) and X(omega) are a Hilbert transform pair as ...

The binomial transform takes the sequence a_0, a_1, a_2, ... to the sequence b_0, b_1, b_2, ... via the transformation b_n=sum_(k=0)^n(-1)^(n-k)(n; k)a_k. The inverse ...

The Bump-Ng theorem (and also the title of the paper in which it was proved) states that the zeros of the Mellin transform of Hermite functions have real part equal to 1/2.