Parallel computation of the rank of large sparse matrices from algebraic K-theory

Details Parallel computation of the rank of large sparse matrices from algebraic K-theory Parallel computation of the rank of large sparse matrices from algebraic K-theory

2007-04-18

arxiv.org/abs/0704.2351v2

Mathematics

K-Theory and Homology

Scientific paper

This paper deals with the computation of the rank and of some integer Smith forms of a series of sparse matrices arising in algebraic K-theory. The number of non zero entries in the considered matrices ranges from 8 to 37 millions. The largest rank computation took more than 35 days on 50 processors. We report on the actual algorithms we used to build the matrices, their link to the motivic cohomology and the linear algebra and parallelizations required to perform such huge computations. In particular, these results are part of the first computation of the cohomology of the linear group GL_7(Z).

Affiliated with

Also associated with

No associations

Rating

Parallel computation of the rank of large sparse matrices from algebraic K-theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parallel computation of the rank of large sparse matrices from algebraic K-theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel computation of the rank of large sparse matrices from algebraic K-theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-405302