186 search results - page 6 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
WCE
2007
13 years 8 months ago
2007
—Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide,...
FPGA
2005
ACM
14 years 1 months ago
2005
ACM
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
ACPC
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
SIAMSC
2011
12 years 10 months ago
2011
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...