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

Denoted sl_n.

An algorithm that can always be used to decide whether a given polynomial is free of zeros in the closed unit disk (or, using an entire linear transformation, to any other ...

The inversion of a convolution equation, i.e., the solution for f of an equation of the form f*g=h+epsilon, given g and h, where epsilon is the noise and * denotes the ...

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.