Deformation techniques to solve generalised Pham systems

Theoretical Computer Science

Volumn 315, Issue 2-3, 2004, Pages 593-625

  Pardo, Luis Miguel ^a   Martín, Jorge San ^b  

^a UNIVERSITY OF CANTABRIA   (Spain)

^b UNIVERSIDAD REY JUAN CARLOS   (Spain)

Author keywords

Generalised Pham system; Geometric degree; Homotopic deformation; Universal algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; ITERATIVE METHODS; SET THEORY; THEOREM PROVING;

GENERALISED PHAM SYSTEMS; GEOMETRIC DEGREES; HOMOTOPIC DEFORMATION; UNIVERSAL ALGORITHMS;

POLYNOMIAL APPROXIMATION;

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

References (63)

1. Berkowitz S.J. On computing the determinant in small parallel time using a small number of processors. Inform. Process. Lett. 18:1984;147-150.
2. Bernstein D.N., Kušnirenko A.G., Hovanskiǐ A.G. Newton polyhedra. Uspehi Mat. Nauk. 31(3189):1976;201-202.
3. A. Bompadre, Un problema de eliminación geométrica en sistemas de Pham-Brieskorn, Master's Thesis, Universidad de Buenos Aires, Argentina, 2000.
4. Castro D., Giusti M., Heintz J., Matera G., Pardo L.M. The hardness of polynomial equation solving. Found. Comput. Math. 3:2003;347-420.
5. Castro D., Hägele K., Morais J.E., Pardo L.M. Kronecker's and Newton's approaches to solving. a first comparison J. Complexity. 17(1):2001;212-303.
6. E. Cattani, A. Dickenstein, B. Sturmfels, Computing multidimensional residues, in: T. Recio, L. Conzalez (Eds.), Algorithms in Algebraic Geometry and Applications, Birkhäuser, Basel, 1996, pp. 135-164.
7. Cohen S.D. The distribution of Galois groups and Hilbert's irreducibility theorem. Proc. London Math. Soc. (3). 43(2):1981;227-250.
8. Csanky L. Fast parallel matrix inversion algorithms. SIAM J. Comput. 5:1976;618-623.
9. Fulton W. Intersection Theory, Ergebnisse der Mathematik, 3 Folge Band 2. 1984;Springer, Berlin.
10. García C.B., Zangwill W.I. Pathways to Solutions, Fixed Points, and Equilibria. 1981;Prentice-Hall, Englewood Cliffs, NJ.
11. 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: Computational Algebraic Geometry and Commutative Algebra, Cortona, 1991, Symp. Mathematics XXXIV, Cambridge University Press, Cambridge, 1993, pp. 216-256.
12. Giusti M., Heintz J., Hägele K., Morais J.E., Pardo L.M., Montaña J.L. Lower bounds for Diophantine approximations. J. Pure Appl. Algebra. 117/118:1997;277-317.
13. Giusti M., Heintz J., Morais J.E., Morgenstern J., Pardo L.M. Straight-line programs in geometric elimination theory. J. Pure Appl. Algebra. 124(1-3):1998;101-146.
14. M. Giusti, J. Heintz, J.E. Morais, L.M. Pardo, When polynomial equation systems can be "solved" fast? in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Paris, 1995, Lecture Notes on Computer Science, Vol. 948, Springer, Berlin, 1995, pp. 205-231.
15. 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 Sér. I Math. 325(11):1997;1223-1228.
16. Giusti M., Heintz J., Sabia J. On the efficiency of effective Nullstellensätze. Comput. Complexity. 3(1):1993;56-95.
17. Giusti M., Lecerf G., Salvy B. A Gröbner free alternative for polynomial system solving. J. Complexity. 17(1):2001;154-211.
18. M. Giusti, É. Schost, Solving some overdetermined polynomial systems, in: Proc. 1999 Internat. Symp. on Symbolic and Algebraic Computation, Vancouver, BC, ACM, New York, 1999, pp. 1-8 (electronic).
19. Grigoriev D.Yu. Factorization of polynomials over a finite field and the solution of systems of algebraic equations. Zapiski Nauchnykh Seminarov Leningradskigi Otdeleniya Matematicheskogo Instituta. 137:1984;20-79.
20. Gunning R.C., Rossi H. Analytic Functions of Several Complex Variables. 1965;Prentice-Hall Inc. Englewood Cliffs, NJ.
21. Hägele K., Morais J.E., Pardo L.M., Sombra M. On the intrinsic complexity of the arithmetic Nullstellensatz. J. Pure Appl. Algebra. 146(2):2000;103-183.
22. Hartshorne R. Algebraic Geometry. 1977;Springer, New York.
23. Heintz J. Definability and fast quantifier elimination in algebraically closed fields. Theoret. Comput. Sci. 24(3):1983;239-277.
24. Heintz J., Krick T., Puddu S., Sabia J., Waissbein A. Deformation techniques for efficient polynomial equation solving. J. Complexity. 16(1):2000;70-109.
25. Heintz J., Matera G., Pardo L.M., Wachenchauzer R. The intrinsic complexity of parametric elimination methods. Electron. J. SADIO. 1(1):1998;37-51. (electronic).
26. Heintz J., Matera G., Waissbein A. On the time-space complexity of geometric elimination procedures. Appl. Algebra Eng. Comm. Comput. 11(4):2001;239-296.
27. J. Heintz, C.P. Schnorr, Testing polynomials which are easy to compute, in: Logic and Algorithmic, Monograph. Enseign. Math. 30, Univ. Genève, Geneva, 1982, pp. 237-254.
28. Kaltofen E. Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization. SIAM J. Comput. 14(2):1985;469-489.
29. Kaltofen E. Factorization of polynomials given by straight-line programs. Micali S. Randomness and Computation. Advances in Computing Research. Vol. 5:1989;375-412 JAI Press Inc. Greenwitch, CT.
30. Kannan R., Lenstra A.K., Lovász L. Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers. Math. Comput. 50(181):1988;235-250.
31. T. Krick, L.M. Pardo, A computational method for Diophantine approximation, in: T. Recio, L. Conzalez (Eds.), Algorithms in Algebraic Geometry and Applications, Birkhäuser, Basel, 1996, pp. 193-253.
32. Krick T., Pardo L.M., Sombra M. Sharp estimates for the arithmetic Nullstellensatz. Duke Math. J. 109(3):2001;521-598.
33. Kronecker L. Grundzüge einer arithmetischen theorie de algebraischen grössen. J. Reine Angew. Math. 92:1882;1-122.
34. G. Lecerf, Une alternative aux méthodes de réécriture pour la résolution des systèmes algébriques, Ph.D. Thesis, École polytechnique, Palaiseau, France, 2001.
35. Lenstra A.K., Lenstra H.W. Jr., Lovász L. Factoring polynomials with rational coefficients. Math. Ann. 261(4):1982;515-534.
36. Matsumura H. Commutative Algebra. 2nd Edition:1980;Benjamin/Cummings Publishing Co., Inc. Reading, MA.
37. B. Mourrain, V.Y. Pan, Solving special polynomial systems by using structured matrices and algebraic residues, in: F. Cucker, M. Shub (Eds.), Foundations of Computational Mathematics, Springer, Berlin, 1997, pp. 287-304.
38. Mourrain B., Pan V.Y. Multivariate polynomials, duality, and structured matrices. J. Complexity. 16(1):2000;110-180.
39. Mulmuley K. A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Combinatoria. 7(1):1987;101-104.
40. Pan V.Y., Rami Y., Wang X. Structured matrices and Newton's iteration. unified approach Linear Algebra Appl. 343/344:2002;233-265.
41. L.M. Pardo, How lower and upper complexity bounds meet in elimination theory, in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Paris, 1995), Lecture Notes in Computer Science, Vol. 948, Springer, Berlin, 1995, pp. 33-69.
42. L.M. Pardo, Universal elimination requires exponential running time (extended abstract), in: Proceedings EACA'2000, 2000, pp. 25-51.
43. Rojas J.M. Some speed-ups and speed limits for real algebraic geometry. J. Complexity. 16(3):2000;552-571.
44. Sabia J., Solernó P. Bounds for traces in complete intersections and degrees in the Nullstellensatz. Appl. Algebra Eng. Comm. Comput. 6(6):1995;353-376.
45. Schwartz J.T. Fast probabilistic algorithms for verfication of polynomial identities. J. ACM. 27(4):1980;701-717.
46. I.R. Shafarevich, Basic Algebraic Geometry, Vol. 1, 2nd Edition, Springer, Berlin, 1994.
47. Shub M., Smale S. Complexity of Bézout's theorem I. geometric aspects J. AMS. 6(2):1993;459-501.
48. M. Shub, S. Smale, Complexity of Bézout's theorem II: volumes and probabilities, in: Proceedings of the Effective Methods in Algebraic Geometry, Progress of Mathematics, Vol. 109, Birkhäuser, Basel, 1993, pp. 267-285.
49. Shub M., Smale S. Complexity of Bézout's theorem III. condition number and packing J. Complexity. 9:1993;4-14.
50. Shub M., Smale S. Complexity of Bézout's theorem V. polynomial time Theoret. Comput. Sci. 133:1994;141-164.
51. Shub M., Smale S. Complexity of Bezout's theorem. IV. probability of success and extensions. SIAM J. Numer. Anal. 33(1):1996;128-148.
52. Smale S. The fundamental theorem of algebra and complexity theory. Bull. Amer. Math. Soc. (N.S.). 4(1):1981;1-36.
53. Sommese A.J., Verschelde J., Wampler C.W. Numerical decomposition of the solution sets of polynomial systems into irreducible components. SIAM J. Numer. Anal. 38(6):2001;2022-2046. (electronic).
54. A.J. Sommese, J. Verschelde, C.W. Wampler, Numerical irreducible decomposition using projections from points on the components, in: Symbolic Computation: Solving Equations in Algebra, Geometry, and Engineering, Contemporary Mathematics, Vol. 286, American Mathematical Society, Providence, RI, 2001, pp. 37-51.
55. Strassen V. Vermeidung von divisionen. Crelle J. Reine Angew. Math. 264:1973;184-202.
56. V. Strassen, Algebraic complexity theory, in: Handbook of Theoretical Computer Science, Vol. A, Elsevier Amsterdam, 1990, pp. 633-672.
57. B. Sturmfels, Solving Systems of Polynomial Equations, CBMS Regional Conference Series in Mathematics, Vol. 97, Published for the Conf. Board of the Mathematical Sciences, Washington, DC, 2002.
58. Verschelde J. Toric Newton method for polynomial homotopies. J. Symbolic Comput. 29(4-5):2000;777-793.
59. Verschelde J., Verlinden P., Cools R. Homotopies exploiting Newton polytopes for solving sparse polynomial systems. SIAM J. Numer. Anal. 31(3):1994;915-930.
60. Vogel W. Lectures Notes on Bézout's Theorem. Tata Lectures Notes. Vol. 74:1984;Springer, Berlin.
61. O. Zariski, P. Samuel, Commutative Algebra II, Graduate Texts in Mathematics, Vol. 39, Springer, Berlin, 1960.
62. R. Zippel, Probabilistic algorithms for sparse polynomials, in: Proceedings EUROSAM'79, 1979, pp. 216-226.
63. Zippel R. Effective Polynomial Computation. 1993;Kluwer Academic Publishers, Dordrecht.