TOPICS
Search

Search Results for ""


71 - 80 of 928 for Fourier TransformSearch Results
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 discrete Fourier transform of length N (where N is even) can be rewritten as the sum of two discrete Fourier transforms, each of length N/2. One is formed from the ...
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 ...
The transformation of a sequence a_1, a_2, ... with a_n=sum_(d|n)b_d (1) into the sequence b_1, b_2, ... via the Möbius inversion formula, b_n=sum_(d|n)mu(n/d)a_d. (2) The ...
1 ... 5|6|7|8|9|10|11 ... 93 Previous Next

...