|
In mathematics, the Kronecker product, denoted by , is an operation on two matrices of arbitrary size resulting in a block matrix. It is a special case of a tensor product. The Kronecker product should not be confused with the usual matrix multiplication, which is an entirely different operation. In mathematics, a matrix (plural matrices) is a rectangular table of numbers or, more generally, a table consisting of abstract quantities that can be added and multiplied. ...
In the mathematical discipline of matrix theory, a block matrix or a partitioned matrix is a partition of a matrix into rectangular smaller matrices called blocks. ...
In mathematics, the tensor product, denoted by , may be applied in different contexts to vectors, matrices, tensors, vector spaces, algebras and modules. ...
This article gives an overview of the various ways to multiply matrices. ...
Definition If A is an m-by-n matrix and B is a p-by-q matrix, then the Kronecker product A B is the mp-by-nq block matrix  More explicitly, we have  Examples . . Properties Bilinearity and associativity The Kronecker product is a special case of the tensor product, so it is bilinear and associative: In mathematics, a bilinear operator is a generalized multiplication which satisfies the distributive law. ...
In mathematics, associativity is a property that a binary operation can have. ...
    where A, B and C are matrices and k is a scalar. The Kronecker product is not commutative: in general, A B and B A are different matrices. However, A B and B A are permutation equivalent, meaning that there exist permutation matrices P and Q such that Mathematical meaning A map or binary operation is said to be commutative when, for any x in A and any y in B . ...
In linear algebra, a permutation matrix is a binary matrix that has exactly one entry 1 in each row and each column and 0s elsewhere. ...
 If A and B are square matrices, then A B and B A are even permutation similar, meaning that we can take P = QT. Several equivalence relations in mathematics are called similarity. ...
The mixed-product property If A, B, C and D are matrices of such size that one can form the matrix products AC and BD, then  This is called the mixed-product property, because it mixes the ordinary matrix product and the Kronecker product. It follows that A B is invertible if and only if A and B are invertible, in which case the inverse is given by In mathematics and especially linear algebra, an n-by-n matrix A is called invertible, non-singular or regular if there exists another n-by-n matrix B such that AB = BA = In, where In denotes the n-by-n identity matrix and the multiplication used is ordinary matrix multiplication. ...
 Spectrum Suppose that A and B are square matrices of size n and q respectively. Let λ1, ..., λn be the eigenvalues of A and μ1, ..., μq be those of B (listed according to multiplicity). Then the eigenvalues of A B are In mathematics, a number is called an eigenvalue of a matrix if there exists a nonzero vector such that the matrix times the vector is equal to the same vector multiplied by the eigenvalue. ...
 It follows that the trace and determinant of a Kronecker product are given by In linear algebra, the trace of an n-by-n square matrix A is defined to be the sum of the elements on the main diagonal (the diagonal from the upper left to the lower right) of A, i. ...
In algebra, a determinant is a function depending on n that associates a scalar det(A) to every nÃn square matrix A. The fundamental geometric meaning of a determinant is as the scale factor for volume when A is regarded as a linear transformation. ...
 Singular values If A and B are rectangular matrices, then one can consider their singular values. Suppose that A has rA nonzero singular values, namely In linear algebra singular value decomposition (SVD) is an important factorization of a rectangular real or complex matrix, with several applications in signal processing and statistics. ...
 Similarly, denote the nonzero singular values of B by  Then the Kronecker product A B has rArB nonzero singular values, namely  Since the rank of a matrix equals the number of nonzero singular values, we find that In linear algebra, the column rank (row rank respectively) of a matrix A with entries in some field is defined to be the maximal number of columns (rows respectively) of A which are linearly independent. ...
 Relation to the abstract tensor product The Kronecker product of matrices corresponds to the abstract tensor product of linear maps. Specifically, if the matrices A and B represent linear transformations V1 → W1 and V2 → W2, respectively, then the matrix A B represents the tensor product of the two maps, V1 V2 → W1 W2.
Matrix equations The Kronecker product can be used to get a convenient representation for some matrix equations. Consider for instance the equation AXB = C, where A, B and C are given matrices and the matrix X is the unknown. We can rewrite this equation as  It now follows from the properties of the Kronecker product that the equation AXB = C has a unique solution if and only if A and B are nonsingular. Here, vec X denotes the vector formed by collecting the entries of the matrix X in one long vector. Specifically, if X is an m-by-n matrix, then ![operatorname{vec} X = [ x_{11}, x_{21}, ldots, x_{m1}, x_{12}, x_{22}, ldots, x_{m2}, ldots, x_{1n}, x_{2n}, ldots, x_{mn} ]^top.](http://upload.wikimedia.org/math/1/d/9/1d9592fc765c94f537f20ad756602683.png) History The Kronecker product is named after Leopold Kronecker, even though there is little evidence that he was the first to define and use it. Indeed, in the past the Kronecker product was sometimes called the Zehfuss matrix, after Johann Georg Zehfuss. Leopold Kronecker Leopold Kronecker (December 7, 1823 - December 29, 1891) was a German mathematician and logician who argued that arithmetic and analysis must be founded on whole numbers, saying, God made the integers; all else is the work of man (Bell 1986, p. ...
External links PlanetMath is a free, collaborative, online mathematics encyclopedia. ...
References - Roger Horn and Charles Johnson. Topics in Matrix Analysis, Chapter 4. Cambridge University Press, 1991. ISBN 0-521-46713-6.
|