230 search results - page 12 / 46 » Sparse matrix factorization on massively parallel computers |
75
Voted
ISHPC
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
PDP
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—We investigate the scalability of the hypergraphbased sparse matrix partitioning methods with respect to the increasing sizes of matrices and number of nonzeros. We prop...
ISCOPE
1999
Springer
15 years 1 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
137
click to vote
PARLE
1994
15 years 1 months ago
1994
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...
100
Voted
ICPP
2009
IEEE
15 years 4 months ago
2009
IEEE
—Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architec...