Search Results for ""

A conformal mapping, also called a conformal map, conformal transformation, angle-preserving transformation, or biholomorphic map, is a transformation w=f(z) that preserves ...

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

The cross graph is the 6-vertex tree illustrated above. It is implemented in the Wolfram Language as GraphData["CrossGraph"].

There are three types of cubic lattices corresponding to three types of cubic close packing, as summarized in the following table. Now that the Kepler conjecture has been ...

A cubic semisymmetric graph is a graph that is both cubic (i.e., regular of degree 3) and semisymmetric (i.e., edge- but not vertex-transitive). The four smallest cubic ...

Define a cell in R^1 as an open interval or a point. A cell in R^(k+1) then has one of two forms, {(x,y):x in C, and f(x)<y<g(x)} (1) or {(x,y):x in C, and y=f(x)}, (2) where ...

Dawson's integral (Abramowitz and Stegun 1972, pp. 295 and 319), also sometimes called Dawson's function, is the entire function given by the integral F(x) = ...

The delta function is a generalized function that can be defined as the limit of a class of delta sequences. The delta function is sometimes called "Dirac's delta function" ...

The divergence of a vector field F, denoted div(F) or del ·F (the notation used in this work), is defined by a limit of the surface integral del ·F=lim_(V->0)(∮_SF·da)/V (1) ...

The dodecicosahedral graph is the skeleton graph of the great ditrigonal dodecicosidodecahedron, great dodecicosahedron, great icosicosidodecahedron, small ditrigonal ...