Exact sparse matrix-vector multiplication on gpu’s and multicore architectures

We propose different implementations of the sparse matrix–dense vec-tor multiplication (SpMV) for finite fields and rings Z /mZ. We take advantage of graphic card processors (GPU) and multi-core architectures. Our aim is to improve the speed of SpMV in the LinBox library, and henceforth the speed of its black box algorithms. Besides, we use this and a new parallelization of the sigma-basis algorithm in a parallel block Wiedemann rank implementation over finite fields.