Search Results for ""

A convex polyhedron is defined as the set of solutions to a system of linear inequalities mx<=b (i.e., a matrix inequality), where m is a real s×d matrix and b is a real ...

Given a complex Hilbert space H with associated space L(H) of continuous linear operators from H to itself, the bicommutant M^('') of an arbitrary subset M subset= L(H) is ...

An elliptic fixed point of a differential equation is a fixed point for which the stability matrix has purely imaginary eigenvalues lambda_+/-=+/-iomega (for omega>0). An ...

In real and functional analysis, equicontinuity is a concept which extends the notion of uniform continuity from a single function to collection of functions. Given ...

Given a linear code C, a generator matrix G of C is a matrix whose rows generate all the elements of C, i.e., if G=(g_1 g_2 ... g_k)^(T), then every codeword w of C can be ...

A branch of mathematics which encompasses many diverse areas of minimization and optimization. Optimization theory is the more modern term for operations research. ...

Let V be a real vector space (e.g., the real continuous functions C(I) on a closed interval I, two-dimensional Euclidean space R^2, the twice differentiable real functions ...

The ratio C of the largest to smallest singular value in the singular value decomposition of a matrix. The base-b logarithm of C is an estimate of how many base-b digits are ...

An axiom proposed by Huntington (1933) as part of his definition of a Boolean algebra, H(x,y)=!(!x v y) v !(!x v !y)=x, (1) where !x denotes NOT and x v y denotes OR. Taken ...

The quaternions are members of a noncommutative division algebra first invented by William Rowan Hamilton. The idea for quaternions occurred to him while he was walking along ...