[enriquto]

> and then do any kron product you want, whether sparse matrices with other sparse matrices

Thanks! Will try it with the new release. Last time I tried, apparently it converted the sparse matrix to dense before calling kron, and (expectedly) it failed due to memory error. For example, try to compute the adjacency matrix of a grid graph of size 1000x1000. It is the kronecker product of two tridiagonal matrices of that size. It only has four million non-zero entries, which are instantaneous to compute, but if you want to store all the zeros you'll need a few terabites of RAM.

[adgjlsfhk1]

that definitely sounds like a bug. if it still is like that, please file an issue :)