Search Results for ""

Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...

A topology tau on a topological vector space X=(X,tau) (with X usually assumed to be T2) is said to be locally convex if tau admits a local base at 0 consisting of balanced, ...

The conjugate gradient method can be viewed as a special variant of the Lanczos method for positive definite symmetric systems. The minimal residual method (MINRES) and ...

The length of all composition series of a module M. According to the Jordan-Hölder theorem for modules, if M has any composition series, then all such series are equivalent. ...

Let u_(p) be a unit tangent vector of a regular surface M subset R^3. Then the normal curvature of M in the direction u_(p) is kappa(u_(p))=S(u_(p))·u_(p), (1) where S is the ...

Suppose that A and B are two normed (Banach) algebras. A vector space X is called an A-B-bimodule whenever it is simultaneously a normed (Banach) left A-module, a normed ...

An algorithm which can be used to find integer relations between real numbers x_1, ..., x_n such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. Although the algorithm ...

A quadratic form involving n real variables x_1, x_2, ..., x_n associated with the n×n matrix A=a_(ij) is given by Q(x_1,x_2,...,x_n)=a_(ij)x_ix_j, (1) where Einstein ...

The index I associated to a symmetric, non-degenerate, and bilinear g over a finite-dimensional vector space V is a nonnegative integer defined by I=max_(W in S)(dimW) where ...

A random permutation is a permutation containing a fixed number n of a random selection from a given set of elements. There are two main algorithms for constructing random ...