Search Results for ""

A Cartan matrix is a square integer matrix who elements (A_(ij)) satisfy the following conditions. 1. A_(ij) is an integer, one of {-3,-2,-1,0,2}. 2. A_(ii)=2 the diagonal ...

The symmetric successive overrelaxation (SSOR) method combines two successive overrelaxation method (SOR) sweeps together in such a way that the resulting iteration matrix is ...

An asymmetric matrix is a square matrix that is not symmetric, i.e., a matrix A such that A^(T)!=A, where A^(T) denotes the transpose. An asymmetric matrix therefore ...

The adjacency matrix, sometimes also called the connection matrix, of a simple labeled graph is a matrix with rows and columns labeled by graph vertices, with a 1 or 0 in ...

A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...

An antisymmetric matrix, also known as a skew-symmetric or antimetric matrix, is a square matrix that satisfies the identity A=-A^(T) (1) where A^(T) is the matrix transpose. ...

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

There are two equivalent definitions for a nilpotent matrix. 1. A square matrix whose eigenvalues are all 0. 2. A square matrix A such that A^n is the zero matrix 0 for some ...

A negative matrix is a real or integer matrix (a)_(ij) for which each matrix element is a negative number, i.e., a_(ij)<0 for all i, j. Negative matrices are therefore a ...

A nonpositive matrix is a real or integer matrix (a)_(ij) for which each matrix element is a nonpositive number, i.e., a_(ij)<=0 for all i, j. Nonpositive matrices are ...