Search Results for ""

Generalizes the secant method of root finding by using quadratic 3-point interpolation q=(x_n-x_(n-1))/(x_(n-1)-x_(n-2)). (1) Then define A = ...

The vector field N_f(z)=-(f(z))/(f^'(z)) arising in the definition of the Newtonian graph of a complex univariate polynomial f (Smale 1985, Shub et al. 1988, Kozen and ...

An apodization function similar to the Bartlett function.

Let gamma be a path given parametrically by sigma(t). Let s denote arc length from the initial point. Then int_gammaf(s)ds = int_a^bf(sigma(t))|sigma^'(t)|dt (1) = ...

The element in the diagonal of a matrix by which other elements are divided in an algorithm such as Gauss-Jordan elimination is called the pivot element. Partial pivoting is ...

A slightly archaic term for a computer-generated random number. The prefix pseudo- is used to distinguish this type of number from a "truly" random number generated by a ...

One of the operations exists exists (called the existential quantifier) or for all forall (called the universal quantifier, or sometimes, the general quantifier). However, ...

A robust estimation based on a rank test.

A related rates problem is the determination of the rate at which a function defined in terms of other functions changes. Related rates problems can be solved by computing ...

An algorithm for computing an Egyptian fraction.