Search Results for ""

For a set of n numbers or values of a discrete distribution x_i, ..., x_n, the root-mean-square (abbreviated "RMS" and sometimes called the quadratic mean), is the square ...

Successive application of Archimedes' recurrence formula gives the Archimedes algorithm, which can be used to provide successive approximations to pi (pi). The algorithm is ...

Given a permutation {p_1,p_2,...,p_n} of {1,...,n}, the bumping algorithm constructs a standard Young tableau by inserting the p_i one by one into an already constructed ...

The roots of a semisimple Lie algebra g are the Lie algebra weights occurring in its adjoint representation. The set of roots form the root system, and are completely ...

An algorithm for multiplying two 32-bit integers modulo a 32-bit constant without using any intermediates larger than 32 bits. It is also useful in certain types of random ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...

Neville's algorithm is an interpolation algorithm which proceeds by first fitting a polynomial of degree 0 through the point (x_k,y_k) for k=1, ..., n, i.e., P_k(x)=y_k. A ...

The Risch algorithm is a decision procedure for indefinite integration that determines whether a given integral is elementary, and if so, returns a closed-form result for the ...

On a computer screen, the pixels indicating a slanted line are selected with Bresenham's algorithm, developed in 1962 while at IBM.

An algorithm which allows digits of a given number to be calculated without requiring the computation of earlier digits. The BBP formula for pi is the best-known such ...