Search Results for ""

An algorithm in control theory introduced by Kalman (1960) and refined by Kalman and Bucy (1961). It is an algorithm which makes optimal use of imprecise data on a linear (or ...

The Kaprekar routine is an algorithm discovered in 1949 by D. R. Kaprekar for 4-digit numbers, but which can be generalized to k-digit numbers. To apply the Kaprekar routine ...

The mathematical study of knots. Knot theory considers questions such as the following: 1. Given a tangled loop of string, is it really knotted or can it, with enough ...

A deconvolution algorithm (sometimes abbreviated MEM) which functions by minimizing a smoothness function ("entropy") in an image. Maximum entropy is also called the ...

Presburger arithmetic is the first-order theory of the natural numbers containing addition but no multiplication. It is therefore not as powerful as Peano arithmetic. ...

An algorithm that can always be used to decide whether a given polynomial is free of zeros in the closed unit disk (or, using an entire linear transformation, to any other ...

A global extremum, also known as an absolute extremum, is a global minimum or global maximum. It is impossible to construct an algorithm that will find a global extremum for ...

A global maximum, also known as an absolute maximum, the largest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...

A global minimum, also known as an absolute minimum, is the smallest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...

A polynomial factorization algorithm that proceeds by considering the vector of coefficients of a polynomial P, calculating b_i=P(i)/a_i, constructing the Lagrange ...