Can anyone tell me some very good/efficient numerial algorthims for GPU/CUDA to compute multiplication/ between sparse matrices (its good if you can recommend me some research papers)?

I googled some papers on sparse vectors, but it looks like they are more interested in the operations involves sparse matrix and dense vectors, but what I am dealing with is some math operations involves only sparse matrices and sparse vectors.


  • 2
    $\begingroup$ In practice sparse matrix times dense vector multiplication is heavily used in iterative methods for the solution of sparse systems of equations. In these algorithms the vector almost always becomes fully dense within a few iterations, so there's no point in worrying about multiplying by sparse vectors. $\endgroup$ Nov 4, 2013 at 22:49

1 Answer 1


Nvidia's cuSPARSE library implements the functions in the standard sparse blas library, but the sparse blas doesn't include a sparse matrix times sparse vector multiply. However, cuSPARSE also has a sparse matrix times sparse matrix multiplication routine that goes beyond the sparse blas.

  • 1
    $\begingroup$ Your sparse vector can be thought of as a sparse matrix with one column, so the sparse matrix times sparse matrix routine will do what you need. $\endgroup$ Nov 1, 2013 at 2:28

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.