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 ...

The unique nonnegative square root of a nonnegative real number. For example, the principal square root of 9 is 3, although both -3 and 3 are square roots of 9. The concept ...

Let sum_(k=1)^(infty)u_k be a series with positive terms, and let rho=lim_(k->infty)u_k^(1/k). 1. If rho<1, the series converges. 2. If rho>1 or rho=infty, the series ...

A special graph vertex that is designated to turn a tree into a rooted tree or a graph into a rooted graph. The root is sometimes also called "eve," or an "endpoint" (Saaty ...

The ant colony algorithm is an algorithm for finding optimal paths that is based on the behavior of ants searching for food. At first, the ants wander randomly. When an ant ...

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

Consider the process of taking a number, taking its digit sum, then adding the digits of numbers derived from it, etc., until the remaining number has only one digit. The ...

Let E be a Euclidean space, (beta,alpha) be the dot product, and denote the reflection in the hyperplane P_alpha={beta in E|(beta,alpha)=0} by ...

The Remez algorithm (Remez 1934), also called the Remez exchange algorithm, is an application of the Chebyshev alternation theorem that constructs the polynomial of best ...

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 ...