Search Results for ""

Consider a string of length 2L plucked at the right end and fixed at the left. The functional form of this configuration is f(x)=x/(2L). (1) The components of the Fourier ...

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

A series is an infinite ordered set of terms combined together by the addition operator. The term "infinite series" is sometimes used to emphasize the fact that series ...

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

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 so-called generalized Fourier integral is a pair of integrals--a "lower Fourier integral" and an "upper Fourier integral"--which allow certain complex-valued functions f ...

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

There are two sorts of transforms known as the fractional Fourier transform. The linear fractional Fourier transform is a discrete Fourier transform in which the exponent is ...

The Fourier cosine transform of a real function is the real part of the full complex Fourier transform, F_x^((c))[f(x)](k) = R[F_x[f(x)](k)] (1) = ...

The Fourier sine transform is the imaginary part of the full complex Fourier transform, F_x^((s))[f(x)](k) = I[F_x[f(x)](k)] (1) = int_(-infty)^inftysin(2pikx)f(x)dx. (2) The ...