Search Results for ""

A root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...

A proof which indirectly shows a mathematical object exists without providing a specific example or algorithm for producing an example. Nonconstructive proofs are also called ...

A popular acronym for "principal ideal domain." In engineering circles, the acronym PID refers to the "proportional-integral-derivative method" algorithm for controlling ...

In random number computation, a seed is an initial number used as the starting point in a random number generating algorithm. In a dynamical system, a seed is a starting ...

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...

Fractran is an algorithm applied to a given list f_1, f_2, ..., f_k of fractions. Given a starting integer N, the FRACTRAN algorithm proceeds by repeatedly multiplying the ...

An algorithm for partitioning (or clustering) N data points into K disjoint subsets S_j containing N_j data points so as to minimize the sum-of-squares criterion ...

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 biconjugate gradient method often displays rather irregular convergence behavior. Moreover, the implicit LU decomposition of the reduced tridiagonal system may not exist, ...

A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...