Search Results for ""
61 - 70 of 2467 for Matrix Square RootSearch Results
A stochastic matrix, also called a probability matrix, probability transition matrix, transition matrix, substitution matrix, or Markov matrix, is matrix used to characterize ...
A square matrix is called bisymmetric if it is both centrosymmetric and either symmetric or antisymmetric (Muir 1960, p. 19).
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 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) = ...
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 ...
A square matrix that is not singular, i.e., one that has a matrix inverse. Nonsingular matrices are sometimes also called regular matrices. A square matrix is nonsingular iff ...
A square matrix is called centrosymmetric if it is symmetric with respect to the center (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 block matrix is a matrix that is defined using smaller matrices, called blocks. For example, [A B; C D], (1) where A, B, C, and D are themselves matrices, is a block ...
A unimodular matrix is a real square matrix A with determinant det(A)=+/-1 (Born and Wolf 1980, p. 55; Goldstein 1980, p. 149). More generally, a matrix A with elements in ...
...
View search results from all Wolfram sites (28886 matches)

