230 search results - page 28 / 46 » Sparse matrix factorization on massively parallel computers |
81
Voted
PPOPP
1997
ACM
15 years 1 months ago
1997
ACM
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
97
Voted
IEEEICCI
2005
IEEE
15 years 3 months ago
2005
IEEE
We want to design a suitable computer for the efficient execution of the software now being developed that will display human-like cognitive abilities. Examples of these potential...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
CW
2002
IEEE
15 years 2 months ago
2002
IEEE
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...
TOMS
2008
14 years 9 months ago
2008
We present families of algorithms for operations related to the computation of the inverse of a Symmetric Positive Definite (SPD) matrix: Cholesky factorization, inversion of a tr...