Search Results for ""

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

Since each triplet of Yff circles are congruent and pass through a single point, they obey Johnson's theorem. As a result, in each case, there is a fourth circle congruent to ...

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If K=L and h is a join-homomorphism, then we call h a join-endomorphism.

A real-valued univariate function f=f(x) has a jump discontinuity at a point x_0 in its domain provided that lim_(x->x_0-)f(x)=L_1<infty (1) and lim_(x->x_0+)f(x)=L_2<infty ...

Jung's theorem states that the generalized diameter D of a compact set X in R^n satisfies D>=Rsqrt((2(n+1))/n), where R is the circumradius of X (Danzer et al. 1963). This ...

A semi-oriented 2-variable knot polynomial defined by F_L(a,z)=a^(-w(L))<|L|>, (1) where L is an oriented link diagram, w(L) is the writhe of L, |L| is the unoriented diagram ...

The point Ko of concurrence in Kosnita theorem, i.e., the point of concurrence of the lines connecting the vertices A, B, and C of a triangle DeltaABC with the circumcenters ...

The Lambert azimuthal equal-area projection is a map projection having transformation equations x = k^'cosphisin(lambda-lambda_0) (1) y = ...

Writing a Fourier series as f(theta)=1/2a_0+sum_(n=1)^(m-1)sinc((npi)/(2m))[a_ncos(ntheta)+b_nsin(ntheta)], where m is the last term, reduces the Gibbs phenomenon. The ...

A lattice graph, also known as a mesh graph or grid graph, is a graph possessing an embedding in a Euclidean space R^n that forms a regular tiling. Examples include grid ...