Computing parametric geometric resolutions

Applicable Algebra in Engineering, Communications and Computing

Volumn 13, Issue 5, 2003, Pages 349-393

  Schost, Éric ^a  

^a ECOLE POLYTECHNIQUE   (France)

Author keywords

Complexity; Polynomial systems with parameters; Symbolic Newton operator; Theory of elimination

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MATHEMATICAL MODELS; PARAMETER ESTIMATION; POLYNOMIALS;

BEZOUT NUMBER; HYPERELLIPTIC CURVES; PARAMETRIC GEOMETRIC RESOLUTION; THEORY OF ELIMINATION;

COMPUTATIONAL GEOMETRY;

EID: 0037332265     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-002-0109-x     Document Type: Article

References (67)

1. Jean-Charles Faugère's homepage. http://posso.lip6.fr/jcf/
2. Magma. http://www.maths.usyd.edu.au:8000/u/magma/
3. MEDICIS. http://www.medicis.polytechnique.fr/
4. Alonso, M. E., Becker, E., Roy, M.-F., Wörmann, T.: Zeros, multiplicities and idempotents for zero-dimensional systems. In Proceedings of MEGA '94 (1996), vol. 142 of Progress in Mathematics, Basel: Birkhäuser, pp. 1-15
5. Bachmann, O., Dengel, M., Faugère, J.-C., Graebe, H.-G., Schoenemann, H.: The SymbolicData Project. http://symbolicdata.medicis.polytechnique.fr/
6. Baur, W., Strassen, V.: The complexity of partial derivatives. Theoretical Computer Science 22, 317-330 (1983)
7. Bershenko-Kogan, I.: Inductive approach to Cartan's Moving Frame Method with applications to classical invariant theory. PhD thesis, University of Minnesotta, 2000
8. Boulier, F., Lazard, D., Ollivier, F., Petitot, M.: Representation for the radical of a finitely generated differential ideal. In Proceedings of ISSAC'95 (1995), ACM Press, pp. 158-166
9. Buchberger, B.: Gröbner bases: An algorithmic method in polynomial ideal theory. In Multidimensional System Theory. Dordrecht: Reidel, 1985, pp. 374-383
10. Buchberger, B., Collins, G., Loos, R.: (Eds). Computer Algebra. Berlin-Heidelberg New York: Springer 1982
11. Bürgisser, P., Clausen, M., Shokrollahi, M. A.: Algebraic Complexity Theory. Springer 1997
12. Canny, J.: Some algebraic and geometric problems in PSPACE. In Proceedings of the 20th ACM Symposium on Theory of Computation (1988), pp. 460-467
13. Cohen, H.: Advanced Topics in computational number theory. No. 193 in Graduate Texas in Mathematics. Berlin-Heidelberg NewYork: Springer 2000
14. Dellière, S.: Triangularisation de systèmes constructibles -Application à l'évaluation dynamique. PhD thesis, Universitè de Limoges, 1999
15. Dixon, J.: Exact solution of linear equations using p-adic expansions. Numerische Mathematik 40, 137-141 (1982)
16. Duval, D.: Diverses questions relatives au calcul formel avec des nombres algébriques. PhD thesis, Université scientifique, technologique et médicale de Grenoble, 1987
17. Eisenbud, D.: Commutative Algebra with a view toward Algebraic Geometry. No. 150 in Graduate Texts in Mathematics. Springer, 1996
18. Emiris, I., and Mourrain, B.: Matrices in elimination theory. Journal of Symbolic Computation 28, 1-2 (1999)
19. Emiris, I., Rege, A.: Monomial bases and polynomial system solving. In Proceedings of ISSAC'94 (1994), ACM Press, pp. 114-122
20. 4). Journal of Pure and Applied Algebra 139, 1-3, 61-88 (1999)
21. Faugère, J.-C., Gianni, P., Lazard, D., Mora, T.: Efficient computation of zero-dimensional Gröbner bases by change of ordering. Journal of Symbolic Computation 16(4), 329-344 (1993)
22. Fitzpatrick, P., Flynn, J.: A Gröbner basis technique for Padé approximation. Journal of Symbolic Computation 13, 133-138 (1992)
23. Gaudry, P., Harley, R.: Counting points on hyperelliptic curves over finite fields. In Proceedings of ANTS IV (2000), Vol. 1838 in Lecture Notes in Computer Science, pp. 313-332
24. Gianni, P., Mora, T.: Algebraic solution of systems of polynomial equations using Gröbner bases. In Proceedings of AAECC-5 (1989). Vol. 356 of Lecture Notes in Computer Science, Springer, pp. 247-257
25. Giusti, M., Hägele, K., Heintz, J., Morais, J.-E., Montaña, J.-L., Pardo, L.-M.: Lower bounds for Diophantine approximation. In Proceedings of MEGA'96 (1997), Journal of Pure and Applied Algebra, pp. 277-317, 117-118 (1997)
26. Giusti, M., Heintz, J., Morais, J.-E., Morgenstern, J., Pardo, L.-M.: Straight-line programs in geometric elimination theory. Journal of Pure and Applied Algebra 124, 101-146 (1998)
27. Giusti, M., Heintz, J., Morais, J.-E., Pardo, L.-M.: When polynomial equation systems can be solved fast? In Proceedings of AAECC-11 (1995), Vol. 948 of Lecture Notes in Computer Science, Springer, pp. 205-231
28. Giusti, M., Lecerf, G., Salvy, B.: A Gröbner free alternative for polynomial system solving. Journal of Complexity 17(1), 154-211 (2001)
29. Gomez-Diaz, T.: Quelques applications de l'évaluation dynamique. PhD thesis, Université de Limoges, 1994
30. Gonzalez-Vega, L.: Computer Algebra in Science and Engineering. World Scientific Publishing, 1995. ch. Some examples of problem solving by using the symbolic viewpoint when dealing with polynomial systems of equations, pp. 102-116
31. Gonzalez-Vega, L.: Applying quantifier elimination to the Birkhoff interpolation problem. Journal of Symbolic Computation 22, 83-104 (1996)
32. Grigoriev, D., Vorobjov, N.: Bounds on numbers of vectors of multiplicities for polynomials which are easy to compute. In Proceedings of ISSAC 2000 (2000). ACM Press, pp. 137-145
33. Heintz, J.: Definability and fast quantifier elimination in algebraically closed fields. Theoretical Computer Science 24(3), 239-277 (1983)
34. Heintz, J., Krick, T., Puddu, S., Sabia, J., Waissbein, A.: Deformation techniques for efficient polynomial equation solving. Journal of Complexity 16(1), 70-109 (2000)
35. Heintz, J., Matera, G., Waissbein, A., On the time-space complexity of geometric elimination procedures. AAECC 11, 239-296 (2001)
36. Heintz, J., Roy, M.-F., Solernó, P.: On the complexity of semi-algebraic sets. In Proc. IFIP 89, San Francisco (1989), North-Holland, pp. 293-298
37. Heintz, J., Roy, M. -F., Solernó, P.: On the theoretical and practical complexity of the existential theory of the reals. Comput. J. 36(5), 427-431 (1993)
38. Krick, T., Pardo, L. M., Sombra, M.: Sharp estimates for the arithmetic Nullstellensatz. In Proceedings of EACA'99, (1999)
39. Kronecker, L.: Grundzüge einer arithmetischen Theorie der algebraischen Grössen. J. reine angew. Math. 92, 1-122 (1882)
40. Lecerf, G.: Kronecker, a package for Magma for polynomial system solving. UMS MEDICIS, Laboratoire GAGE, http://kronecker.medicis.polytechnique.fr/, 1999
41. Lecerf, G.: Quadratic Newton iteration for systems with multiplicity. Manuscript, Laboratoire GAGE, École polytechnique, France, April 2001
42. Lecerf, G., Schost, É.: Fast multivariate power series multiplication in characteristic zero. Manuscript, Laboratoire GAGE, École polytechnique, France, April 2001
43. Leverrier, U. J. J.: Sur les variations séculaires des éléments elliptiques des sept planètes principales: Mercure, Venus, la terre, Mars, Jupiter, Saturne et Uranus. Journal de Mathématiques Pures et Appliquées 4, 220-254 (1840)
44. Macaulay, F. S.: The Algebraic Theory of Modular Systems. Cambridge University Press, 1916
45. Montes, A.: A new algorithm for discussing Gröbner bases with parameters. Journal of Symbolic Computation 33(2), 183-208 (2002)
46. Morrison, S.: The differential ideal [P]: M∞. Journal of Symbolic Computation 28, 631-656 (1999)
47. Mourrain, B., Pan, V.: Multivariate polynomials, duality and structured matrices. Journal of Complexity 16(1), 110-180 (2000)
48. Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. Part I. Journal of Symbolic Computation 13(3), 255-299 (1992)
49. Rojas, J.: Computing complex dimension faster and deterministically. Tech. rep., Department of Mathematics, City University of Hong Kong, 2000
50. Rouillier, F.: Solving zero-dimensional systems through the Rational Univariate Representation. AAECC 9(5), 433-461 (1999)
51. Rouillier, F., Roy, M., Safey el Din, M.: Finding at least one point in each connected component of a real algebraic set defined by a single equation. Journal of Complexity 16(4), 716-750 (2000)
52. Rouillier, F., Safey el Din, M., Schost, É.: Solving the Birkhoff interpolation problem via the critical point method: an experimental study. In Proceedings of ADG 2000 (2001), Vol. 2061 of Lecture Notes in Artificial Intelligence, Springer
53. Sabia, J., Solernó, P.: Bounds for traces in complete intersections and degrees in the Nullstellensatz. AAECC 6, 353-376 (1996)
54. Sakata, S.: Extension of the Berlekamp-Massey algorithm to n dimensions. Information and Computation 84, 207-239 (1990)
55. Schönhage, A.: Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2. Acta Informatica, 7, 395-398 (1977)
56. Schönhage,A., Strassen, V.: Schnelle Multiplikation großer Zahlen. Computing 7, 281-292 (1971)
57. Schoof, R.: Elliptic curves over finite fields and the computation of square roots mod p. Mathematics of Computation 44, 483-494 (1985)
58. Schost, É.: Sur la résolution des systèmes polynomiaux à paramètres. PhD thesis, École polytechnique, 2000
59. Schost, È.: Degree bounds and lifting techniques for triangular sets. In Proceedings of ISSAC 2002, (2002)
60. Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM 27(4), 701-717 (1980)
61. Shoup, V.: Efficient computation of minimal polynomials in algebraic extensions of finite fields. In Proceedings of ISSAC'99 (1999), ACM Press, pp. 53-58
62. Thue, A.: Et par andtydninger til en talteoretisk methode. Christiana 7 (1902)
63. Trinks, W.: On improving approximate results of Buchberger's algorithm by Newton's method. In Proceedings of EUROCAL'85 (1985) Vol. 204 in Lecture Notes in Computer Science, Springer pp. 608-611
64. von zur Gathen, J., Gerhard, J.: Modern computer algebra. Cambridge University Press. 1999
65. Weispfenning, V.: Comprehensive Gröbner bases. Journal of Symbolic Computation 14(1), 1-30 (1992)
66. Winkler, F.: A p-adic approach to the computation of Gröbner bases. Journal of Symbolic Computation 6, 287-304 (1988)
67. Zippel, R.: Probabilistic algorithms for sparse polynomials. In Proceedings of EURO-SAM'79 (1979), Vol. 72 in Lecture Notes in Computer Science, Springer, pp. 216-226