Recognizing badly presented Z-modules

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Finitely generated Z-modules have canonical decompositions. When such modules are given in a finitely presented form there is a classical algorithm for computing a canonical decomposition. This is the algorithm for computing the Smith normal form of an integer matrix. We discuss algorithms for Smith normal form computation, and present practical algorithms which give excellent performance for modules arising from badly presented abelian groups. We investigate such issues as congruential techniques, sparsity considerations, pivoting strategies for Gauss-Jordan elimination, lattice basis reduction and computational complexity. Our results, which are primarily empirical, show dramatically improved performance on previous methods.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Recognizing badly presented Z-modules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Recognizing badly presented Z-modules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recognizing badly presented Z-modules will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-653128

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.