Search Results for ""

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

Let P be a primitive polytope with eight vertices. Then there is a unimodular map that maps P to the polyhedron whose vertices are (0, 0, 0), (1, 0, 0), (0, 1, 0), (0, 0, 1), ...

A (presumably autobiographical) character in one of astrophysicist Fred Hoyle's novels opined the following. "I figure that if to be totally known and totally loved is worth ...

Let a set of vertices A in a connected graph G be called convex if for every two vertices x,y in A, the vertex set of every (x,y) graph geodesic lies completely in A. Also ...

An axiom proposed by Huntington (1933) as part of his definition of a Boolean algebra, H(x,y)=!(!x v y) v !(!x v !y)=x, (1) where !x denotes NOT and x v y denotes OR. Taken ...

As Lagrange showed, any irrational number alpha has an infinity of rational approximations p/q which satisfy |alpha-p/q|<1/(sqrt(5)q^2). (1) Furthermore, if there are no ...

Let {f_n(x)} be a sequence of analytic functions regular in a region G, and let this sequence be uniformly convergent in every closed subset of G. If the analytic function ...

For a rectangular hyperbola x = asect (1) y = atant (2) with inversion center at the origin, the inverse curve is x_i = (2kcost)/(a[3-cos(2t)]) (3) y_i = ...

The pedal curve of a rectangular hyperbola with the pedal point at the focus is a circle (left figure; Hilbert and Cohn-Vossen 1999, p. 26). The pedal curve of a rectangular ...

A hyperbolic version of the Euclidean dodecahedron. Hyperbolic three-space can be tessellated with hyperbolic dodecahedra whose intermediate dihedral angles are 60, 72, or 90 ...