230 search results - page 20 / 46 » Sparse matrix factorization on massively parallel computers |
ECOOPW
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. We present a uni ed approach for expressing high performance numerical linear algebra routines for a class of dense and sparse matrix formats and shapes. As with the Stan...
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
The scalable parallel implementation, targeting SMP and/or multicore architectures, of dense linear algebra libraries is analyzed. Using the LU factorization as a case study, it is...
PC
2007
14 years 9 months ago
2007
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...
94
Voted
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
—This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing...
HPCC
2007
Springer
15 years 1 months ago
2007
Springer
A wide class of geometry processing and PDE resolution methods needs to solve a linear system, where the non-zero pattern of the matrix is dictated by the connectivity matrix of th...