Notes on triangular sets and triangulation-decomposition algorithms I: Polynomial systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2630, Issue , 2003, Pages 1-39

  Hubert, Evelyne ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SURVEYING; TRIANGULATION;

DECOMPOSITION ALGORITHM; DIFFERENTIAL SYSTEMS; MATHEMATICAL OBJECTS; POLYNOMIAL SYSTEMS; TRIANGULAR SETS; TRIANGULATION DECOMPOSITION;

ALGORITHMS;

EID: 33749566968     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45084-x_1     Document Type: Article

References (55)

1. S. A. Abramov and K. Y. Kvashenko. The greatest common divisor of polynomials that depend on a parameter. Vestnik Moskovskogo Universiteta. Seriya XV. Vychislitel naya Matematika i Kibernetika, 2:65-71, 1993.
2. translation in Moscow Univ. Comput. Math. Cybernet. 1993, no. 2, 59-64.
3. P. Aubry, D. Lazard, and M. Moreno-Maza. On the theories of triangular sets. Journal of Symbolic Computation, 28(1-2), 1999.
4. P. Aubry and M. Moreno-Maza. Triangular sets for solving polynomial systems: a comparative implementation of four methods. Journal of Symbolic Computation, 28(1-2):125-154, 1999.
5. P. Aubry, F. Rouillier, and M. Safey El Din. Real solving for positive dimensional systems. Journal of Symbolic Computation, 33(6):543-560, 2003.
6. P. Aubry. Ensembles triangulaires de polynomes et résolution de systèmes algébriques. Implantation en Axiom. PhD thesis, Université de Paris 6, 1999.
7. A. M. Bellido and V. Jalby. Spécifications des algorithmes de triangulation de systèmes algébro-élémentaires. C. R. Acad. Sci. Paris, Ser. I(334):155-159, 2001.
8. D. Bouziane, A. Kandri Rody, and H. Maârouf. Unmixed-dimensional decomposition of a finitely generated perfect differential ideal. Journal of Symbolic Computation, 31(6):631-649, 2001.
9. F. Boulier and F. Lemaire. Computing canonical representatives of regular differential ideals. In C. Traverso, editor, ISSAC. ACM-SIGSAM, ACM, 2000.
10. F. Boulier, D. Lazard, F. Ollivier, and M. Petitot. Representation for the radical of a finitely generated differential ideal. In A. H. M. Levelt, editor, ISSAC'95. ACM Press, New York, 1995.
11. F. Boulier, D. Lazard, F. Ollivier, and M. Petitot. Computing representations for radicals of finitely generated differential ideals. Technical Report IT-306, LIFL, 1997.
12. T. Becker and V. Weispfenning. Gröbner Bases - A Computational Approach to Commutative Algebra. Springer-Verlag, New York, 1993.
13. S. C. Chou and X. S. Gao. Ritt-wu's decomposition algorithm and geometry theorem proving. In M. E. Stickel, editor, 10th International Conference on Automated Deduction, number 449 in Lecture Notes in Computer Sicences, pages 207-220. Springer-Verlag, 1990.
14. S. C. Chou, X. S. Gao, and J. Z. Zhang. Machine proofs in geometry. World Scientific Publishing Co. Inc., River Edge, NJ, 1994. Automated production of readable proofs for geometry theorems, With a foreword by Robert S. Boyer.
15. T. Cluzeau and E. Hubert. Resolvent representation for regular differential ideals. Applicable Algebra in Engineering, Communication and Computing, 13(5):395-425, 2003.
16. S. C. Chou. Mechanical geometry theorem proving. D. Reidel Publishing Co., Dordrecht, 1988. With a foreword by Larry Wos.
17. J. Della Dora, C. Dicrescenzo, and D. Duval. About a new method for computing in algebraic number fields. In Proceedings of EUROCAL 85, number 204 in Lecture Notes in Computer Science, pages 289-290. Springer-Verlag, 1985.
18. S. Dellière. Triangularisation de systèmes constructibles. Application à l'évaluation dynamique. PhD thesis, Université de Limoges, 1999.
19. S. Dellière. D. M. Wang simple systems and dynamic constructible closure. Technical Report 16, Laboratoire d'Arithmétique, de Calcul Formel et d'Optimisation, Limoges, http://www.unilim.fr/laco, 2000.
20. S. Dellière. A first course to D7 with examples. www-lmc.imag.fr/ lmc-cf/Claire.Dicrescenzo/D7, 2000.
21. 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, K. Yu. Kvashenko. Technical Report RR-3882, INRIA, Sophia Antipolis, 2000. http://www.inria.fr/RRRT/RR-3882.html.
22. S. Dellière. On the links between triangular sets and dynamic constructible closure. J. Pure Appl. Algebra, 163(1):49-68, 2001.
23. D. Duval. Diverses questions relatives au calcul formel avec des nombres algébriques. PhD thesis, Institut Fourier, Grenoble, 1987.
24. D. Eisenbud. Commutative Algebra with a View toward Algebraic Geometry. Graduate Texts in Mathematics. Springer-Verlag New York, 1994.
25. M. V. Foursov and M. Moreno Maza. On computer-assisted classification of coupled integrable equations. In Proceedings of the 2001 international symposium on Symbolic and algebraic computation, pages 129-136. ACM Press, 2001.
26. X. S. Gao and S. C. Chou. Solving parametric algebraic sytems. In ISSAC 92, pages 335-341. ACM Press, New York, NY, USA, 1992.
27. K. O. Geddes, S. R. Czapor, and G. Labahn. Algorithms for computer algebra. Kluwer Academic Publishers, Boston, MA, 1992.
28. T. Gómez-Dîaz. Quelques applications de l'évaluation dynamique. PhD thesis, Université de Limoges, 1994.
29. E. Hubert. Factorisation free decomposition algorithms in differential algebra. Journal of Symbolic Computation, 29(4-5):641-662, 2000.
30. E. Hubert. Notes on triangular sets and triangulation-decomposition algorithms. II Differential systems. In this volume, 2003.
31. M. Kalkbrener. A generalized Euclidean algorithm for computing triangular representations of algebraic varieties. Journal of Symbolic Computation, 15(2):143-167, 1993.
32. M. Kalkbrener. Algorithmic properties of polynomial rings. Journal of Symbolic Computation, 26(5):525-582, November 1998.
33. E. R. Kolchin. Differential Algebra and Algebraic Groups, volume 54 of Pure and Applied Mathematics. Academic Press, New York-London, 1973.
34. D. Lazard. A new method for solving algebraic systems of positive dimension. Discrete and Applied Mathematics, 33:147-160, 1991.
35. D. Lazard. Solving zero dimensional algebraic systems. Journal of Symbolic Computation, 15:117-132, 1992.
36. H. Maârouf, A. Kandri Rody, and M. Ssafini. Triviality and dimension of a system of algebraic differential equations. Journal of Automated Reasoning, 20(3):365-385, 1998.
37. M. Moreno-Maza. Calculs de pgcd au-dessus des tours d'extensions simples et résolution des systèmes d'équations algébriques. PhD thesis, Université Paris 6, 1997.
38. M. Moreno Maza and R. Rioboo. Polynomial gcd computations over towers of algebraic extensions. In Applied algebra, algebraic algorithms and error-correcting codes (Paris, 1995), pages 365-382. Springer, Berlin, 1995.
39. ∞. Journal of Symbolic Computation, 28(4-5):631-656, 1999.
40. n. Journal of Symbolic Computation, 28(1-2):213-223, 1999. Polynomial elimination - algorithms and applications.
41. J. F. Ritt. Manifolds of functions defined by systems of algebraic differential equations. Transaction of the American Mathematical Society, 32:569-598, 1930.
42. J. F. Ritt. Differential Equations from the Algebraic Standpoint. Amer. Math. Soc. Colloq. Publ., 1932.
43. J. F. Ritt. Differential Algebra, volume XXXIII of Colloquium publications. American Mathematical Society, 1950. Reprinted by Dover Publications, Inc (1966).
44. E. Schost. Sur la résolution des systèmes polynomiaux à paramètres. PhD thesis, École polytechnique, 2000.
45. J. Schicho and Z. Li. A construction of radical ideals in polynomial algebra. Technical Report 98-17, RISC-Linz, 1998. ftp://ftp.risc. uni-linz.ac.at/pub/techreports/1998/98-17.ps.gz.
46. A. Szanto. Computation with polynomial systems. PhD thesis, Cornell University, 1998.
47. W. V. Vasconcelos. Computational Methods in Commutative Algebra and Algebraic Geometry, volume 2 of Algorithms and Computation in Mathematics. Springer, Berlin, 1998.
48. J. von zur Gathen and J. Gerhard. Modern computer algebra. Cambridge University Press, New York, 1999.
49. D. Wang. An elimination method for polynomial systems. Journal of Symbolic Computation, 16(2):83-114, August 1993.
50. D. Wang. Decomposing polynomial systems into simple systems. Journal of Symbolic Computation, 25(3):295-314, 1998.
51. D. Wang. Elimination methods. Texts and Monographs in Symbolic Computation. Springer-Verlag Wien, 1999.
52. D. Wang. Computing triangular systems and regular systems. Journal of Symbolic Computation, 30(2):221-236, 2000.
53. W. T. Wu. On the decision problem and the mechanization of theorem-proving in elementary geometry. Sci. Sinica, 21(2):159-172, 1978.
54. W. T. Wu. Mechanical theorem proving in geometries. Springer-Verlag, Vienna, 1994. Basic principles, Translated from the 1984 Chinese original by Xiao Fan Jin and Dong Ming Wang.
55. W. T. Wu. Mathematics mechanization. Kluwer Academic Publishers Group, Dordrecht, 2000. Mechanical geometry theorem-proving, mechanical geometry problem-solving and polynomial equations-solving.