10 search results - page 1 / 2 » The I O Complexity of Sparse Matrix Dense Matrix Multiplicat... |
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...
ICCS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Abstract— In this paper, analysis on undetected error probability of ensembles of m × n binary matricies is presented. Two ensembles are considered: One is an ensemble of dense ...
ISSAC
2005
Springer
13 years 10 months ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
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...