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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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).

Keywords

K-Theory and Homology, Distributed, Parallel, and Cluster Computing, Symbolic Computation, Number Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/127751

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0704.2351
 http://arxiv.org/abs/0704.2351

Collections

arXiv