Search Results for ""

A technique used by André (1887) to provide an elegant solution to the ballot problem (Hilton and Pederson 1991) and in study of Wiener processes (Doob 1953; Papoulis 1984, ...

A complicated polynomial root-finding algorithm which is used in the IMSL® (IMSL, Houston, TX) library and which Press et al. (1992) describe as "practically a standard in ...

The expansion of the two sides of a sum equality in terms of polynomials in x^m and y^k, followed by closed form summation in terms of x and y. For an example of the ...

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

A prime factorization algorithm.

A prime factorization algorithm which can be implemented in a single-step or double-step form. In the single-step version, a prime factor p of a number n can be found if p-1 ...

A method of constructing uniform polyhedra.

A method for computing an Egyptian fraction. This method always terminates (Beeckmans 1993).

A technique is a specific method of performing an operation. The terms algorithm, method, and procedure are also used interchangeably.

An indicial equation, also called a characteristic equation, is a recurrence equation obtained during application of the Frobenius method of solving a second-order ordinary ...