Search Results for ""

Two lines in two-dimensional Euclidean space are said to be parallel if they do not intersect. In three-dimensional Euclidean space, parallel lines not only fail to ...

A transformation consisting of a constant offset with no rotation or distortion. In n-dimensional Euclidean space, a translation may be specified simply as a vector giving ...

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

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

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

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.

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

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

A convex body in Euclidean space that is centrally symmetric with center at the origin is determined among all such bodies by its brightness function (the volume of each ...