Algorithmes de calcul de la réduction de Hermite d'une matrice à coefficients polynomiaux

Theoretical Computer Science

Volumn 161, Issue 1-2, 1996, Pages 69-92

  Labhalla, Salah ^a   Lombardi, Henri ^b   Marlin, Roger ^c  

^a FACULTÉ DES SCIENCES SEMLALIA   (Morocco)

^b UNIVERSITÉ DE FRANCHE COMTÉ   (France)

^c UNIVERSITÉ CÔTE D'AZUR   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; LINEAR ALGEBRA; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS;

BASIS MATRIX; HERMITE REDUCTION; INTERMEDIARY OBJECTS; POLYNOMIAL ENTRIES;

ALGORITHMS;

EID: 0030181767     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00090-9     Document Type: Article

References (23)

1. E.H. Bareiss, Sylvester's identity and multistep integer-preserving Gaussian elimination, Math. Comp. 22 (1968) 565-578.
2. S.J. Berkovitz, On computing the determinant in small parallel time using a small number of processors, Inform. Process. Lett. 18 (3) (1984) 147-150.
3. T.-W. Chou and G. Collins, Algorithms for the solution of systems of linear diophantine equations, SIAM J. Comput. 11 (1982) 687-708.
4. C. Dicrescenzo and D. Duval, Algebraic extensions and algebraic closure in Scratchpad, in: Symbolic and Algebraic Computaton (ISSAC 88), Lecture Notes in Computer Science, Vol. 358 (Springer, Berlin, 1989) 440-444.
5. J. Dora, C. Dicrescenzo and D. Duval, About a new method for computing in algebraic number fields, Proc. Eurocal '85, Lecture Notes in Computer Science, Vol. 204 (Springer, Berlin, 1985) 289-290.
6. D. Domich, R. Kannan and L. Trotten, Hermite normal form computation using modulo determinant arithmetic, Math. Oper. Res. 12 (1987) 50-59.
7. M. Frumkin, An application of modular arithmetic to the construction of algorithms solving systems of linear equations, Soviet. Math. Dokl. 17 (1976) 1165-1169.
8. M. Frumkin, Polynomial time algorithms in the theory of linear diophantine equations, in: M. Karpinsky, eds., Fundamentals of Computation Theory, Lecture Notes in Computer Science, Vol. 56 (Springer, Berlin, 1977) 386-392.
9. M. Frumkin, Complexity questions in number theory, J. Soviet. Math. 29 (1985) 386-392.
10. L. Gonzalez, H. Lombardi, T. Recio and M.F. Roy, Spécialisation de la suite de Sturm et sous-résultants. 1, RAIRO Inform. Théor. Appl. 24 (1990) 561-588 (version plus détaillée, dans CALSYF journées du GRECO de Calcul Formel, 1989).
11. J. Hafner and K. McCurley, Asymptotically fast triangularization of matrices over rings, SIAM J. Comput. 20 (1991) 1068-1083.
12. C. Iliopoulos, Worst-case complexity bounds on algorithms for computing the canonical structure of finite abelian groups and the Hermite and Smith normal forms of an integer matrice, SIAM J. Comput. 18 (1989) 658-669.
13. C. Iliopoulos, Worst-case complexity bounds on algorithms for computing the canonical structure of infinite abelian groups and solving systems of linear diophantine equations, SIAM J. Comput. 18 (1989) 670-678.
14. R. Kannan, Solving systems of linear equations over polynomials, Theoret. Comput. Sci. 39 (1985) 69-88.
15. R. Kannan and A. Bachem, Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix, SIAM J. Comput. 8 (1979) 499-507.
16. E. Kaltofen, M. Krishnamoorthy and B.D. Saunders, Fast parallel computation of Hermite and Smith normal forms of polynomial matrices, SIAM J. Algebraic Discrete Methods 8 (1987) 683-690.
17. H. Lombard, Sous-résultants, suite de Sturm, spécialisation, 2ème partie de la thèse soutenue en juin 89 à Nice. Réimpression: Publications Mathématiques de l'Université (Besançon) 88-89. Théorie des Nombres. Fascicule 2.
18. R. Loos, Generalized polynomial remainder sequences, dans: Edité par Buchberger, Collins, Computer Algebra, Symbolic and Algebraic Computation (Springer, Berlin, 1982) 115-138.
19. P.A. Samuelson, A method for determining explicitly the coefficients of the characteristic equation, Ann. Math. Statist. 13 (1942) 424-429.
20. A. Schrijver, Theory of Integer and Linear Programming (Wiley, New York, 1985).
21. G. Villard, Computation of Smith normal forms of polynomial matrices, Rapport technique Dec 92, LMC Imag Grenoble.
22. G. Villard, Computation of Smith normal forms of polynomial mltrices, dans Internat. Symp. on Symbolic and Algebraic Computation, Kiev, Ukraine (ACM Press, New York, 1993) 209-217.
23. G. Villard, Generalized subresultants for computing the Smith normal form of polynomial matrices, J. Symbolic Comput. à paraître.