236 search results - page 2 / 48 » Fast Sparse Matrix Multiplication |
ICPP
2008
IEEE
13 years 11 months ago
2008
IEEE
We identify the challenges that are special to parallel sparse matrix-matrix multiplication (PSpGEMM). We show that sparse algorithms are not as scalable as their dense counterpar...
PC
2002
13 years 4 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
CATA
2010
13 years 6 months ago
2010
Computations with sparse matrices on "multicore cache based" computers are affected by the irregularity of the problem at hand, and performance degrades easily. In this ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer