Search Results for ""

A root-finding method which was among the most popular methods for finding roots of univariate polynomials in the 19th and 20th centuries. It was invented independently by ...

Consider the recurrence equation defined by a_0=m and a_n=|_sqrt(2a_(n-1)(a_(n-1)+1))_|, (1) where |_x_| is the floor function. Graham and Pollak actually defined a_1=m, but ...

The dimension e(G), also called the Euclidean dimension (e.g., Buckley and Harary 1988) of a graph, is the smallest dimension n of Euclidean n-space in which G can be ...

An important theorem in plane geometry, also known as Hero's formula. Given the lengths of the sides a, b, and c and the semiperimeter s=1/2(a+b+c) (1) of a triangle, Heron's ...

A method for finding roots of a polynomial equation f(x)=0. Now find an equation whose roots are the roots of this equation diminished by r, so (1) The expressions for f(r), ...

Interval arithmetic is the arithmetic of quantities that lie within specified ranges (i.e., intervals) instead of having definite known values. Interval arithmetic can be ...

The Johnson graph J(n,k) has vertices given by the k-subsets of {1,...,n}, with two vertices connected iff their intersection has size k-1. Special classes are summarized in ...

Let omega_1 and omega_2 be periods of a doubly periodic function, with tau=omega_2/omega_1 the half-period ratio a number with I[tau]!=0. Then Klein's absolute invariant ...

A lattice reduction algorithm, named after discoverers Lenstra, Lenstra, and Lovasz (1982), that produces a lattice basis of "short" vectors. It was noticed by Lenstra et al. ...

Let z be defined as a function of w in terms of a parameter alpha by z=w+alphaphi(z). (1) Then Lagrange's inversion theorem, also called a Lagrange expansion, states that any ...