1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
|
// This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2011 Kolja Brix <brix@igpm.rwth-aachen.de>
// Copyright (C) 2011 Andreas Platen <andiplaten@gmx.de>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
#ifndef KRONECKER_TENSOR_PRODUCT_H
#define KRONECKER_TENSOR_PRODUCT_H
namespace Eigen {
namespace internal {
/*!
* Kronecker tensor product helper function for dense matrices
*
* \param A Dense matrix A
* \param B Dense matrix B
* \param AB_ Kronecker tensor product of A and B
*/
template<typename Derived_A, typename Derived_B, typename Derived_AB>
void kroneckerProduct_full(const Derived_A& A, const Derived_B& B, Derived_AB & AB)
{
const unsigned int Ar = A.rows(),
Ac = A.cols(),
Br = B.rows(),
Bc = B.cols();
for (unsigned int i=0; i<Ar; ++i)
for (unsigned int j=0; j<Ac; ++j)
AB.block(i*Br,j*Bc,Br,Bc) = A(i,j)*B;
}
/*!
* Kronecker tensor product helper function for matrices, where at least one is sparse
*
* \param A Matrix A
* \param B Matrix B
* \param AB_ Kronecker tensor product of A and B
*/
template<typename Derived_A, typename Derived_B, typename Derived_AB>
void kroneckerProduct_sparse(const Derived_A &A, const Derived_B &B, Derived_AB &AB)
{
const unsigned int Ar = A.rows(),
Ac = A.cols(),
Br = B.rows(),
Bc = B.cols();
AB.resize(Ar*Br,Ac*Bc);
AB.resizeNonZeros(0);
AB.reserve(A.nonZeros()*B.nonZeros());
for (int kA=0; kA<A.outerSize(); ++kA)
{
for (int kB=0; kB<B.outerSize(); ++kB)
{
for (typename Derived_A::InnerIterator itA(A,kA); itA; ++itA)
{
for (typename Derived_B::InnerIterator itB(B,kB); itB; ++itB)
{
const unsigned int iA = itA.row(),
jA = itA.col(),
iB = itB.row(),
jB = itB.col(),
i = iA*Br + iB,
j = jA*Bc + jB;
AB.insert(i,j) = itA.value() * itB.value();
}
}
}
}
}
} // end namespace internal
/*!
* Computes Kronecker tensor product of two dense matrices
*
* \param a Dense matrix a
* \param b Dense matrix b
* \param c Kronecker tensor product of a and b
*/
template<typename A,typename B,typename CScalar,int CRows,int CCols, int COptions, int CMaxRows, int CMaxCols>
void kroneckerProduct(const MatrixBase<A>& a, const MatrixBase<B>& b, Matrix<CScalar,CRows,CCols,COptions,CMaxRows,CMaxCols>& c)
{
c.resize(a.rows()*b.rows(),a.cols()*b.cols());
internal::kroneckerProduct_full(a.derived(), b.derived(), c);
}
/*!
* Computes Kronecker tensor product of two dense matrices
*
* Remark: this function uses the const cast hack and has been
* implemented to make the function call possible, where the
* output matrix is a submatrix, e.g.
* kroneckerProduct(A,B,AB.block(2,5,6,6));
*
* \param a Dense matrix a
* \param b Dense matrix b
* \param c Kronecker tensor product of a and b
*/
template<typename A,typename B,typename C>
void kroneckerProduct(const MatrixBase<A>& a, const MatrixBase<B>& b, MatrixBase<C> const & c_)
{
MatrixBase<C>& c = const_cast<MatrixBase<C>& >(c_);
internal::kroneckerProduct_full(a.derived(), b.derived(), c.derived());
}
/*!
* Computes Kronecker tensor product of a dense and a sparse matrix
*
* \param a Dense matrix a
* \param b Sparse matrix b
* \param c Kronecker tensor product of a and b
*/
template<typename A,typename B,typename C>
void kroneckerProduct(const MatrixBase<A>& a, const SparseMatrixBase<B>& b, SparseMatrixBase<C>& c)
{
internal::kroneckerProduct_sparse(a.derived(), b.derived(), c.derived());
}
/*!
* Computes Kronecker tensor product of a sparse and a dense matrix
*
* \param a Sparse matrix a
* \param b Dense matrix b
* \param c Kronecker tensor product of a and b
*/
template<typename A,typename B,typename C>
void kroneckerProduct(const SparseMatrixBase<A>& a, const MatrixBase<B>& b, SparseMatrixBase<C>& c)
{
internal::kroneckerProduct_sparse(a.derived(), b.derived(), c.derived());
}
/*!
* Computes Kronecker tensor product of two sparse matrices
*
* \param a Sparse matrix a
* \param b Sparse matrix b
* \param c Kronecker tensor product of a and b
*/
template<typename A,typename B,typename C>
void kroneckerProduct(const SparseMatrixBase<A>& a, const SparseMatrixBase<B>& b, SparseMatrixBase<C>& c)
{
internal::kroneckerProduct_sparse(a.derived(), b.derived(), c.derived());
}
} // end namespace Eigen
#endif // KRONECKER_TENSOR_PRODUCT_H
|
