Search Results for ""

A square matrix A is a normal matrix if [A,A^(H)]=AA^(H)-A^(H)A=0, where [a,b] is the commutator and A^(H) denotes the conjugate transpose. For example, the matrix [i 0; 0 ...

A projection matrix P is an n×n square matrix that gives a vector space projection from R^n to a subspace W. The columns of P are the projections of the standard basis ...

A Hadamard matrix is a type of square (-1,1)-matrix invented by Sylvester (1867) under the name of anallagmatic pavement, 26 years before Hadamard (1893) considered them. In ...

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

The term "transition matrix" is used in a number of different contexts in mathematics. In linear algebra, it is sometimes used to mean a change of coordinates matrix. In the ...

The shear matrix e_(ij)^s is obtained from the identity matrix by inserting s at (i,j), e.g., e_(12)^s=[1 s 0; 0 1 0; 0 0 1]. (1) Bolt and Hobbs (1998) define a shear matrix ...

A pair of matrices ND^(-1) or D^(-1)N, where N is the matrix numerator and D is the denominator.

A square matrix is called bisymmetric if it is both centrosymmetric and either symmetric or antisymmetric (Muir 1960, p. 19).

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...

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