On the links between triangular sets and dynamic constructible closure

Journal of Pure and Applied Algebra

Volumn 163, Issue 1, 2001, Pages 49-68

  Dellière, Stéphane ^a  

^a Laboratoire d'Arithmétique   (France)

Author keywords

14Qxx; 68W30

Indexed keywords

EID: 18044402323     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-4049(00)00136-5     Document Type: Article

References (33)

1. Atiyah M.F., MacDonald I.G. Introduction to Commutative Algebra. 1969;Addison-Wesley, Reading, MA.
2. P. Aubry, Ensembles triangulaires de polynômes et résolution de systèmes algébriques. Implantation en axiom, Ph.D. Thesis, Université de Paris 6, 1999.
3. P. Aubry, D. Lazard, M. Moreno Maza, On the theories of triangular sets, J. Symb. Comput., Special Issue on Polynomial Elimination, 28 (1) (1999) 105-124.
4. P. Aubry, M. Moreno Maza, Triangular sets for solving polynomial systems: a comparison of four methods, J. Symb. Comput., Special Issue on Polynomial Elimination, 28 (1) (1999) 125-154.
5. D. Bini, B. Mourrain, Handbook of polynomial systems, Frisco project (LTR 21.024), 1997.
6. Bronstein M. G solve: a faster algorithm for solving systems of algebraic equations Char B.W. Proc. SYMSAC86. 1986;247-249 ACM Press, New York.
7. A.M. Cohen, J.H. Davenport, A.J.P. Heck, An overview of computer algebra, Computer algebra in industry. Problem solving in practice, in: A.M. Cohen (Ed.), The SCAFI Papers, Proceedings of the 1991 SCAFI, Seminar on Studies in Computer algebra for Industry, CAN, CWI, Amsterdam, 1993, pp. 1-52.
8. Cox D., Little J., O'Shea D. Ideals, Varieties and Algorithms. 1992;Springer, Berlin.
9. J. Della Dora, C. Discrenzo, D. Duval, About a new method for computing in algebraic number fields, in: G. Goos, J. Hartmanis (Eds.), Eurocal'85, Vol. 2, Lecture Notes in Computer Science, vol. 204, Springer, Berlin, 1985, pp. 289-290.
10. S. Dellière, Triangularisation des systèmes constructibles, Application à l'évaluation dynamique, Ph.D. Thesis, Université de Limoges, 1999.
11. S. Dellière, D.M. Wang simple systems and dynamic constructible closure, Rapport de Recherche No. 2000-16 de l'Université de Limoges, 2000.
12. S. Dellière, pgcd de deux polynômes à paramètres: approche par la clôture constructible dynamique et généralisation de la méthode de S.A. Abramov et de K.Yu. Kvashenko, INRIA Research Report (RR-3882), 2000.
13. C. Dicrescenzo, D. Duval, Algebraic extensions and algebraic closure in Scratchpad, in: P. Gianni (Ed.), Symbolic and Algebraic Computation, Lecture Notes in Computer Science, vol. 358, Springer, Berlin, 1989, pp. 440-446.
14. D. Duval, T. Gómez-Díaz, A lazy method for triangularizing polynomial systems, Rapport de Recherche de l'Université de Limoges, 1995.
15. T. Gómez-Díaz, Quelques applications de l'évaluation dynamique, Ph.D. Thesis, Université de Limoges, 1994.
16. T. Gómez-Díaz, Dynamic constructible closure, in: J.-C. Faugere, J. Marchand, R. Rioboo (Eds.), Proceedings of the PoSSo Workshop on Software, P.SS. Scientific Committee Paris, 1995, pp. 73-93.
17. T. Gómez-Díaz, Let T be a triangle, is it isosceles? Actas del primer encuentro de àlgebra computacional y aplicaciones - EACA'95, Santander, 1995, pp. 67-73.
18. T. Gómez-Díaz, Examples of using dynamic constructible closure, in: G. Jacob, N.E. Oussous, S. Steiberg (Eds.), Proceedings of International IMACS Symposium on Symbolic Computation, International Association for Mathematics and Computers in Simulation, 1993, pp. 17-21, Also in Math. Comput. Simulation 42 (1996) 375-383.
19. T. Gómez-Díaz, Examples of using dynamic constructible closure, in: G. Jacob, N.E. Oussous, S. Steiberg (Eds.), Proceedings of International IMACS Symposium on Symbolic Computation, International Association for Mathematics and Computers in Simulation, 1993, pp. 17-21, Also in Math. Comput. Simulation 42 (1996) 375-383.
20. T. Gómez-Díaz, On the computation of Jordan forms with parameters (preprint 1997).
21. M.J. González-López, T. Recio, The ROMIN inverse geometric model and the dynamic evaluation method, The Scafi papers draft, 1991, pp. 117-141.
22. A.M. Cohen, J.H. Davenport, A.J.P. Heck, An overview of computer algebra. in: A.M. Cohen (Ed.), Computer algebra in industry. Problem solving in practice. Proceedings of the 1991 SCAFI Seminar at CWI, Amsterdam, 1993, pp. 1-52.
23. Jenks R.D., Sutor R.S. Axiom, The Scientific Computation System. 1992;NAG, Springer, Berlin.
24. M. Kalkbrener, Three contributions to elimination theory, Ph.D. Thesis, Johannes Kepler University, Linz, 1991.
25. Lazard D. A new method for solving algebraic systems of positive dimension. Discrete Appl. Math. 33:1991;147-160.
26. Malliavin M.P. Algèbre Commutative. 1985;Masson, Paris.
27. Mishra B. Algorithmic Algebra. 1993;Springer, New York.
28. M. Moreno Maza, Calculs de pgcd au dessus des tours d'extensions simples et résolution des systèmes d'équations algébriques, Ph.D. Thesis, Université de Paris 6, 1997.
29. D. Perrin, Géométrie Algébrique. Une Introduction, CNRS Éditions, 1995.
30. Ritt J.F. Differential Algebra, Vol. 33. 1950;AMS Colloquium Publications, New York.
31. Wang D.M. Decomposing polynomial systems into simple systems. J. Symb. Comput. 25:1998;295-314.
32. S.M. Watt, P.A. Broadbery, S.S. Dooley, P. Iglio, S.C. Morrison, J.M. Steinbach, R.S. Sutor, Axiom, Library Compiler, User guide, NAG, 1994.
33. W.T. Wu, A zero structure theorem for polynomial equations solving, MM Research Preprints, Vol. 1, 1987, pp. 2-12.