Search Results for ""

Given a matrix A, its QR-decomposition is a matrix decomposition of the form A=QR, where R is an upper triangular matrix and Q is an orthogonal matrix, i.e., one satisfying ...

The generalized Gell-Mann matrices are the n^2-1 matrices generating the Lie algebra associated to the special unitary group SU(n), n>=2. As their name suggests, these ...

The numerators and denominators obtained by taking the ratios of adjacent terms in the triangular array of the number of +1 "bordered" alternating sign matrices A_n with a 1 ...

A directed strongly regular graph is a simple directed graph with adjacency matrix A such that the span of A, the identity matrix I, and the unit matrix J is closed under ...

A p×q submatrix of an m×n matrix (with p<=m, q<=n) is a p×q matrix formed by taking a block of the entries of this size from the original matrix.

The Woodbury formula (A+UV^(T))^(-1)=A^(-1)-[A^(-1)U(I+V^(T)A^(-1)U)^(-1)V^(T)A^(-1)] is a formula that allows a perturbed matrix to be computed for a change to a given ...

A method for finding a matrix inverse. To apply Gauss-Jordan elimination, operate on a matrix [A I]=[a_(11) ... a_(1n) 1 0 ... 0; a_(21) ... a_(2n) 0 1 ... 0; | ... | | | ... ...

A method of computing the determinant of a square matrix due to Charles Dodgson (1866) (who is more famous under his pseudonym Lewis Carroll). The method is useful for hand ...

In determinant expansion by minors, the minimal number of transpositions of adjacent columns in a square matrix needed to turn the matrix representing a permutation of ...

The conjugate transpose of an m×n matrix A is the n×m matrix defined by A^(H)=A^_^(T), (1) where A^(T) denotes the transpose of the matrix A and A^_ denotes the conjugate ...