19 search results - page 3 / 4 » Parallel sparse matrix-vector and matrix-transpose-vector mu... |
IPPS
1999
IEEE
13 years 10 months ago
1999
IEEE
Run-time support for the CYCLIC(k) redistribution on the SPMD computation model is presently very relevant for the scientific community. This work is focused to the characterizati...
PC
2002
13 years 6 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...
CW
2002
IEEE
13 years 11 months ago
2002
IEEE
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...
HPCC
2007
Springer
13 years 10 months ago
2007
Springer
A wide class of geometry processing and PDE resolution methods needs to solve a linear system, where the non-zero pattern of the matrix is dictated by the connectivity matrix of th...
PPAM
2005
Springer
13 years 12 months ago
2005
Springer
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...