Search Results for ""

An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

A lozenge (or rhombus) algorithm is a class of transformation that can be used to attempt to produce series convergence improvement (Hamming 1986, p. 207). The best-known ...

The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...

An algorithm which can be used to find integer relations between real numbers x_1, ..., x_n such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. Although the algorithm ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

The first practical algorithm for determining if there exist integers a_i for given real numbers x_i such that a_1x_1+a_2x_2+...+a_nx_n=0, or else establish bounds within ...

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

A polynomial factorization algorithm that proceeds by considering the vector of coefficients of a polynomial P, calculating b_i=P(i)/a_i, constructing the Lagrange ...