Implemented LinAlg.kronecker_product

This commit is contained in:
novak_99 2021-05-29 21:38:07 -07:00
parent baae76a5e0
commit d6e94f662b
2 changed files with 34 additions and 0 deletions

View File

@ -74,6 +74,39 @@ namespace MLPP{
return C;
}
std::vector<std::vector<double>> LinAlg::kronecker_product(std::vector<std::vector<double>> A, std::vector<std::vector<double>> B){
std::vector<std::vector<double>> C;
// C.resize(A.size() * B.size());
// for(int i = 0; i < C.size(); i++){
// C[i].resize(A[0].size() * B[0].size());
// }
// [1,2,3,4] [1,2,3,4,5]
// [1,1,1,1] [1,2,3,4,5]
// [1,2,3,4,5]
// [1,2,3,4,5] [1,2,3,4,5] [1,2,3,4,5] [1,2,3,4,5]
// [1,2,3,4,5] [1,2,3,4,5] [1,2,3,4,5] [1,2,3,4,5]
// [1,2,3,4,5] [1,2,3,4,5] [1,2,3,4,5] [1,2,3,4,5]
// [1,2,3,4,5] [1,2,3,4,5] [1,2,3,4,5] [1,2,3,4,5]
// [1,2,3,4,5] [1,2,3,4,5] [1,2,3,4,5] [1,2,3,4,5]
// [1,2,3,4,5] [1,2,3,4,5] [1,2,3,4,5] [1,2,3,4,5]
// Resulting matrix: A.size() * B.size()
// A[0].size() * B[0].size()
for(int k = 0; k < A.size(); k++){
for(int j = 0; j < B.size(); j++){
std::vector<std::vector<double>> row;
for(int i = 0; i < A[0].size(); i++){
row.push_back(scalarMultiply(A[k][i], B[j]));
}
C.push_back(flatten(row));
}
}
return C;
}
std::vector<std::vector<double>> LinAlg::elementWiseDivision(std::vector<std::vector<double>> A, std::vector<std::vector<double>> B){
std::vector<std::vector<double>> C;
C.resize(A.size());

View File

@ -364,6 +364,7 @@ int main() {
// std::cout << alg.trace({{1,2}, {3,4}}) << std::endl;
// alg.printMatrix(alg.pinverse({{1,2}, {3,4}}));
// alg.printMatrix(alg.diag({1,2,3,4,5}));
// alg.printMatrix(alg.kronecker_product({{1,2,3,4,5}}, {{6,7,8,9,10}}));
return 0;
}