9 search results - page 1 / 2 » Parallel computation of the rank of large sparse matrices fr... |
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
This paper deals with the computation of the rank and some integer Smith forms of a series of sparse matrices arising in algebraic K-theory. The number of non zero entries in the ...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
SC
2009
ACM
14 years 1 days ago
2009
ACM
Sparse matrix-vector multiplication (SpMV) is of singular importance in sparse linear algebra. In contrast to the uniform regularity of dense linear algebra, sparse operations enc...
PC
2002
13 years 4 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
IPPS
2005
IEEE
13 years 10 months ago
2005
IEEE
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...