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

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

A constant, sometimes also called a "mathematical constant," is any well-defined real number which is significantly interesting in some way. In this work, the term "constant" ...

Compass and straightedge geometric constructions dating back to Euclid were capable of inscribing regular polygons of 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 32, 40, 48, ...

A contingency table, sometimes called a two-way frequency table, is a tabular mechanism with at least two rows and two columns used in statistics to present categorical data ...

A number of closed-form constants can be obtained for generalized continued fractions having particularly simple partial numerators and denominators. The Ramanujan continued ...

The convex hull of a set of points S in n dimensions is the intersection of all convex sets containing S. For N points p_1, ..., p_N, the convex hull C is then given by the ...

A convex polyomino (sometimes called a "convex polygon") is a polyomino whose perimeter is equal to that of its minimal bounding box (Bousquet-Mélou et al. 1999). ...

Conway games were introduced by J. H. Conway in 1976 to provide a formal structure for analyzing games satisfying certain requirements: 1. There are two players, Left and ...

The cosecant cscz is the function defined by cscz = 1/(sinz) (1) = (2i)/(e^(iz)-e^(-iz)), (2) where sinz is the sine. The cosecant is implemented in the Wolfram Language as ...