Search Results for ""

Stochastic optimization refers to the minimization (or maximization) of a function in the presence of randomness in the optimization process. The randomness may be present as ...

The asymptotic series of the Airy function Ai(z) (and other similar functions) has a different form in different sectors of the complex plane.

The Stolarsky mean of two numbers a and c is defined by S_p(a,c)=[(a^p-c^p)/(p(a-c))]^(1/(p-1)) (Havil 2003, p. 121).

The Machin-like formula 1/4pi=cot^(-1)2+cot^(-1)5+cot^(-1)8.

An inequality is strict if replacing any "less than" and "greater than" signs with equal signs never gives a true expression. For example, a<=b is not strict, whereas a<b is.

A function f(x) is said to be strictly decreasing on an interval I if f(b)<f(a) for all b>a, where a,b in I. On the other hand, if f(b)<=f(a) for all b>a, the function is ...

A function f(x) is said to be strictly increasing on an interval I if f(b)>f(a) for all b>a, where a,b in I. On the other hand, if f(b)>=f(a) for all b>a, the function is ...

Strong convergence is the type of convergence usually associated with convergence of a sequence. More formally, a sequence {x_n} of vectors in a normed space (and, in ...

phi(A)+phi(B)-phi(A union B)>=phi(A intersection B).

The structure factor S_Gamma of a discrete set Gamma is the Fourier transform of delta-scatterers of equal strengths on all points of Gamma, S_Gamma(k)=intsum_(x in ...