Search Results for ""

The conjugate gradient method is an algorithm for finding the nearest local minimum of a function of n variables which presupposes that the gradient of the function can be ...

Conway's knot is the prime knot on 11 crossings with braid word sigma_2^3sigma_1sigma_3^(-1)sigma_2^(-2)sigma_1sigma_2^(-1)sigma_1sigma_3^(-1). The Jones polynomial of ...

A simple way to describe a knot projection. The advantage of this notation is that it enables a knot diagram to be drawn quickly. For an oriented alternating knot with n ...

Every nonplanar graph contains either the utility graph K_(3,3) (i.e., the complete bipartite graph on two sets of three vertices) or the pentatope graph K_5 as a ...

A term sometimes used to describe a map projection which is neither equal-area nor conformal (Lee 1944; Snyder 1987, p. 4).

An azimuthal projection which is neither equal-area nor conformal. Let phi_1 and lambda_0 be the latitude and longitude of the center of the projection, then the ...

When working over a collection of fields, the base field is the intersection of the fields in the collection, i.e., the field contained in all other fields.

A map projection defined by x = sin^(-1)[cosphisin(lambda-lambda_0)] (1) y = tan^(-1)[(tanphi)/(cos(lambda-lambda_0))]. (2) The inverse formulas are phi = sin^(-1)(sinDcosx) ...

A countable set is a set that is either finite or denumerable. However, some authors (e.g., Ciesielski 1997, p. 64) use the definition "equipollent to the finite ordinals," ...

The equations are x = 2/(sqrt(pi(4+pi)))(lambda-lambda_0)(1+costheta) (1) y = 2sqrt(pi/(4+pi))sintheta, (2) where theta is the solution to ...