230 search results - page 11 / 46 » Sparse matrix factorization on massively parallel computers |
IPPS
1999
IEEE
15 years 1 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...
PVM
1999
Springer
15 years 1 months ago
1999
Springer
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
PARA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We consider parallel preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) for sparse linear system solution. We develop methods for construct...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
109
click to vote
ICPP
2000
IEEE
15 years 2 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...