Search Results for ""

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.

An algorithm which isolates roots in the complex plane by generalizing one-dimensional bracketing.

A specific prescription for carrying out a task or solving a problem. Also called an algorithm, method, or technique

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

An algorithm which finds the least nonnegative value of sqrt(a (mod p)) for given a and prime p.

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 sum of the values of an integral of the "first" or "second" sort int_(x_0,y_0)^(x_1,y_1)(Pdx)/Q+...+int_(x_0,y_0)^(x_N,y_N)(Pdx)/Q=F(z) and ...