Search Results for ""
161 - 170 of 13135 for Discrete Fourier TransformSearch Results
Expresses a function in terms of its Radon transform, f(x,y) = R^(-1)(Rf)(x,y) (1) = ...
In music, if a note has frequency f, integer multiples of that frequency, 2f,3f,4f and so on, are known as harmonics. As a result, the mathematical study of overlapping waves ...
Writing a Fourier series as f(theta)=1/2a_0+sum_(n=1)^(m-1)sinc((npi)/(2m))[a_ncos(ntheta)+b_nsin(ntheta)], where m is the last term, reduces the Gibbs phenomenon. The ...
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 ...
A prime partition of a positive integer n>=2 is a set of primes p_i which sum to n. For example, there are three prime partitions of 7 since 7=7=2+5=2+2+3. The number of ...
A group of linear fractional transformations which transform the arguments of Kummer solutions to the hypergeometric differential equation into each other. Define A(z) = 1-z ...
If there are two functions F_1(t) and F_2(t) with the same integral transform T[F_1(t)]=T[F_2(t)]=f(s), (1) then a null function can be defined by delta_0(t)=F_1(t)-F_2(t) ...
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 ...
Jackson's theorem is a statement about the error E_n(f) of the best uniform approximation to a real function f(x) on [-1,1] by real polynomials of degree at most n. Let f(x) ...
A Fourier series-like expansion of a twice continuously differentiable function f(x)=1/2a_0+sum_(n=1)^inftya_nJ_0(nx) (1) for 0<x<pi, where J_0(x) is a zeroth order Bessel ...
...
View search results from all Wolfram sites (26622 matches)

