Search Results for ""

Wynn's epsilon-method is a method for numerical evaluation of sums and products that samples a number of additional terms in the series and then tries to extrapolate them by ...

The negabinary representation of a number n is its representation in base -2 (i.e., base negative 2). It is therefore given by the coefficients a_na_(n-1)...a_1a_0 in n = ...

A shuffling algorithm used in a class of random number generators.

The Bolyai expansion of a real number x is a nested root of the form x=a_0-1+RadicalBox[{{a, _, 1}, +, RadicalBox[{{a, _, 2}, +, RadicalBox[{{a, _, 3}, +, ...}, m]}, m]}, m], ...

A node which is one graph edge further away from a given node in a rooted tree.

A solitaire game played with cards. The chance of winning is 1/13, and the arithmetic mean of the number of cards turned up is 42.4.

Dual pairs of linear programs are in "strong duality" if both are possible. The theorem was first conceived by John von Neumann. The first written proof was an Air Force ...

Ellipsoidal calculus is a method for solving problems in control and estimation theory having unknown but bounded errors in terms of sets of approximating ellipsoidal-value ...

A binary tree in which special nodes are added wherever a null subtree was present in the original tree so that each node in the original tree (except the root node) has ...

The Fibonacci chain map is defined as x_(n+1) = -1/(x_n+epsilon+alphasgn[frac(n(phi-1))-(phi-1)]) (1) phi_(n+1) = frac(phi_n+phi-1), (2) where frac(x) is the fractional part, ...