Search Results for ""
491 - 500 of 1447 for Transformation MatrixSearch Results
Relaxation methods are methods of solving partial differential equations that involve splitting the sparse matrix that arises from finite differencing then iterating until a ...
A symmetric bilinear form on a vector space V is a bilinear function Q:V×V->R (1) which satisfies Q(v,w)=Q(w,v). For example, if A is a n×n symmetric matrix, then ...
The Bump-Ng theorem (and also the title of the paper in which it was proved) states that the zeros of the Mellin transform of Hermite functions have real part equal to 1/2.
If it is possible to transform a coordinate system to a form where the metric elements g_(munu) are constants independent of x^mu, then the space is flat.
The Fourier transform of the delta function is given by F_x[delta(x-x_0)](k) = int_(-infty)^inftydelta(x-x_0)e^(-2piikx)dx (1) = e^(-2piikx_0). (2)
F_x[1/pi(1/2Gamma)/((x-x_0)^2+(1/2Gamma)^2)](k)=e^(-2piikx_0-Gammapi|k|). This transform arises in the computation of the characteristic function of the Cauchy distribution.
Let Pi(x) be the rectangle function, then the Fourier transform is F_x[Pi(x)](k)=sinc(pik), where sinc(x) is the sinc function.
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 Hankel transform (of order zero) is an integral transform equivalent to a two-dimensional Fourier transform with a radially symmetric integral kernel and also called the ...
The isogonal transform of a geometric object is the object obtained by collectively taking the isogonal conjugates of all its points.
...
View search results from all Wolfram sites (21350 matches)

