Search Results for ""

An algorithm for finding roots for quartic equations with complex roots.

A root-finding algorithm which converges to a complex root from any starting position. To motivate the formula, consider an nth order polynomial and its derivatives, P_n(x) = ...

In order to find a root of a polynomial equation a_0x^n+a_1x^(n-1)+...+a_n=0, (1) consider the difference equation a_0y(t+n)+a_1y(t+n-1)+...+a_ny(t)=0, (2) which is known to ...

If x_0 is an ordinary point of the ordinary differential equation, expand y in a Taylor series about x_0. Commonly, the expansion point can be taken as x_0=0, resulting in ...

Quasirandom numbers are numbers selected from a quasirandom sequence. Such numbers are useful in computational problems such as quasi-Monte Carlo integration.

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.