A DICTIONARY FOR LINEAR ALGEBRA线性代数词典.pdf

GLOSSARY: A DICTIONARY FOR LINEAR ALGEBRA Adjacency matrix of a graph. Square matrix with aij = 1 when there is an edge from node i to node j; otherwise aij = 0. A = A T for an undirected graph. Affine transformation T (v) = Av + v 0 = linear transformation plus shift. Associative Law (AB)C = A(BC). Parentheses can be removed to leave ABC. Augmented matrix [A b ]. Ax = b is solvable when b is in the column space of A; then [A b ] has the same rank as A. Elimination on [A b ] keeps equations correct. Back substitution. Upper triangular systems are solved in reverse order xn to x1. Basis for V . Independent vectors v 1, . . . , v d whose linear combinations give every v in V . A vector space has many bases! Big formula for n by n determinants. Det(A) is a sum of n! terms, one term for each permutation P of the columns. That term is the product a1α · · · anω down the diagonal of the reordered matrix, times det(P ) = ±1. Block matrix. A matrix can be partitioned into matrix blocks, by cuts between rows and/or between columns. Block multiplication of AB is allowed if the block shapes permit (the columns of A and rows of B must be in matching blocks). Cayley-Hamilton Theorem. p(λ) = det(A? λI) has p(A) = zero matrix. Change of basis matrixM . The old basis vectors v j are combinations ∑ mijw i of the new basis vectors. The coordinates of c1v 1+ · · ·+cnvn = d1w 1+ · · ·+dnwn are related by d =Mc. (For n = 2 set v 1 = m11w 1 +m21w 2, v 2 = m12w 1 +m22w 2.) Characteristic equation det(A? λI) = 0. The n roots are the eigenvalues of A. Cholesky factorization A = CCT = (L √ D)(L √ D)T for positive definite A. Circulant matrixC. Constant diagonals wrap around as in cyclic shift S. Every circulant is c0I + c1S + · · ·+ cn?1Sn?1. Cx = convolution c ? x . Eigenvectors in F . Cofactor Cij. Remove row i and column j; multiply the determinant by (?1)i+j. Column picture of Ax = b. The vector b becomes a combination of the columns of A. The system is solvable only when b is in the colu