论文信息 - Hermite and Smith normal form algorithms over Dedekind domains

Hermite and Smith normal form algorithms over Dedekind domains

We show how the usual algorithms valid over Euclidean domains, such as the Hermite Normal Form, the modular Hermite Normal Form and the Smith Normal Form can be extended to Dedekind rings. In a sequel to this paper, we will explain the use of these algorithms for computing in relative extensions of number fields.

Henri Cohen | H. Cohen

[1] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[2] Ravi Kannan,et al. Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..

[3] James Lee Hafner,et al. Asymptotically fast triangulation of matrices over rings , 1991, SODA '90.

[4] Leslie E. Trotter,et al. Hermite Normal Form Computation Using Modulo Determinant Arithmetic , 1987, Math. Oper. Res..

[5] Michael E. Pohst,et al. Computations with finitely generated modules over Dedekind rings , 1991, ISSAC '91.

[6] George Havas,et al. Hermite normal form computation for integer matrices , 1994 .