Search Results for ""
141 - 150 of 841 for Weierstrass TransformSearch Results
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)
Expresses a function in terms of its Radon transform, f(x,y) = R^(-1)(Rf)(x,y) (1) = ...
Any discrete finite wavelet transform can be represented as a matrix, and such a wavelet matrix can be computed in O(n) steps, compared to O(nlgn) for the Fourier matrix, ...
Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...
Let omega_1 and omega_2 be periods of a doubly periodic function, with tau=omega_2/omega_1 the half-period ratio a number with I[tau]!=0. Then Klein's absolute invariant ...
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 structure factor S_Gamma of a discrete set Gamma is the Fourier transform of delta-scatterers of equal strengths on all points of Gamma, S_Gamma(k)=intsum_(x in ...
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 ...
Let phi(t) be the characteristic function, defined as the Fourier transform of the probability density function P(x) using Fourier transform parameters a=b=1, phi(t) = ...
...
View search results from all Wolfram sites (9777 matches)

