Search Results for ""

A square matrix A is said to be unipotent if A-I, where I is an identity matrix is a nilpotent matrix (defined by the property that A^n is the zero matrix for some positive ...

D_q=1/(1-q)lim_(epsilon->0)(lnI(q,epsilon))/(ln(1/epsilon),) (1) where I(q,epsilon)=sum_(i=1)^Nmu_i^q, (2) epsilon is the box size, and mu_i is the natural measure. The ...

A complete graph is a graph in which each pair of graph vertices is connected by an edge. The complete graph with n graph vertices is denoted K_n and has (n; 2)=n(n-1)/2 (the ...

Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...

LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...

pi has decimal expansion given by pi=3.141592653589793238462643383279502884197... (1) (OEIS A000796). The following table summarizes some record computations of the digits of ...

A matrix whose elements may contain complex numbers. The matrix product of two 2×2 complex matrices is given by (1) where R_(11) = ...

Consider a game, first proposed by Nicolaus Bernoulli, in which a player bets on how many tosses of a coin will be needed before it first turns up heads. The player pays a ...

The asymptotic form of the n-step Bernoulli distribution with parameters p and q=1-p is given by P_n(k) = (n; k)p^kq^(n-k) (1) ∼ 1/(sqrt(2pinpq))e^(-(k-np)^2/(2npq)) (2) ...

An arc-transitive graph, sometimes also called a flag-transitive graph, is a graph whose graph automorphism group acts transitively on its graph arcs (Godsil and Royle 2001, ...