Search results
Results from the WOW.Com Content Network
The Kronecker sum is different from the direct sum, but is also denoted by ⊕. It is defined using the Kronecker product ⊗ and normal matrix addition. If A is n -by- n , B is m -by- m and I k {\displaystyle \mathbf {I} _{k}} denotes the k -by- k identity matrix then the Kronecker sum is defined by:
In mathematics, the Kronecker product, sometimes denoted by ⊗, is an operation on two matrices of arbitrary size resulting in a block matrix.It is a specialization of the tensor product (which is denoted by the same symbol) from vectors to matrices and gives the matrix of the tensor product linear map with respect to a standard choice of basis.
Based on this, eigenvalues and eigenvectors of the Kronecker sum can also be explicitly calculated. The eigenvalues and eigenvectors of the standard central difference approximation of the second derivative on an interval for traditional combinations of boundary conditions at the interval end points are well known .
The map , representing scalar multiplication as a sum of outer products. The generalized Kronecker delta or multi-index Kronecker delta of order 2 p {\displaystyle 2p} is a type ( p , p ) {\displaystyle (p,p)} tensor that is completely antisymmetric in its p {\displaystyle p} upper indices, and also in its p {\displaystyle p} lower indices.
The motivation for the use of the Kronecker sum in this definition comes from the case in which and come from representations and of a Lie group. In that case, a simple computation shows that the Lie algebra representation associated to Π 1 ⊗ Π 2 {\displaystyle \Pi _{1}\otimes \Pi _{2}} is given by the preceding formula.
In the case of column vectors, the Kronecker product can be viewed as a form of vectorization (or flattening) of the outer product. In particular, for two column vectors u {\displaystyle \mathbf {u} } and v {\displaystyle \mathbf {v} } , we can write:
The matrix form of the separation of variables is the Kronecker sum. As an example we consider the 2D discrete Laplacian on a regular grid : L = D x x ⊕ D y y = D x x ⊗ I + I ⊗ D y y , {\displaystyle L=\mathbf {D_{xx}} \oplus \mathbf {D_{yy}} =\mathbf {D_{xx}} \otimes \mathbf {I} +\mathbf {I} \otimes \mathbf {D_{yy}} ,\,}
The tensor product is also called the direct product, Kronecker product, categorical product, cardinal product, relational product, weak direct product, or conjunction. As an operation on binary relations, the tensor product was introduced by Alfred North Whitehead and Bertrand Russell in their Principia Mathematica ( 1912 ).