Polynomial equation solving by lifting procedures for ramified fibers

Theoretical Computer Science

Volumn 315, Issue 2-3, 2004, Pages 335-369

  Bompadre, A ^a,d   Matera, G ^b,c   Wachenchauzer, R ^a   Waissbein, A ^a  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b INSTITUTO DE CIENCIAS   (Argentina)

^c Facultad de Ciencias Naturales e Instituto M Lillo   (Argentina)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Efficient polynomial equation solving; Newton Hensel lifting; Puiseux expansions of space curves; Ramified fibers of dominant mappings

Indexed keywords

ALGEBRA; ALGORITHMS; ITERATIVE METHODS; PARAMETER ESTIMATION; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

EFFICIENT POLYNOMIAL EQUATION SOLVING; NEWTON-HENSEL LIFTING; PUISEUX EXPANSIONS OF SPACE CURVES; RAMIFIED FIBERS OF DOMINANT MAPPINGS;

POLYNOMIALS;

EID: 2042544102     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.01.015     Document Type: Article

References (68)

1. E. Allgower, K. Georg, Numerical Continuation Methods: An Introduction, Springer Series in Computational Mathematics, Vol. 13, Springer, Heidelberg, 1990.
2. M. Alonso, E. Becker, M.-F. Roy, T. Wörmann, Zeroes, multiplicities and idempotents for zerodimensional systems, in: L. González-Vega, T. Recio (Eds.), Algorithms in Algebraic Geometry and Applications Progress in Mathematics, Vol. 143, Birkhäuser, Basel, 1996, pp. 1-15.
3. M. Alonso, G. Niesi, T. Mora, M. Raimondo, Local parametrizations of space curves at singular points, in: I. Herman, C. Pienovi (Eds.), Computer Graphics and Mathematics, Springer Eurographic Seminar Series, Springer, Berlin Heidelberg, New York, 1991, pp. 61-90.
4. M. Alonso, G. Niesi, T. Mora, M. Raimondo, An algorithm for computing analytic branches of space curves at singular points, in: W.-T. Wu, M.-D. Cheng (Eds.), Proc. 1992 International Workshop on Mathematical Mechanization, Int. Academic Pub., 1992, pp. 135-166.
5. M. Artin, Lectures on deformation of singularities, Tata Inst. Fund. Res., 1976.
6. D. Bayer, D. Mumford, What can be computed in algebraic geometry? in: D. Eisenbud, L. Robbiano (Eds.), Computational Algebraic Geometry and Commutative Algebra, Symp. Mathematics, XXXIV, Cambridge University Press, Cambridge, 1993, pp. 1-49.
7. T. Becker, V. Weispfenning, Gröbner bases, A Computational Approach to Commutative Algebra, Springer Graduate Texts in Mathematics, Vol. 141, Springer, Berlin, Heidelberg, New York, 1993.
8. D. Bini, B. Mourrain, Polynomial test suite, http://www-sop.inria.fr/ saga.
9. Bini D., Pan V. Polynomial and Matrix Computations. 1994;Birkhäuser, Basel.
10. Blum L., Cucker F., Shub M., Smale S. Complexity and Real Computation. 1998;Springer, New York, Berlin, Heidelberg.
11. A. Bompadre, Un problema de eliminación geométrica en sistemas de Pham-Brieskorn, Master's Thesis, Fac. Cs. Exactas y Nat., Universidad de Buenos Aires, 2000.
12. A. Bompadre, G. Matera, R. Wachenchauzer, A. Waissbein, Lifting procedures for ramified fibers and polynomial equation solving, in: M. Fri;́as, J. Heintz (Eds.), Proc. Workshop Argentino de Informática Teórica, WAIT'01, Buenos Aires, September 2001, Vol. 30 Anales JAIIO, Buenos Aires, 2001, pp. 13-31.
13. Bonder J.F., Rossi J. Blow-up vs. spurious steady solutions. Proc. Amer. Math. Soc. 129(1):2001;139-144.
14. A. Borodin, Time space tradeoffs (getting closer to the barriers?), in: 4th Internat. Symp. on Algorithms and Computation, ISAAC '93, Hong Kong, December 1993, Lecture Notes in Computer Science, Vol. 762, Springer, Berlin, 1993, pp. 209-220.
15. P. Bürgisser, M. Clausen, M. Shokrollahi, Algebraic Complexity Theory, Grundlehren der mathematischen Wissenschaften, Vol. 315, Springer, Berlin, Heidelberg, New York, 1997.
16. D. Castro, M. Giusti, J. Heintz, G. Matera, L.M. Pardo, The hardness of polynomial equation solving, Found. Comput. Math. 3 (4) (2003) 347-420.
17. Chipot M., Fila M., Quittner P. Stationary solutions, blow up and convergence to stationary solutions for semilinear parabolic equations with nonlinear boundary conditions. Acta Math. Univ. Comenianae. 60(1):1991;35-103.
18. A. Chistov, D. Grigoriev, Subexponential time solving systems of algebraic equations I, II, LOMI preprints E-9-83, E-10-83, Steklov Institute, Leningrad, 1983.
19. Cox D., Little J., O'Shea D. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, Undergraduate Texts in Mathematics. 1992;Springer, Berlin, Heidelberg, New York.
20. D. Cox, J. Little, D. O'Shea, Using Algebraic Geometry, Graduate Texts in Mathematics, Vol. 185, Springer, Berlin, Heidelberg, New York, 1998.
21. D. Cox, B. Sturmfels, Applications of computational algebraic geometry, Vol. 53, Proc. Symp. Applied Mathematics, AMS, Providence, RI, 1998.
22. Danilov V. Algebraic varieties and schemes. Shafarevich I. Algebraic Geometry I. Encyclopedia Mathematics Sciences. Vol. 23:1994;167-297 Springer, Berlin.
23. Duval D. Rational Puiseux expansions. Compositio Math. 70:1989;119-154.
24. D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry, Graduate Texts in Mathematics, Vol. 150, Springer, Berlin, Heidelberg, New York, 1995.
25. Ferreira R., Groisman P., Rossi J. Numerical blow-up for a nonlinear problem with a nonlinear boundary condition. Math. Models Methods Appl. Sci. 12(4):2002;461-484.
26. W. Fulton, Intersection Theory, Springer, Berlin, Heidelberg, New York, 1984.
27. P. Gianni, T. Mora, Algebraic solution of systems of polynomial equations using Gröbner bases, in: L. Huguet, A. Poli (Eds.), Proc. AAECC-5, Menorca, Spain, June 1987, Lecture Notes in Computer Science, Vol. 356, Springer, Berlin, 1989, pp. 247-257.
28. Giusti M., Hägele K., Heintz J., Morais J.E., Montaña J.L., Pardo L.M. Lower bounds for Diophantine approximation. J. Pure Appl. Algebra. 117(118):1997;277-317.
29. M. Giusti, J. Heintz, La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial, in: D. Eisenbud, L. Robbiano (Eds.), Computational Algebraic Geometry and Commutative Algebra, Symposia Mathematica XXXIV, Cambridge University Press, Cambridge, MA, 1993, pp. 216-256.
30. Giusti M., Heintz J., Morais J.E., Morgenstern J., Pardo L.M. Straight-line programs in geometric elimination theory. J. Pure Appl. Algebra. 124:1998;101-146.
31. M. Giusti, J. Heintz, J.E. Morais, L.M. Pardo, When polynomial equation systems can be solved fast? in: G. Cohen, M. Giusti, T. Mora (Eds.), Proc. AAECC-11, Lecture Notes in Computer Science, Vol. 948, Springer, Berlin, 1995, pp. 205-231.
32. Giusti M., Heintz J., Morais J.E., Pardo L.M. Le rôle des structures de données dans les problèmes d'élimination. C. R. Acad. Sci. Paris. 325:1997;1223-1228.
33. Giusti M., Lecerf G., Salvy B. A Gröbner free alternative for polynomial system solving. J. Complexity. 17(1):2001;154-211.
34. M. Gonzalez-Lopez, L. Gonzalez-Vega, Newton identities in the multivariate case: Pham systems, in: B. Buchberger, et al. (Eds.), Gröbner Bases and Applications, London Math. SLNS 251, Cambridge University Press, Cambridge, MA, 1998, pp. 351-366.
35. Gonzalez-Vega L. A special quantifier elimination algorithm for Pham systems. Detzell et al. C. Real algebraic geometry and ordered structures. Contemporary Mathematics. Vol. 253:1998;115-366 AMS, Providence, RI.
36. Heintz J. Definability and fast quantifier elimination in algebraically closed fields. Theoret. Comput. Sci. 24(3):1983;239-277.
37. J. Heintz, On the computational complexity of polynomials and bilinear mappings. A survey, in: L. Huguet, A. Poli (Eds.), Proc. AAECC-5, Menorca, Spain, June 1987, Lecture Notes in Computer Science, Vol. 356, Springer, Berlin, 1989, pp. 269-300.
38. J. Heintz, G. Jerónimo, J. Sabia, J. San Marti;́n, P. Solernó, On the multihomogeneous Bézout theorem, in: Intersection Theory and Deformation Algorithms. The multihomogeneous case, manuscript Universidad de Buenos Aires, 2002.
39. Heintz J., Krick T., Puddu S., Sabia J., Waissbein A. Deformation techniques for efficient polynomial equation solving. J. Complexity. 16(1):2000;70-109.
40. Heintz J., Matera G., Waissbein A. On the time-space complexity of geometric elimination procedures. Appl. Algebra Engrg. Comm. Comp. 11(4):2001;239-296.
41. Henry D. Geometric Theory of Semilinear Parabolic Equations. Lecture Notes in Mathematics. Vol. 840:1981;Springer, Berlin, Heideilberg.
42. Huber B., Sturmfels B. A polyhedral method for solving sparse polynomial systems. Math. Comput. 64(112):1995;1541-1555.
43. Algorithms in Algebraic Geometry and Applications. Krick T., Pardo L.M. A computational method for Diophantine approximation. González-Vega L., Recio T. Algorithms in Algebraic Geometry and Applications. Progress in Mathematics. Vol. 143:1996;193-254 Birkhäuser, Basel.
44. Kronecker L. Grundzüge einer arithmetischen Theorie der algebraischen Grössen. J. Reine Angew. Math. 92:1882;1-122.
45. Kunz E. Introduction to Commutative Algebra and Algebraic Geometry. 1985;Birkhäuser, Boston.
46. Lickteig T., Roy M.-F. Cauchy index computation. Calcolo. 33:1997;337-351.
47. Macaulay F.S. The Algebraic Theory of Modular Systems. 1916;Cambridge University Press, Cambridge.
48. Matsumura H. Commutative Ring Theory. 1986;Cambridge University Press, Cambridge.
49. T. Mora, G. Pfister, C. Traverso, An introduction to the tangent cone algorithm, in: C. Hoffmann (Ed.), Issues in robotics and non-linear geometry, Vol. 6 of Advances in Computing Research, JAI Press, Greenwich CT, 1992, pp. 199-270.
50. B. Mourrain, V. Pan, Solving special polynomial systems by using structural matrices and algebraic residues, in: F. Cucker, M. Shub (Eds.), Proc. FOCM'97, Springer, Berlin, Heidelberg, New York, 1997, pp. 287-304.
51. Mourrain B., Pan V. Multivariate polynomials, duality and structured matrices. J. Complexity. 16(1):2000;110-180.
52. L.M. Pardo, How lower and upper complexity bounds meet in elimination theory, in: G. Cohen, M. Giusti, T. Mora (Eds.), Proc. AAECC-11, Lecture Notes in Computer Science, Vol. 948, Springer, Berlin, Heidelberg, New York, 1995, pp. 33-69.
53. L.M. Pardo, J. San Marti;́n, Deformation techniques to solve generalized Pham systems, Theoret. Comput. Sci., this Vol. (2004).
54. Renegar J. On the computational complexity and geometry of the first order theory of the reals I, II, III. J. Symbolic Comput. 13(3):1992;255-352.
55. W. Rheinboldt, Methods for solving systems of nonlinear equations, CBMS-NSF Regional Conf. Series in Applied Mathematics, Vol. 70, SIAM, Philadelphia, 1998.
56. Rouillier F. Solving zero-dimensional systems throught rational univariate representation. Appl. Algebra Engrg. Comm. Comp. 9(5):1997;433-461.
57. Savage J. Models of Computation. Exploring the Power of Computing. 1998;Addison Wesley, Reading, MA.
58. Schost E. Computing parametric geometric resolutions. Appl. Algebra Engrg. Comm. Comp. 13:2003;349-393.
59. Schwartz J. Fast probabilistic algorithms for verification of polynomial identities. J. ACM. 27(4):1980;701-717.
60. Shafarevich I. Basic Algebraic Geometry: Varieties in Projective Space. 1994;Springer, Berlin, Heidelberg, New York.
61. V. Strassen, Algebraic complexity theory, in: van Leeuwen, J. (Ed.), Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 634-671 (Chapter 11).
62. Sturmfels B. Solving Systems of Polynomial Equations, CBMS Regional Conference Series in Mathematics. 2002;AMS, Providence, RI.
63. J. von zur Gathen, Parallel arithmetic computations: a survey, in: B.R.J. Gruska, J. Wiedermann (Eds.), Proc. 12th Symp. MFCS, Bratislava, Czechoslovakia, 1986, Lecture Notes in Computer Science, Vol. 233, Springer, Berlin, 1986, pp. 93-112.
64. Walker R. Algebraic Curves. 1950;Dover Publications Inc. New York.
65. Walsh P. On the complexity of rational Puiseux expansions. Pacific J. Math. 188(2):1999;369-387.
66. Walsh P. A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic, function. Math. Comput. 69(231):2000;1167-1182.
67. Zariski O. Algebraic Surfaces. 1995;Springer, Berlin, Heidelberg, New York.
68. R. Zippel, Probabilistic algorithms for sparse polynomials, in: Proc. EUROSAM'79, Marseille 1979, Lecture Notes in Computer Science, Vol. 72, Springer, Berlin, 1979, pp. 216-226.