Triangular sets for solving polynomial systems: A comparative implementation of four methods

Journal of Symbolic Computation

Volumn 28, Issue 1-2, 1999, Pages 125-154

  Aubry, Philippe ^a   Moreno Maza, Marc ^a,b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b Numerical Algorithms Group   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000631665     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1999.0270     Document Type: Article

References (54)

1. Aubry, P. (1999). Ensembles triangulaires de polynômes et résolution des systèmes d'équations algébriques. Ph.D. Thesis, Université Paris 6.
2. Aubry, P., Lazard, D., Moreno Maza, M. (1999). On the theories of triangular sets. J. Symb. Comput., 28, 105-124.
3. Boege, W., Gebauer, R., Kredel, H. (1986). Some examples for solving systems of algebraic equations by calculating Gröbner bases. J. Symb. Comput., 2, 83-98.
4. st edn. Oxford, U.K., NAG, The Numerical Algorithms Group Limited. AXIOM is a registered trade mark of NAG.
5. Bronstein, M. (1986). Gsolve: a faster algorithm for solving systems of algebraic equations. In Char, B. W., ed., Proceedings SYMSAC86, pp. 247-249. New York, ACM Press.
6. Buchberger, B. (1965). Ein algorithmus zum auffinden der basiselemente des restklassenringes nach einem nulldimensionalen polynomideal. Ph. D. Thesis, University of Innsbruck.
7. Chou, S. (1988). Mechanical Geometry Theorem Proving. Dordrecht, Reidel.
8. Chou, S., Gao, X. (1990). Ritt-Wu's decomposition algorithm and geometry theorem proving. In Proceedings CADE-10, Kaiserslautern, Germany, LNCS 449, pp. 207-220, Springer Verlag.
9. Chou, S., Gao, X. (1992). Solving parametric algebraic systems. In Proceedings ISAAC'92 Berkeley, CA, pp. 335-341, ACM Press, New York.
10. Collart, S., Kalkbrener, M., Mall, D. (1997). Converting bases with the Gröbner walk. J. Symb. Comput., 24, 465-470.
11. Cox, D., Little, J., O'Shea, D. (1992). Ideals, Varieties, and Algorithms. New York, Springer-Verlag.
12. Czapor, S., Geddes, K. (1986). On implementing Buchberger's algorithm for Gröbner bases. In Proceedings SYMSAC'86, pp. 425-440. Waterloo, B.W. Char.
13. Della Dora, J., Discrescenzo, C., Duval, D. (1985). About a new method method for computing in algebraic number fields. In Proceedings EUROCAL 85, volume 2, LNCS 204, pp. 289-290. Springer-Verlag.
14. Donati, L., Traverso, C. (1989). Experimenting the Gröbner basis algorithm with the ALPI system. Proceedings ISSAC'89, pp. 192-198. New York, ACM Press.
15. European Commission (1992). PoSSo - Polynomial System Solving Research Project. Esprit Scheme Project No. 6846. Has been extended to the FRISCO project.
16. Faugère, J.-C. (1994). Résolution des systèmes d'équations algébriques. Ph. D. Thesis, Université Paris 6.
17. Faugère, J.-C., Gianni, P., Lazard, D., Mora, T. (1993). Efficient computation of zero-dimensional Gröbner bases by change of ordering. J. Symb. Comput., 16, 329-344.
18. Faugère, J.-C., Moreau de Saint-Martin, F., Rouillier, F. (1998). Design of nonseparable bidimensional wavelets and filter banks using Gröbner bases techniques. IEEE SP Trans. Signal Process., 46. Special Issue on Theory and Applications of Filter Banks and Wavelets.
19. Gallo, G., Mishra, B. (1990). Efficient algorithms and bounds for Wu-Ritt characteristic sets. Proceedings MEGA'90, Lavorno, Italy, Progress in Mathematics 94, pp. 119-142, Birkhaüser.
20. Gianni, P. (1987). In Properties of Gröbner Basis under Specializations, LNCS 378, pp. 293-297. Springer.
21. Giovinni, A., Mora, T., Niesi, G., Robbiano, L., Traverso, C. (1991). "One sugar cube, please" or selection strategies in the Buchberger algorithm. In Proceedings ISSAC'91, pp. 49-54. New York, ACM Press.
22. Gómez-Díaz, T. (1994). Quelques applications de l'évaluation dynamique. Ph. D. Thesis, Université de Limoges.
23. González-López, M., Recio, T. (1993). The ROMIN inverse geometric model and the dynamic evaluation method. In Cohen, A. M., ed., Proceedings of the 1991 SCAFI Seminar, Computer Algebra in Industry. New York, Wiley.
24. Gräbe, H.-G. (1995). Triangular systems and factorized Gröbner bases. In Proceedings AAECC 11, Paris, Cohen, G., Giusti, M. and Mora, T., eds, LNCS 948, pp. 248-261, Springer Verlag.
25. Huynh, D. (1986). A superexponential lower bound for Gröbner bases and Church Rosser commutative thue systems. Inf. Control, 68, 196-206.
26. Jenks, R. D., Sutor, R. S. (1992). AXIOM, The Scientific Computation System. New York, Springer-Verlag. AXIOM is a trade mark of NAG Ltd, Oxford UK.
27. Kalkbrener, M. (1987). In Solving Systems of Algebraic Equations by using Gröbner Bases, LNCS 378, pp. 282-292. Springer.
28. Kalkbrener, M. (1991). Three contributions to elimination theory. Ph. D. Thesis, Johannes Kepler University, Linz.
29. Kalkbrener, M. (1993). A generalized Euclidean algorithm for computing triangular representations of algebraic varieties. J. Symb. Comput., 15, 143-167.
30. Kalkbrener, M. (1998). Algorithmic properties of polynomial rings. J. Symb. Comput., 26, 525-581.
31. Kotsireas, I. (1998). Algorithmes de résolution de systèmes polynomiaux: application aux configurations centrales du problème des N corps en mécanique céleste. Ph. D. Thesis, Université Paris 6.
32. Lazard, D. (1991). A new method for solving algebraic systems of positive dimension. Discrete Appl. Math., 33, 147-160.
33. Lazard, D. (1992). Solving zero-dimensional algebraic systems. J. Symb. Comput., 15, 117-132.
34. Li, Z. (1995). An implementation of the characteristic set method for solving algebraic equations. In Proceedings POSSO Workshop on Software, Paris, France, Université Paris 6, pp. 107-122.
35. Liu, Z. (1989). An algorithm on finding all isolated zeros of polynomial equations. MM Research Preprints, 4, 63-76.
36. Mayr, E., Meyer, A. (1982). The complexity of the word problems for commutative semigroups and ideals. Adv. Math., 46, 305-329.
37. Möller, H. M. (1993). On decomposing systems of polynomial equations with finitely many solutions. Appl. Algebra Eng. Commun. Comput., 4 217-230.
38. Moreno Maza, M. (1997). Calculs de pgcd au-dessus des tours d'extensions simples et résolution des systèmes d'équations algébriques. Ph. D. Thesis, Université Paris 6.
39. Moreno Maza, M. (1998). A new algorithm for computing triangular decompositions of algebraic varieties. Technical Report TR 4/98, NAG Ltd, Oxford, U.K.
40. Moreno Maza, M., Rioboo, R. (1995). Polynomial gcd computations over towers of algebraic extensions. Proceedings AAECC-11, pp. 365-382. Springer.
41. Ritt, J. F. (1932). Differential Equations from an Algebraic Standpoint, volume 14. New York, American Mathematical Society.
42. Ritt, J. F. (1966). Differential Algebra. New York, Dover.
43. Samuel, P., Zariski, O. (1967). Commutative Algebra. Princeton, NJ, Van Nostrand.
44. Traverso, C. (1996). Hilbert functions and the Buchberger algorithm. J. Symb. Comput., 22, 355-376.
45. Wang, D. M. (1991). On Wu's method for solving systems of algebraic equations. Technical Report RISC-LINZ Series no 91-52.0, Johannes Kepler University, Linz, Austria.
46. Wang, D. M. (1992). Some improvements on Wu's method for solving systems of algebraic equations. In Wu, W.-T. and Cheng, M.-D., eds, Proceedings of the Int. Workshop on Math. Mechanisation, Beijing, China. Institute of Systems Science, Academia Sinica.
47. Wang, D. M. (1993a). An elimination method based on Siedenberg's theory and its applications. In Eysette, F. and Galligo, A., eds, Comptutational Algebraic Geometry, pp. 301-328. Boston, Birkhaüser.
48. Wang, D. M. (1993b). An elimination method for polynomial systems. J. Symb. Comput., 16, 83-114.
49. Wang, D. M. (1995). An implementation of the characteristic set method in Maple. In Pfalzgraf, J. and Wang, D. M., eds, Automated Practical Reasoning: Algebraic Approaches, pp. 187-201. Wien, Springer.
50. Wang, D. M. (1996). Solving polynomial equations: characteristic sets and triangular systems. Math. Comput. Simul., 42, 339-345.
51. Wang, D. M. (1998). Decomposing polynomial systems into simple systems. J. Symb. Comput., 25, 295-314.
52. Wu, W. T. (1986). On zeros of algebraic equations - an application of Ritt principle. Kexue Tongbao, 31, 1-5.
53. Wu, W. T. (1987). A zero structure theorem for polynomial equations solving. MM Research Preprints, 1, 2-12.
54. Yang, L., Zhang, J. (1994). Searching dependency between algebraic equations: an algorithm applied to automated reasoning. In Johnson, J., McKee, S. and Vella, A., eds, Artificial Intelligence in Mathematics, pp. 147-156. Oxford, Oxford University Press.