Search Results for ""

In the biconjugate gradient method, the residual vector r^((i)) can be regarded as the product of r^((0)) and an ith degree polynomial in A, i.e., r^((i))=P_i(A)r^((0)). (1) ...

A Boolean algebra is a mathematical structure that is similar to a Boolean ring, but that is defined using the meet and join operators instead of the usual addition and ...

Bowling, known as "ten pins" throughout most of the world, is a game played by rolling a heavy ball down a long narrow track and attempting to knock down ten pins arranged in ...

The complex conjugate of a complex number z=a+bi is defined to be z^_=a-bi. (1) The conjugate matrix of a matrix A=(a_(ij)) is the matrix obtained by replacing each element ...

The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski graph of order four, and is implemented as ...

There are a number of point processes which are called Hawkes processes and while many of these notions are similar, some are rather different. There are also different ...

The least common multiple of two numbers a and b, variously denoted LCM(a,b) (this work; Zwillinger 1996, p. 91; Råde and Westergren 2004, p. 54), lcm(a,b) (Gellert et al. ...

Sudoku (literally, "single number"), sometimes also is a pencil-and-paper logic puzzle whose goal is to complete a grid satisfying various constraints. In the "classic" ...

The alternating group graph AG_n is the undirected Cayley graph of the set of 2(n-2) generators of the alternating group A_n given by g_3^-, g_3^+, g_4^-, g_4^+, ..., g_n^-, ...

Define an antipode of a given graph vertex v_i as a vertex v_j at greatest possible graph distance from v_i. Then an antipodal graph is a connected graph in which each vertex ...