By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jager, G. ; Mathematisches Seminar, Kiel Univ., Germany

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 F2[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.

Published in:

Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International

Date of Conference:

26-30 April 2004