Search Results for ""

A quadrature (numerical integration) algorithm which has a number of desirable properties.

A deconvolution algorithm (sometimes abbreviated MEM) which functions by minimizing a smoothness function ("entropy") in an image. Maximum entropy is also called the ...

Presburger arithmetic is the first-order theory of the natural numbers containing addition but no multiplication. It is therefore not as powerful as Peano arithmetic. ...

The Coxeter graph is a nonhamiltonian cubic symmetric graph on 28 vertices and 42 edges which can be constructed as illustrated above. It can also be constructed as the graph ...

A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...

An operator A^~ is said to be antiunitary if it satisfies: <A^~f_1|A^~f_2> = <f_1|f_2>^_ (1) A^~[f_1(x)+f_2(x)] = A^~f_1(x)+A^~f_2(x) (2) A^~cf(x) = c^_A^~f(x), (3) where ...

If the parameters of a Lie group vary over a closed interval, them the Lie group is said to be compact. Every representation of a compact group is equivalent to a unitary ...

The Heisenberg group H^n in n complex variables is the group of all (z,t) with z in C^n and t in R having multiplication (w,t)(z,t^')=(w+z,t+t^'+I[w^*z]) (1) where w^* is the ...

Let pi be a unitary representation of a group G on a separable Hilbert space, and let R(pi) be the smallest weakly closed algebra of bounded linear operators containing all ...

The projective general linear group PGL_n(q) is the group obtained from the general linear group GL_n(q) on factoring by the scalar matrices contained in that group.