Search Results for ""

Because the Legendre polynomials form a complete orthogonal system over the interval [-1,1] with respect to the weighting function w(x)=1, any function f(x) may be expanded ...

Let n>=0 and alpha_1, alpha_2, ...be the positive roots of J_n(x)=0, where J_n(z) is a Bessel function of the first kind. An expansion of a function in the interval (0,1) in ...

For any real alpha and beta such that beta>alpha, let p(alpha)!=0 and p(beta)!=0 be real polynomials of degree n, and v(x) denote the number of sign changes in the sequence ...

The inverse of the Laplace transform F(t) = L^(-1)[f(s)] (1) = 1/(2pii)int_(gamma-iinfty)^(gamma+iinfty)e^(st)f(s)ds (2) f(s) = L[F(t)] (3) = int_0^inftyF(t)e^(-st)dt. (4)

F_x[1/pi(1/2Gamma)/((x-x_0)^2+(1/2Gamma)^2)](k)=e^(-2piikx_0-Gammapi|k|). This transform arises in the computation of the characteristic function of the Cauchy distribution.

A test for the convergence of Fourier series. Let phi_x(t)=f(x+t)+f(x-t)-2f(x), then if int_0^pi(|phi_x(t)|dt)/t is finite, the Fourier series converges to f(x) at x.

A transform which localizes a function both in space and scaling and has some desirable properties compared to the Fourier transform. The transform is based on a wavelet ...

The Gibbs phenomenon is an overshoot (or "ringing") of Fourier series and other eigenfunction series occurring at simple discontinuities. It can be reduced with the Lanczos ...

A fast Fourier transform-like algorithm which produces a hologram of an image.

The important property of Fourier transforms that F_x[cos(2pik_0x)f(x)](k) can be expressed in terms of F[f(x)]=F(k) as follows, ...