Search Results for ""

Let a particle travel a distance s(t) as a function of time t (here, s can be thought of as the arc length of the curve traced out by the particle). The speed (the scalar ...

An angle bracket is the combination of a bra and ket (bra+ket = bracket) which represents the inner product of two functions or vectors (or 1-forms), <f|g>=intf(x)g^|(x)dx in ...

A complete metric space is a metric space in which every Cauchy sequence is convergent. Examples include the real numbers with the usual metric, the complex numbers, ...

A standard form of the linear programming problem of maximizing a linear function over a convex polyhedron is to maximize c·x subject to mx<=b and x>=0, where m is a given ...

An extreme point of a subset K of a vector space X is an extreme set S of K which consists of a single point x in K. The collection of all extreme points of K is sometimes ...

The Kuhn-Tucker theorem is a theorem in nonlinear programming which states that if a regularity condition holds and f and the functions h_j are convex, then a solution ...

A module homomorphism is a map f:M->N between modules over a ring R which preserves both the addition and the multiplication by scalars. In symbols this means that ...

Let A be a finite-dimensional power-associative algebra, then A is the vector space direct sum A=A_(11)+A_(10)+A_(01)+A_(00), where A_(ij), with i,j=0,1 is the subspace of A ...

A result in control theory. Define H(psi,x,u)=(psi,f(x,u))=sum_(a=0)^npsi_af^a(x,u). Then in order for a control u(t) and a trajectory x(t) to be optimal, it is necessary ...

A pullback is a general categorical operation appearing in a number of mathematical contexts, sometimes going under a different name. If T:V->W is a linear transformation ...