Information | |
---|---|
has gloss | eng: In mathematics, a generalized permutation matrix (or monomial matrix) is a matrix with the same nonzero pattern as a permutation matrix, i.e. there is exactly one nonzero entry in each row and each column. Unlike a permutation matrix, where the nonzero entry must be 1, in a generalized permutation matrix the nonzero entry can be any nonzero value. An example of a generalized permutation matrix is |
lexicalization | eng: Generalized permutation matrices |
lexicalization | eng: generalized permutation matrix |
lexicalization | eng: Monomial matrices |
lexicalization | eng: Monomial matrix |
instance of | (noun) act of changing the lineal order of objects in a group permutation |
Lexvo © 2008-2024 Gerard de Melo. Contact Legal Information / Imprint