Search Results for ""

The result of a matrix multiplication.

The incidence matrix of a graph gives the (0,1)-matrix which has a row for each vertex and column for each edge, and (v,e)=1 iff vertex v is incident upon edge e (Skiena ...

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 square matrix A such that the matrix power A^(k+1)=A for k a positive integer is called a periodic matrix. If k is the least such integer, then the matrix is said to have ...

Three types of n×n matrices can be obtained by writing Pascal's triangle as a lower triangular matrix and truncating appropriately: a symmetric matrix S_n with (S)_(ij)=(i+j; ...

A (0,1)-matrix is an integer matrix in which each element is a 0 or 1. It is also called a logical matrix, binary matrix, relation matrix, or Boolean matrix. The number of ...

A C-matrix is a symmetric (C^(T)=C) or antisymmetric (C^(T)=-C) C_n (-1,0,1)-matrix with diagonal elements 0 and others +/-1 that satisfies CC^(T)=(n-1)I, (1) where I is the ...

A square matrix which is not reducible is said to be irreducible.

The n×n square matrix F_n with entries given by F_(jk)=e^(2piijk/n)=omega^(jk) (1) for j,k=0, 1, 2, ..., n-1, where i is the imaginary number i=sqrt(-1), and normalized by ...

Matrix decomposition refers to the transformation of a given matrix (often assumed to be a square matrix) into a given canonical form.