Search Results for ""

If A=(a_(ij)) is a diagonal matrix, then Q(v)=v^(T)Av=suma_(ii)v_i^2 (1) is a diagonal quadratic form, and Q(v,w)=v^(T)Aw is its associated diagonal symmetric bilinear form. ...

A square matrix A is called diagonally dominant if |A_(ii)|>=sum_(j!=i)|A_(ij)| for all i. A is called strictly diagonally dominant if |A_(ii)|>sum_(j!=i)|A_(ij)| for all i. ...

A proving technique in homological algebra which consists in looking for equivalent map compositions in commutative diagrams, and in exploiting the properties of injective, ...

A polynomial Z_G(q,v) in two variables for abstract graphs. A graph with one graph vertex has Z=q. Adding a graph vertex not attached by any graph edges multiplies the Z by ...

Differential entropy differs from normal or absolute entropy in that the random variable need not be discrete. Given a continuous random variable X with a probability density ...

An algorithm which allows digits of a given number to be calculated without requiring the computation of earlier digits. The BBP formula for pi is the best-known such ...

The dihedral group D_6 gives the group of symmetries of a regular hexagon. The group generators are given by a counterclockwise rotation through pi/3 radians and reflection ...

A surface of constant negative curvature obtained by twisting a pseudosphere and given by the parametric equations x = acosusinv (1) y = asinusinv (2) z = ...

Dini's theorem is a result in real analysis relating pointwise convergence of sequences of functions to uniform convergence on a closed interval. For an increasing sequence ...

A n-dipyramidal graph is the skeleton of an n-sided dipyramid. It is isomorphic to the (m,2)-cone graph C_m+K^__2, where C_m is a cycle graph, K^__2 is the empty graph on 2 ...