Search Results for ""

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

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 factorization algorithm which works by expressing N as a quadratic form in two different ways. Then N=a^2+b^2=c^2+d^2, (1) so a^2-c^2=d^2-b^2 (2) (a-c)(a+c)=(d-b)(d+b). (3) ...

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