230 search results - page 2 / 46 » Sparse matrix factorization on massively parallel computers |
LCPC
1998
Springer
15 years 1 months ago
1998
Springer
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
Multicore processors are marking the beginning of a new era of computing where massive parallelism is available and necessary. Slightly slower but easy to parallelize kernels are ...
SC
2003
ACM
15 years 2 months ago
2003
ACM
We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. W...
SPAA
1998
ACM
15 years 1 months ago
1998
ACM
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
129
Voted
Publication
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retrieval, and signal processing. It is used to factorize a non-negative data matrix ...