Search Results for ""

A method for finding solutions u and v to a linear congruence au+bv=d by constructing a matrix formed by adjoining a vector containing a and b with a unit matrix, M=[a 1 0; b ...

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

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...

An algorithm for finding closed form hypergeometric identities. The algorithm treats sums whose successive terms have ratios which are rational functions. Not only does it ...

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 ...

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 ...

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 ...

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...

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 ...