Parallel computation of the rank of large sparse matrices from algebraic K-theory - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

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

Abstract

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).
Fichier principal
Vignette du fichier
parank.pdf (209.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00142141 , version 1 (17-04-2007)
hal-00142141 , version 2 (24-04-2007)

Identifiers

Cite

Jean-Guillaume Dumas, Philippe Elbaz-Vincent, Pascal Giorgi, Anna Urbanska. Parallel computation of the rank of large sparse matrices from algebraic K-theory. PASCO '07 - International Workshop on Parallel Symbolic Computation, Jul 2007, London, Canada. pp.43-52, ⟨10.1145/1278177.1278186⟩. ⟨hal-00142141v2⟩
421 View
557 Download

Altmetric

Share

Gmail Facebook X LinkedIn More