Exact Sparse Matrix-Vector Multiplication on GPU's and Multicore Architectures
Abstract
We propose different implementations of the sparse matrix--dense vector multiplication () for finite fields and rings /m. We take advantage of graphic card processors (GPU) and multi-core architectures. Our aim is to improve the speed of in the 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.