Efficient parallelizations of Hermite and Smith normal form algorithms

@article{Jger2009EfficientPO,
  title={Efficient parallelizations of Hermite and Smith normal form algorithms},
  author={Gerold J{\"a}ger and Clemens Wagner},
  journal={Parallel Computing},
  year={2009},
  volume={35},
  pages={345-357}
}
Hermite and Smith normal form are important forms of matrices used in linear algebra. These terms have many applications in group theory and number theory. As the entries of the matrix and of its corresponding transformation matrices can explode during the computation, it is a very difficult problem to compute the Hermite and Smith normal form of large dense matrices. The main problems of the computation are the large execution times and the memory requirements which might exceed the memory of… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 35 REFERENCES

Computation with finitely presented groups

  • Encyclopedia of mathematics and its applications
  • 1994
VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

On Systems of Linear Indeterminate Equations and Congruences. [Abstract]

Henry J. Stephen Smith
    VIEW 11 EXCERPTS
    HIGHLY INFLUENTIAL

    Parallel Algorithms for Computing the Smith Normal Form of Large Matrices

    G. Jäger
    • in: Proc. 10th European PVM/MPI, Lecture Notes in Comput. Sci. 2840, Springer, Berlin- Heidelberg
    • 2003
    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Parallel matrix distribution library for sparse matrix solvers

    • Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05)
    • 2005
    VIEW 3 EXCERPTS