TOPICS
Search

Search Results for ""


71 - 80 of 996 for Fast Fourier TransformSearch Results
The Legendre transform of a sequence {c_k} is the sequence {a_k} with terms given by a_n = sum_(k=0)^(n)(n; k)(n+k; k)c_k (1) = sum_(k=0)^(n)(2k; k)(n+k; n-k)c_k, (2) where ...
The integral transform defined by (Kphi)(x)=int_0^infty(x^2-t^2)_+^(lambda/2)P_nu^lambda(t/x)phi(t)dt, where y_+^alpha is the truncated power function and P_nu^lambda(x) is ...
The integral transform (Kf)(x)=int_0^infty((x-t)_+^(c-1))/(Gamma(c))_2F_1(a,b;c;1-t/x)f(t)dt, where Gamma(x) is the gamma function, _2F_1(a,b;c;z) is a hypergeometric ...
Consider a symmetric triangle wave T(x) of period 2L. Since the function is odd, a_0 = 0 (1) a_n = 0, (2) and b_n = (3) = (32)/(pi^2n^2)cos(1/4npi)sin^3(1/4npi) (4) = ...
The Radon inverse transform is an integral transform that has found widespread application in the reconstruction of images from medical CT scans. The Radon and inverse Radon ...
The W-transform of a function f(x) is defined by the integral where Gamma[(beta_m)+s, 1-(alpha_n)-s; (alpha_p^(n+1))+s, 1-(beta_q^(m+1))-s] =Gamma[beta_1+s, ..., beta_m+s, ...
The boustrophedon ("ox-plowing") transform b of a sequence a is given by b_n = sum_(k=0)^(n)(n; k)a_kE_(n-k) (1) a_n = sum_(k=0)^(n)(-1)^(n-k)(n; k)b_kE_(n-k) (2) for n>=0, ...
There are (at least) three types of Euler transforms (or transformations). The first is a set of transformations of hypergeometric functions, called Euler's hypergeometric ...
A two-dimensional generalization of the Haar transform which is used for the compression of astronomical images. The algorithm consists of dividing the 2^N×2^N image into ...
The transformation S[{a_n}_(n=0)^N] of a sequence {a_n}_(n=0)^N into a sequence {b_n}_(n=0)^N by the formula b_n=sum_(k=0)^NS(n,k)a_k, (1) where S(n,k) is a Stirling number ...
1 ... 5|6|7|8|9|10|11 ... 100 Previous Next

...