Jump to content

Sparse matrix–vector multiplication

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Kadirakbudak (talk | contribs) at 05:00, 13 April 2014. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Sparse matrix-vector multiplication (SpMV) of the form is a widely-used computational kernel existing in many scientific applications. The input matrix is sparse. The input vector and the output vector are dense. In case of repeated operation involving the same input matrix but possibly changing numerical values of its elements, can be preprocessed to reduce both the parallel and sequential run time of the SpMV kernel.[1]

References

  1. ^ "Hypergraph Partitioning Based Models and Methods for Exploiting Cache Locality in Sparse Matrix-Vector Multiplication". Retrieved 13 April 2014.