67 search results - page 7 / 14 » Parallel sparse polynomial multiplication using heaps |
SIAMSC
2011
13 years 2 months ago
2011
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
CW
2002
IEEE
14 years 14 days 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...
ICPP
2000
IEEE
13 years 12 months ago
2000
IEEE
In this paper, we address the issue of implementing matrix-matrix multiplication on heterogeneous platforms. We target two different classes of heterogeneous computing resources: ...
SIAMSC
2010
13 years 2 months ago
2010
We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation. We present three hypergraph-partitioning-based methods, ea...