Search Results for ""

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

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

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