Search Results for ""
161 - 170 of 1542 for Fourier Series Sawtooth Wave_ 800Search Results
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, ...
An l_x table is a tabulation of numbers which is used to calculate life expectancies. x n_x d_x l_x q_x L_x T_x e_x 0 1000 200 1.00 0.20 0.90 2.70 2.70 1 800 100 0.80 0.12 ...
A discrete fast Fourier transform algorithm which can be implemented for N=2, 3, 4, 5, 7, 8, 11, 13, and 16 points.
The Wiener-Hopf method is a powerful technique which enables certain linear partial differential equations subject to boundary conditions on semi-infinite domains to be ...
The method of d'Alembert provides a solution to the one-dimensional wave equation (partial^2y)/(partialx^2)=1/(c^2)(partial^2y)/(partialt^2) (1) that models vibrations of a ...
The Cesàro means of a function f are the arithmetic means sigma_n=1/n(s_0+...+s_(n-1)), (1) n=1, 2, ..., where the addend s_k is the kth partial sum ...
Leakage, more explicitly called spectral leakage, is a smearing of power across a frequency spectrum that occurs when the signal being measured is not periodic in the sample ...
Let a piecewise smooth function f with only finitely many discontinuities (which are all jumps) be defined on [-pi,pi] with Fourier series a_k = 1/piint_(-pi)^pif(t)cos(kt)dt ...
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 ...
Let f(x) be integrable in [-1,1], let (1-x^2)f(x) be of bounded variation in [-1,1], let M^' denote the least upper bound of |f(x)(1-x^2)| in [-1,1], and let V^' denote the ...
...
View search results from all Wolfram sites (32406 matches)

