Search Results for ""

A theory of constructing initial conditions that provides safe convergence of a numerical root-finding algorithm for an equation f(z)=0. Point estimation theory treats ...

An apodization function A(x)=1, (1) having instrument function I(k)=2asinc(2pika). (2) The peak of I(k) is 2a. The full width at half maximum of I(k) can found by setting ...

The tetragonal antiwedge graph is the skeleton of the tetragonal antiwedge. It is a has 6 vertices, 10 edges, and 6 faces. The tetragonal antiwedge graph is self-dual and is ...

A rectangle which cannot be built up of squares all of different sizes is called an imperfect rectangle. A rectangle which can be built up of squares all of different sizes ...

A Pisot number is a positive algebraic integer greater than 1 all of whose conjugate elements have absolute value less than 1. A real quadratic algebraic integer greater than ...

The polyhedron compound of the icosidodecahedron and its dual, the rhombic triacontahedron. The compound can be constructed from an icosidodecahedron of unit edge length by ...

Trigonometric identities which prove useful in the construction of map projections include (1) where A^' = A-C (2) B^' = 2B-4D (3) C^' = 4C (4) D^' = 8D. (5) ...

The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...

A chamfered icosahedron, also called a tritruncated rhombic triacontahedron, is a polyhedron obtained by chamfering a regular icosahedron. The illustration above shows ...

Given a field F and an extension field K superset= F, if alpha in K is an algebraic element over F, the minimal polynomial of alpha over F is the unique monic irreducible ...