Sciweavers

10 search results - page 1 / 2
» The I O Complexity of Sparse Matrix Dense Matrix Multiplicat...
Sort
View
102
Voted
LATIN
2010
Springer
15 years 4 months ago
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
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...
Gero Greiner, Riko Jacob
ICCS
2001
Springer
15 years 2 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
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...
Eun-Jin Im, Katherine A. Yelick
CORR
2007
Springer
75views Education» more  CORR 2007»
14 years 10 months ago
On Undetected Error Probability of Binary Matrix Ensembles
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 ...
Tadashi Wadayama
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
15 years 3 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
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 ...
Arne Storjohann, Gilles Villard
PC
2002
158views Management» more  PC 2002»
14 years 9 months ago
On parallel block algorithms for exact triangularizations
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...
Jean-Guillaume Dumas, Jean-Louis Roch