Search Results for ""

The transform inverting the sequence g(n)=sum_(d|n)f(d) (1) into f(n)=sum_(d|n)mu(d)g(n/d), (2) where the sums are over all possible integers d that divide n and mu(d) is the ...

The integral transform defined by (Kphi)(x)=int_0^inftyG_(pq)^(mn)(xt|(a_p); (b_q))phi(t)dt, where G_(pq)^(mn) is a Meijer G-function. Note the lower limit of 0, not -infty ...

For p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, (1) polynomial of degree n>=1, the Schur transform is defined by the (n-1)-degree polynomial Tp(z) = a^__0p(z)-a_np^*(z) (2) = ...

The structure factor S_Gamma of a discrete set Gamma is the Fourier transform of delta-scatterers of equal strengths on all points of Gamma, S_Gamma(k)=intsum_(x in ...

Any discrete finite wavelet transform can be represented as a matrix, and such a wavelet matrix can be computed in O(n) steps, compared to O(nlgn) for the Fourier matrix, ...

Let f(t) and g(t) be arbitrary functions of time t with Fourier transforms. Take f(t) = F_nu^(-1)[F(nu)](t)=int_(-infty)^inftyF(nu)e^(2piinut)dnu (1) g(t) = ...

Let phi(t) be the characteristic function, defined as the Fourier transform of the probability density function P(x) using Fourier transform parameters a=b=1, phi(t) = ...

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 Fourier transform is a generalization of the complex Fourier series in the limit as L->infty. Replace the discrete A_n with the continuous F(k)dk while letting n/L->k. ...

The even impulse pair is the Fourier transform of cos(pik), AdjustmentBox[I, BoxMargins -> {{0.13913, -0.13913}, {-0.5, 0.5}}]I(x)=1/2delta(x+1/2)+1/2delta(x-1/2). (1) It ...