37 search results - page 1 / 8 » Compressed Modular Matrix Multiplication |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Matrices of integers modulo a small prime can be compressed by storing several entries into a single machine word. Modular addition is performed by addition and possibly subtracti...
TIT
2008
13 years 4 months ago
2008
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...
ICPP
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—The Sparse Matrix-Vector Multiplication kernel exhibits limited potential for taking advantage of modern shared memory architectures due to its large memory bandwidth re...
HPCC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We improve the performance of sparse matrix-vector multiplication (SpMV) on modern cache-based superscalar machines when the matrix structure consists of multiple, irregu...
PARLE
1994
13 years 8 months ago
1994
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...