IJSRP, Volume 10, Issue 10, October 2020 Edition [ISSN 2250-3153]
Olfa Hamdi-Larbi, Elwsaef Rim
In this paper we address the sparse-dense matrix product (SDMP) problem where the first (resp. second) matrix is sparse (resp. dense). We start with an initial DO loop nest structured algorithm corresponding to the most used sparse matrix compressed formats i.e. DNS, CSR and COO.