Search Results for ""

Triangulation is the division of a surface or plane polygon into a set of triangles, usually with the restriction that each triangle side is entirely shared by two adjacent ...

A pair of closed form functions (F,G) is said to be a Wilf-Zeilberger pair if F(n+1,k)-F(n,k)=G(n,k+1)-G(n,k). (1) The Wilf-Zeilberger formalism provides succinct proofs of ...

A generalization of the Bulirsch-Stoer algorithm for solving ordinary differential equations.

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

An algorithm for computing an Egyptian fraction, called the Farey sequence method by Bleicher (1972).

A theory is decidable iff there is an algorithm which can determine whether or not any sentence r is a member of the theory.

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

A fast Fourier transform-like algorithm which produces a hologram of an image.

The use of three prior points in a root-finding algorithm to estimate the zero crossing.

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