Search Results for ""

A direct search method of optimization that works moderately well for stochastic problems. It is based on evaluating a function at the vertices of a simplex, then iteratively ...

The polar sine is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the lengths of the n edges of the ...

Determination of whether predicate P(x_1,...,x_n) is true or false for any given values of x_1, ..., x_n is called its decision problem. The decision problem for predicate ...

A secant line, also simply called a secant, is a line passing through two points of a curve. As the two points are brought together (or, more precisely, as one is brought ...

A piecewise polynomial function that can have a locally very simple form, yet at the same time be globally flexible and smooth. Splines are very useful for modeling arbitrary ...

A transformation T (a.k.a., map, function) over a domain D takes the elements X in D to elements Y in T(D), where the range (a.k.a., image) of T is defined as ...

Let pi_(m,n)(x) denote the number of primes <=x which are congruent to n modulo m (i.e., the modular prime counting function). Then one might expect that ...

The contact angle between a sphere and a tangent plane is the angle alpha between the normal to the sphere at the point of tangency and the basal plane with respect to which ...

The identric mean is defined by I(a,b)=1/e((b^b)/(a^a))^(1/(b-a)) for a>0, b>0, and a!=b. The identric mean has been investigated intensively and many remarkable inequalities ...

A transformation x^'=Ax is unimodular if the determinant of the matrix A satisfies det(A)=+/-1. A necessary and sufficient condition that a linear transformation transform a ...