Search Results for ""

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

A procedure for finding the quadratic factors for the complex conjugate roots of a polynomial P(x) with real coefficients. (1) Now write the original polynomial as ...

A shuffling algorithm used in a class of random number generators.

For a measurable function mu, the Beltrami differential equation is given by f_(z^_)=muf_z, where f_z is a partial derivative and z^_ denotes the complex conjugate of z.

A bicubic spline is a special case of bicubic interpolation which uses an interpolation function of the form y(x_1,x_2) = sum_(i=1)^(4)sum_(j=1)^(4)c_(ij)t^(i-1)u^(j-1) (1) ...

An extension of the secant method of root finding to higher dimensions.

The partial differential equation u_(xx)+(y^2)/(1-(y^2)/(c^2))u_(yy)+yu_y=0.

If a_1>=a_2>=...>=a_n (1) b_1>=b_2>=...>=b_n, (2) then nsum_(k=1)^na_kb_k>=(sum_(k=1)^na_k)(sum_(k=1)^nb_k). (3) This is true for any distribution.

A sum of the digits in a given transmission modulo some number. The simplest form of checksum is a parity bit appended on to 7-bit numbers (e.g., ASCII characters) such that ...

Let suma_k and sumb_k be a series with positive terms and suppose a_1<=b_1, a_2<=b_2, .... 1. If the bigger series converges, then the smaller series also converges. 2. If ...