Search Results for ""

A minimization of the maximum error for a fixed number of terms.

The approximating polynomial which has the smallest maximum deviation from the true function. It is closely approximated by the Chebyshev polynomials of the first kind.

The fundamental theorem of game theory which states that every finite, zero-sum, two-person game has optimal mixed strategies. It was proved by John von Neumann in 1928. ...

A collection of moves together with a corresponding set of weights which are followed probabilistically in the playing of a game. The minimax theorem of game theory states ...

Using a Chebyshev polynomial of the first kind T(x), define c_j = 2/Nsum_(k=1)^(N)f(x_k)T_j(x_k) (1) = 2/Nsum_(k=1)^(N)f[cos{(pi(k-1/2))/N}]cos{(pij(k-1/2))/N}. (2) Then f(x) ...

The Remez algorithm (Remez 1934), also called the Remez exchange algorithm, is an application of the Chebyshev alternation theorem that constructs the polynomial of best ...

Elliptic rational functions R_n(xi,x) are a special class of rational functions that have nice properties for approximating other functions over the interval x in [-1,1]. In ...

The solution to a game in game theory. When a game saddle point is present max_(i<=m)min_(j<=n)a_(ij)=min_(j<=n)max_(i<=m)a_(ij)=v, and v is the value for pure strategies.

The Hajós graph (Brandstädt et al. 1987, Berge 1989) is another name for the Sierpiński sieve graph S_2, which is isomorphic to the 2-sun graph. However, the term is also ...

Dawson's integral (Abramowitz and Stegun 1972, pp. 295 and 319), also sometimes called Dawson's function, is the entire function given by the integral F(x) = ...