are there any known results on the smith normal form for block matrices over the integers? In particular I am interested in matrices of size (kr)x(ks) made of square blocks of size k such that each block has one 1 and one 1 in each row and columns and the rest are zeros. This is for computing the cohomology of a certain chain complex.

$\begingroup$ What kind of results? Special properties of the Smith form in that case? Efficient computation? A "blockSmith" variant that works on the matrix ring of $k\times k$ matrices? $\endgroup$ – Federico Poloni Aug 22 '14 at 10:46

1$\begingroup$ I would like to prove that this kind of matrix have always the same type of smith normal form: an identity matrix and than only zeros. $\endgroup$ – user53075 Aug 22 '14 at 11:22
On efficient sparse integer matrix Smith normal form computations (Dumas, Saunders, Villard, 2001)
We present a new algorithm to compute the Integer Smith normal form of large sparse matrices. We reduce the computation of the Smith form to independent, and therefore parallel, computations modulo powers of wordsize primes. Our method has proven useful in algebraic topology for the computation of the homology of some large simplicial complexes.