I have a dense column matrix y
of size (m,1)
and a sparse matrix x
of size (m,n)
.
I want to do element-wise multiplication using y
and every column of x
.
The resultant sparse matrix is still of size (m,n)
.
Sparse matrix x
, when loaded into memory, is about 10GB.
Can spfun
help me accomplish my goal in a memory efficient manner?
I am having difficulties understanding the logic behind it.
Thank you.