Search Results for ""

A square matrix is called centrosymmetric if it is symmetric with respect to the center (Muir 1960, p. 19).

A diagonal matrix is a square matrix A of the form a_(ij)=c_idelta_(ij), (1) where delta_(ij) is the Kronecker delta, c_i are constants, and i,j=1, 2, ..., n, with no implied ...

In 1891, Chebyshev and Sylvester showed that for sufficiently large x, there exists at least one prime number p satisfying x<p<(1+alpha)x, where alpha=0.092.... Since the ...

The companion matrix to a monic polynomial a(x)=a_0+a_1x+...+a_(n-1)x^(n-1)+x^n (1) is the n×n square matrix A=[0 0 ... 0 -a_0; 1 0 ... 0 -a_1; 0 1 ... 0 -a_2; | | ... ... |; ...

The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...

A sparse matrix is a matrix that allows special techniques to take advantage of the large number of "background" (commonly zero) elements. The number of zeros a matrix needs ...

A square matrix U is a unitary matrix if U^(H)=U^(-1), (1) where U^(H) denotes the conjugate transpose and U^(-1) is the matrix inverse. For example, A=[2^(-1/2) 2^(-1/2) 0; ...

The power series that defines the exponential map e^x also defines a map between matrices. In particular, exp(A) = e^(A) (1) = sum_(n=0)^(infty)(A^n)/(n!) (2) = ...

An n×n square matrix M with M_(ii) = 1 (1) M_(ij) = M_(ji)>1 (2) for all i,j=1, ..., n.

The numbers of eigenvalues that are positive, negative, or 0 do not change under a congruence transformation. Gradshteyn and Ryzhik (2000) state it as follows: when a ...