Kronecker product based fractals: Difference between revisions

Content added Content deleted
m (Minor edit to C++ code)
m (C++ - faster Kronecker product calculation)
Line 344: Line 344:
size_t brows = b.rows();
size_t brows = b.rows();
size_t bcolumns = b.columns();
size_t bcolumns = b.columns();
size_t rows = arows * brows;
matrix<scalar_type> c(arows * brows, acolumns * bcolumns);
size_t columns = acolumns * bcolumns;
for (size_t i = 0; i < arows; ++i)
for (size_t j = 0; j < acolumns; ++j)
matrix<scalar_type> c(rows, columns);
for (size_t i = 0; i < rows; ++i)
for (size_t k = 0; k < brows; ++k)
for (size_t j = 0; j < columns; ++j)
for (size_t l = 0; l < bcolumns; ++l)
c(i, j) = a(i/brows, j/bcolumns) * b(i % brows, j % bcolumns);
c(i*brows + k, j*bcolumns + l) = a(i, j) * b(k, l);
return c;
return c;
}
}