- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
hello,
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.
Regards,
Sérgio Caldas
Link Copied
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hi Sergio,
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?
Thanks,
Alex
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hi Alex,
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,
Regards,
Sergio Caldas


- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Printer Friendly Page