TOPICS
Search

Search Results for ""


31 - 40 of 996 for Fast Fourier TransformSearch Results
The Gelfand transform x|->x^^ is defined as follows. If phi:B->C is linear and multiplicative in the senses phi(ax+by)=aphi(x)+bphi(y) and phi(xy)=phi(x)phi(y), where B is a ...
A Fourier series is an expansion of a periodic function f(x) in terms of an infinite sum of sines and cosines. Fourier series make use of the orthogonality relationships of ...
A general integral transform is defined by g(alpha)=int_a^bf(t)K(alpha,t)dt, where K(alpha,t) is called the integral kernel of the transform.
The so-called generalized Fourier integral is a pair of integrals--a "lower Fourier integral" and an "upper Fourier integral"--which allow certain complex-valued functions f ...
The (unilateral) Z-transform of a sequence {a_k}_(k=0)^infty is defined as Z[{a_k}_(k=0)^infty](z)=sum_(k=0)^infty(a_k)/(z^k). (1) This definition is implemented in the ...
The (unilateral) Z-transform of a sequence {a_k}_(k=0)^infty is defined as Z[{a_k}_(k=0)^infty](z)=sum_(k=0)^infty(a_k)/(z^k). (1) This definition is implemented in the ...
A Fourier series in which there are large gaps between nonzero terms a_n or b_n.
If f(x) is an even function, then b_n=0 and the Fourier series collapses to f(x)=1/2a_0+sum_(n=1)^inftya_ncos(nx), (1) where a_0 = 1/piint_(-pi)^pif(x)dx (2) = ...
If f(x) is an odd function, then a_n=0 and the Fourier series collapses to f(x)=sum_(n=1)^inftyb_nsin(nx), (1) where b_n = 1/piint_(-pi)^pif(x)sin(nx)dx (2) = ...
The Hilbert transform (and its inverse) are the integral transform g(y) = H[f(x)]=1/piPVint_(-infty)^infty(f(x)dx)/(x-y) (1) f(x) = ...
1|2|3|4|5|6|7 ... 100 Previous Next

...