In a Msc. project we are implementing hadarmard, kathri-rao, and kronecker products on BSR sparse matrices. Is there any paper/reference regarding the algorithms implemented in the normal Intel MKL Sparse MX * MX multiplication.
We cannot share algorithm used in MKL except general words. In any case, which case of matrix multiplication you interested in, matrix vector, matrix mult sparse matrix or matrix mult dense matrix?
We are interested in sparse matrix matrix multiplication.
We are also preceding in another way into correction. We are investigating the possibility of defining these product (hadamard, kronecker, kathri-rao) from LA transformations and then normal matrix multiplication.
If you have any articles regarding this approach please refer them,