TOPICS
Search

Search Results for ""


191 - 200 of 1556 for Fourier Cosine SeriesSearch Results
Let F(nu) and G(nu) be the Fourier transforms of f(t) and g(t), respectively. Then int_(-infty)^inftyf(t)g^_(t)dt ...
F_k[P_N(k)](x)=F_k[exp(-N|k|^beta)](x), where F is the Fourier transform of the probability P_N(k) for N-step addition of random variables. Lévy showed that beta in (0,2) for ...
A convolution is an integral that expresses the amount of overlap of one function g as it is shifted over another function f. It therefore "blends" one function with another. ...
The Gelfand transform x|->x^^ is defined as follows. If phi:B->C is linear and multiplicative in the senses phi(ax+by)=aphi(x)+bphi(y) and phi(xy)=phi(x)phi(y), where B is a ...
The cylinder function is defined as C(x,y)={1 for sqrt(x^2+y^2)<=a; 0 for sqrt(x^2+y^2)>a. (1) The Bessel functions are sometimes also called cylinder functions. To find the ...
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 ...
A constant function is function f(x)=c whose value does not change as its parameters vary. The function graph of a one-dimensional constant function is a straight line. The ...
In 1979, Conway and Norton discovered an unexpected intimate connection between the monster group M and the j-function. The Fourier expansion of j(tau) is given by (1) (OEIS ...
The ramp function is defined by R(x) = xH(x) (1) = int_(-infty)^xH(x^')dx^' (2) = int_(-infty)^inftyH(x^')H(x-x^')dx^' (3) = H(x)*H(x), (4) where H(x) is the Heaviside step ...
A method to obtain a signal C_l(z) with a flat spectrum c(theta;z) (such as a pulse), but having a smaller amplitude than the pulse. ...
1 ... 17|18|19|20|21|22|23 ... 156 Previous Next

...