Search Results for ""

An algorithm for computing an Egyptian fraction.

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

An algorithm for computing an Egyptian fraction (Stewart 1992).

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

An algorithm for computing an Egyptian fraction.

A prime factorization algorithm in which a sequence of trial divisors is chosen using a quadratic sieve. By using quadratic residues of N, the quadratic residues of the ...

Given a nonhomogeneous ordinary differential equation, select a differential operator which will annihilate the right side, and apply it to both sides. Find the solution to ...

The partial differential equation u_(xy)+(N(u_x+u_y))/(x+y)=0.

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