2239 search results - page 25 / 448 » Computing with abstract matrix structures |
EUROPAR
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
100
click to vote
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...
HPCN
1997
Springer
15 years 1 months ago
1997
Springer
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
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...