9 search results - page 2 / 2 » Parallel computation of the rank of large sparse matrices fr... |
SIAMJO
2010
13 years 4 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
As the desire of scientists to perform ever larger computations drives the size of today’s high performance computers from hundreds, to thousands, and even tens of thousands of ...
EUROPAR
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
ICS
2007
Tsinghua U.
13 years 12 months ago
2007
Tsinghua U.
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...