Parallel algorithms for hermite normal form of an integer matrix

Authors:
F. Siebert-Roch
Affiliations:
Laboratoire TIM3-IMAG, 46 avenue Felix Viallet, 3803 1 GRENOBLE-cedex, FRANCE
Venue:
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Year:
1989

Citing 7
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
Hermite normal form computation using modulo determinant arithmetic

Mathematics of Operations Research
Algorithm and bound for the greatest common divisor of n integers

Communications of the ACM
The Art of Computer Programming Volumes 1-3 Boxed Set

The Art of Computer Programming Volumes 1-3 Boxed Set
Computer Algebra on MIMD Machine

ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Gaussian Elimination over a Euclidean Ring

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
The size of numbers in the analysis of certain algorithms

The size of numbers in the analysis of certain algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main problem in the integral matrices triangularization is the 'intermediate coefficients swell'. This aspect limits the dimension of treated matrices. Since 1985, we have at our disposal, the lliopoulos algorithm to compute the Hermite Normal Form of an Integer Matrix controlling the coefficients growth by mean of the determinant.We present here two parallelizations of this algorithm and their implementations on a MIMD machine, with 16 processors.