Search Results for ""

The inverse transform sum_(n=1)^infty(a_nx^n)/(n!)=ln(1+sum_(n=1)^infty(b_nx^n)/(n!)) of the exponential transform ...

The Fourier transform of the constant function f(x)=1 is given by F_x[1](k) = int_(-infty)^inftye^(-2piikx)dx (1) = delta(k), (2) according to the definition of the delta ...

The Fourier transform of the Heaviside step function H(x) is given by F_x[H(x)](k) = int_(-infty)^inftye^(-2piikx)H(x)dx (1) = 1/2[delta(k)-i/(pik)], (2) where delta(k) is ...

A substitution which can be used to transform integrals involving square roots into a more tractable form. form substitution sqrt(x^2+a^2) x=asinhu sqrt(x^2-a^2) x=acoshu

The function K(alpha,t) in an integral or integral transform g(alpha)=int_a^bf(t)K(alpha,t)dt. Whittaker and Robinson (1967, p. 376) use the term nucleus for kernel.

The integral transform (Kf)(x)=Gamma(p)int_0^infty(x+t)^(-p)f(t)dt. Note the lower limit of 0, not -infty as implied in Samko et al. (1993, p. 23, eqn. 1.101).

A two-sided (doubly infinite) Z-Transform, Z^((2))[{a_n}_(n=-infty)^infty](z)=sum_(n=-infty)^infty(a_n)/(z^n) (Zwillinger 1996; Krantz 1999, p. 214). The bilateral transform ...

The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N^2 to 2NlgN, where lg is the ...

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) = ...

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 ...