A new algorithm for computing the Smith normal form and its implementation on parallel machines

Summary form only given. Smith normal form computation is important in many topics, e.g. group theory and number theory. For matrices over the rings Z and F₂[x], we introduce a new Smith normal form algorithm, called triangular band matrix algorithm, which first computes the Hermite normal form and then step by step the diagonal form and the Smith normal form. In comparison to the Kannan Bachem algorithm, which computes the Smith normal form by alternately computing the Hermite normal form and the left Hermite normal form, the theoretical advantage is, that we only once apply the expensive Hermite normal form step. We parallelize the triangular band matrix algorithm and get a better complexity analysis than for previous parallel algorithms, like the Kannan Bachem algorithm and the Hartley Hawkes algorithm. In the part, which is different to the Kannan Bachem algorithm, the triangular band matrix algorithm leads to a better efficiency and smaller execution times, even for large example matrices.