Search Results for ""

An equation of the form y=ax^3+bx^2+cx+d where only one root is real.

One of the operations of addition, subtraction, multiplication, division, and integer (or rational) root extraction.

Wolfram's iteration is an algorithm for computing the square root of a rational number 1<=r<4 using properties of the binary representation of r. The algorithm begins with ...

A root-finding algorithm based on the iteration formula x_(n+1)=x_n-(f(x_n))/(f^'(x_n)){1+(f(x_n)f^('')(x_n))/(2[f^'(x_n)]^2)}. This method, like Newton's method, has poor ...

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

Every polynomial equation having complex coefficients and degree >=1 has at least one complex root. This theorem was first proven by Gauss. It is equivalent to the statement ...

Let x^__1 and s_1^2 be the observed mean and variance of a sample of N_1 drawn from a normal universe with unknown mean mu_((1)) and let x^__2 and s_2^2 be the observed mean ...

Newton's iteration is an algorithm for computing the square root sqrt(n) of a number n via the recurrence equation x_(k+1)=1/2(x_k+n/(x_k)), (1) where x_0=1. This recurrence ...

The radical circle of the mixtilinear incircles has a center with trilinear center function alpha_(999)=cosA-2, (1) which is Kimberling center X_(999). It has radius (2) ...

The Barnes-Wall lattice is a d-dimensional lattice that exists when d is a power of 2. It is implemented in the Wolfram Language as LatticeData[{"BarnesWall", n}]. Special ...