Search Results for ""

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

The complexity of a pattern parameterized as the shortest algorithm required to reproduce it. Also known as bit complexity.

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.

Numerical stability refers to how a malformed input affects the execution of an algorithm. In a numerically stable algorithm, errors in the input lessen in significance as ...

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.

Ueberhuber (1997, p. 71) and Krommer and Ueberhuber (1998, pp. 49 and 155-165) use the word "quadrature" to mean numerical computation of a univariate integral, and ...

An O(nlgn) sorting algorithm which is not quite as fast as quicksort. It is a "sort-in-place" algorithm and requires no auxiliary storage, which makes it particularly concise ...