Search Results for ""

The intersection of two sets A and B is the set of elements common to A and B. This is written A intersection B, and is pronounced "A intersection B" or "A cap B." The ...

A strict order > on the set of terms of a term rewriting system is called a reduction order if 1. The set of terms is well ordered with respect to >, that is, all its ...

Given the functional (1) find in a class of arcs satisfying p differential and q finite equations phi_alpha(y_1,...,y_n;y_1^',...,y_n^')=0 for alpha=1,...,p ...

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

The Jacobi symbol (a/y)=chi(y) as a number theoretic character can be extended to the Kronecker symbol (f(a)/y)=chi^*(y) so that chi^*(y)=chi(y) whenever chi(y)!=0. When y is ...

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 ...

If f is a continuous function that satisfies the Lipschitz condition |f(x,t)-f(y,t)|<=L|x-y| (1) in a surrounding of (x_0,t_0) in Omega subset ...

The function psi(x)={x(1-(x^2)/(c^2))^2 for |x|<c; 0 for |x|>c (1) sometimes used in robust estimation. It has a minimum at x=-c/sqrt(5) and a maximum at x=c/sqrt(5), where ...

The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in ...

A fiber bundle (also called simply a bundle) with fiber F is a map f:E->B where E is called the total space of the fiber bundle and B the base space of the fiber bundle. The ...