Kronecker's and Newton's approaches to solving: A first comparison

Journal of Complexity

Volumn 17, Issue 1, 2001, Pages 212-303

  Castro, D ^a   Pardo, L M ^a   Hagele K ^b   Morais, J E ^c  

^a UNIVERSITY OF CANTABRIA   (Spain)

^b TRINITY COLLEGE DUBLIN   (Ireland)

^c PUBLIC UNIVERSITY OF NAVARRE   (Spain)

Author keywords

Approximate zero; Degree of algebraic varieties; Height of diophantine varieties; Kronecker's solution; Newton operator; Straight line programs; Turing machine complexity

Indexed keywords

EID: 0035294748     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.2000.0572     Document Type: Article

References (108)

1. Adleman L. M., Huang M.-D. A. Primality Testing and Abelian Varieties over Finite Fields. 1992;Springer-Verlag, Berlin.
2. Artin E. Algebraic Numbers and Algebraic Functions, I. 1951;New York UniversityInstitute for Mathematics and Mechanics, New York.
3. Atkin A. O. L., Morain F. Elliptic curves and primality proving. Math. Comp. 61:1993;29-68.
4. Balcázar J. L., Díaz J., Gabarró J. Structural Complexity, I. EATCS. 11:1988;Springer-Verlag, New York/Berlin.
5. Bernstein D. N. The number of roots of a system of equations. Funktsional Anal. i Prilozhen. 9:1975;1-4.
6. Blum L., Cucker F., Shub M., Smale S. Algebraic settings for the problem "p≠np?" The Mathematics of Numerical Analysis, Park City, UT, 1995. 1996;Amer. Math. Soc. Providence. p. 125-144.
7. Blum L., Cucker F., Shub M., Smale S. Complexity and Real Computation. 1988;Springer-Verlag, New York.
8. Bombieri E., Van der Poorten A. J., Vaaler J. D. Effective measures of irrationality for cubic extensions of number fields. Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4). 23:1996;211-248.
9. J.-B. Bost, H. Gillet, and, C. Soulé, Heights of projective varieties and positive green forms, manuscript, I.H.E.S, 1993.
10. q[X]. Rev. CETHEDEC Cahier. 2:1982;5-21.
11. Camion P. F. Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials. IEEE Trans. Inform. Theory. 29:1983;378-385.
12. Cantor D. G., Zassenhaus H. A new algorithm for factoring polynomials over finite fields. Math. Comp. 36:1981;587-592.
13. Cassels J. W. S. An Introduction to the Geometry of Numbers. 1997;Springer-Verlag, Berlin.
14. D. Castro, M. Giusti, J. Heintz, G. Matera, and, L. M. Pardo, Data structures and smooth interpolation procedures in elimination theory, manuscript, 1999.
15. Ciarlet P. G. Introduction à l'analyse numérique matricielle et à l'optimisation. 1982;Masson, Paris.
16. J. P. Dedieu, and, M. Shub, Newton's method for overdetermined systems of equations, Math. Comp, in press.
17. Dedieu J. P. Approximate solutions of numerical problems, condition number analysis and condition number theorem. The Mathematics of Numerical Analysis, Park City, UT, 1995. 1996;Amer. Math. Soc. Providence. p. 263-283.
18. Dedieu J. P. Condition number analysis for sparse polynomial systems. Foundations of Computational Mathematics, Rio de Janeiro, 1997. 1997;Springer-Verlag, Berlin. p. 75-101.
19. Dedieu J. P. Condition operators, condition numbers, and condition number theory for the generalized eigenvalue problem. Linear Algebra Appl. 263:1997;1-24.
20. Dedieu J. P. Estimations for the separation number of a polynomial system. J. Symbolic Comput. 24:1997;683-693.
21. J. P. Dedieu, and, M. Shub, On simple double zeros and badly conditioned zeros of analytic functions of n variables, Math. Comp.
22. Dedieu J. P., Smale S. Some lower bounds for the complexity of continuation methods. J. Complexity. 14:1998;454-465.
23. Demazure M. Catastrophes et Bifurcations. 1989;Ellipses-X École Polytechnique.
24. Dixon J. Exact solution of linear equations using p-adic expansions. Numer. Math. 40:1982;137-141.
25. Ducos L. Effectivité en Théorie de Galois, Sous-resultants. 1997;Université de Poitiers.
26. Eckardt C., Young G. The approximation of one matrix by another of lower rank. Psychometrika. 1:1936;211-218.
27. Fitchas N., Giusti M., Smietanski F. Sur la complexité du théorème des zéros. Guddat J. Approximation and Optimization in the Caribbean II, Proceedings 2nd Int. Conf. on Non-Linear Optimization and Approximation. Approximation and Optimization. 8:1995;247-329 Peter Lange Verlag, Frankfurt am Main.
28. Fulton W. Intersection Theory. Ergebnisse der Mathematik. 3:1984;Springer-Verlag, New York/Berlin.
29. 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.
30. Giusti M., Heintz J. Algorithmes - disons rapides - pour la décomposition d'une variété algébrique en composantes irréductibles et équidimensionelles. Mora T., Traverso C. Proceedings of MEGA'90. Progress in Mathematics. 94:1991;169-194 Birkhäuser, Basel.
31. Giusti M., Heintz J. La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial. Eisenbud D., Robbiano L. Computational Algebraic Geometry and Commutative Algebra. Symposia Matematica. 34:1993;216-256 Cambridge Univ. Press, Cambridge.
32. 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.
33. Giusti M., Heintz J., Morais J. E., Pardo L. M. When polynomial equation systems can be solved fast? Cohen G., Giusti H., Mora T. Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proceedings AAECC-11. Lecture Notes in Comput. Sci. 948:1995;205-231 Springer-Verlag, New York/Berlin.
34. 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.
35. M. Giusti, and, E. Schost, Solving some over-determined systems, in, Proc. ISSAC, 1999, in press.
36. Hägele K. Intrinsic Height Estimates for the Nullstellensatz. 1998;Universidad de Cantabria, Santander.
37. K. Hägele, and, J. L. Montaña, Polynomial random test for the equivalence problem of integers given by arithmetic circuits, preprint 4/97, Depto. Matemáticas, Universidad de Cantabria, Santander, Spain, January 1997.
38. Hägele K., Morais J. E., Pardo L. M., Sombra M. On the intrinsic complexity of arithmetic nullstellensatz. J. Pure Appl. Algebra. 146:2000;103-183.
39. Heintz J. Definability and fast quantifier elimination in algebraically closed fields. Theoret. Comput. Sci. 24:1983;239-277.
40. Heintz J. On the computational complexity of polynomials and bilinear mappings: A survey. Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proceedings of AAECC-5. Lecture Notes in Comput. Sci. 356:1989;Springer-Verlag, New York/Berlin. p. 269-300.
41. Heintz J., Schnorr C. P. Testing polynomials which are easy to compute. Logic and Algorithmic. Monographie de l'Enseignement Mathématique. 30:1982;. p. 237-254.
42. Ibarra O. H., Moran S. Equivalence of straight-line programs. J. Assoc. Comput. Mach. 30:1983;217-228.
43. Kaltofen E. Polynomial factorization 1982-1986. Computers in Mathematics, Stanford, CA, 1986. 1990;Dekker, New York. p. 285-309.
44. Kaltofen E. Polynomial factorization 1987-1991. Simon I. Proceedings of the 1st Latin American Symposium on Theoretical Informatics LATIN '92, São P.o, Brazil, April 1992. Lecture Notes in Comput. Sci. 583:1992;294-313 Springer-Verlag, New York/Berlin.
45. Kannan R., Lenstra A. K., Lovasz L. Polynomial factorization and non-randomness of bits of algebraic and some transcendental numbers. Proceedings of the 16th Ann. ACM Symposium on Theory of Computing, Washington, DC. 1984;ACM Press, New York. p. 191-200.
46. Kannan R., Lenstra A. K., Lovász L. Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers. Math. Comp. 50:1988;235-250.
47. Kim M.-H. Computational Complexity of the Euler Type Algorithms for the Roots of Complex Polynomials. 1985;The City University of New York.
48. Kim M.-H. On approximate zeros and rootfinding algorithms for a complex polynomial. Math. Comp. 51:1988;707-719.
49. Kim M.-H. Topological complexity of a root finding algorithm. J. Complexity. 5:1989;331-344.
50. König J. Einleitung in die allgemeine Theorie der algebraischen Grözen. 1903;Teubner, Leipzig.
51. Krick T., Pardo L. M. Une approche informatique pour l'approximation diophantienne. C.R. Acad. Sci. Paris. 318:1994;407-412.
52. Krick T., Pardo L. M. A computational method for diophantine approximation. González-Vega L., Recio T. Algorithms in Algebraic Geometry and Applications, Proceedings of MEGA'94. Progress in Mathematics. 143:1996;193-254 Birkhäuser, Basel.
53. Kronecker L. Grundzüge einer arithmetischen theorie de algebraischen grössen. J. Reine Angew. Math. 92:1882;1-122.
54. Kushnirenko A. G. Newton polytopes and the bezout theorem. Funktsional. Anal. i Prilozhen. 10:1976.
55. Landau S. Factoring polynomials over algebraic number fields. SIAM J. Comput. 14:1985;184-195.
56. Landau S., Miller G. L. Solvability by radicals is in polynomial time. J. Comput. System Sci. 30:1985;179-208.
57. Lang S. Fundamentals of Diophantine Geometry. 1983;Springer-Verlag, New York/Berlin.
58. Lang S. Survey of Diophantine Geometry. 1997;Springer-Verlag, New York/Berlin.
59. Lenstra A. K. Factoring polynomials over algebraic number fields. Computer Algebra, London, 1983. 1983;Springer-Verlag, Berlin. p. 245-254.
60. Lenstra A. K. Polynomial factorization by root approximation. Fitch J. Proceedings of the 3rd International Symposium on Symbolic and Algebraic Computation EUROSAM 84, Cambridge, England, July 9-11, 1984. Lecture Notes in Comput. Sci. 174:1984;272-276 Springer-Verlag, New York/Berlin.
61. Lenstra A. K., Lenstra H. W., Lovasz L. Technical Report. 1982.
62. Lenstra A. K., Lenstra H. W. Jr., Lovász L. Factoring polynomials with rational coefficients. Math. Ann. 261:1982;513-534.
63. Macauley F. S. The Algebraic Theory of Modular Systems. 1916;Cambridge Univ. Press, Cambridge.
64. Malajovich G. On the Complexity of Path-Following Newton Algorithms for Solving Systems of Polynomial Equations with Integer Coefficients. 1993;University of California at Berkeley.
65. Malajovich G. On generalized newton algorithms: quadratic convergence, path-following and error analysis. Theoret. Comput. Sci. 133:1994;65-84.
66. G. Malajovich, Worst possible condition number of polynomial systems, preprint, 1995.
67. McCarthy P. J. Algebraic Extensions of Fields. 1976;Chelsea, New York.
68. Mignotte M. Mathématiques pour le calcul formel. 1989;Presses Universitaires de France, Paris.
69. Montaña J. L., Morais J. E., Pardo L. M. Lower bounds for arithmetic networks. II. Sum of betti numbers. Appl. Algebra Engrg. Comm. Comput. 7:1996;41-51.
70. Montaña J. L., Pardo L. M. Lower bounds for arithmetic networks. Appl. Algebra Engrg. Comm. Comput. 4:1993;1-24.
71. Montaña J. L., Pardo L. M., Recio T. The non-scalar model of complexity in computational geometry. Traverso C., Mora T. Effective Methods in Algebraic Geometry, Proceedings of MEGA'90. Progress in Mathematics. 94:1991;347-361 Birkhäuser, Basel.
72. 3539+1)/3, in, EUROCRYPT: Advances in Cryptology, Proceedings of EUROCRYPT, 1990.
73. Morain F. Elliptic curves, primality proving and some titanic primes. Astérisque. 198-200:1992;245-251.
74. Morais J. E. Resolución eficaz de sistemas de ecuaciones polinomiales. 1997;Universidad de Cantabria, Santander.
75. Pardo L. M. How lower and upper complexity bounds meet in elimination theory. Cohen G., Giusti H., Mora T. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Paris, 1995. Lecture Notes in Computer Science. 948:1995;33-69 Springer-Verlag, Berlin.
76. Philippon P. Sur des hauteurs alternatives, I. Math. Ann. 289:1991;255-283.
77. Philippon P. Sur des hauteurs alternatives, II. Ann. Inst. Fourier (Grenoble). 44:1994;1043-1065.
78. Philippon P. Sur des hauteurs alternatives, III. J. Math. Pures Appl. 74:1995;345-365.
79. Pohst M., Zassenhaus H. Algorithmic Algebraic Number Theory. 1989;Cambridge Univ. Press, Cambridge.
80. Renegar J. On the worst-case arithmetic complexity of approximating zeros of polynomials. J. Complexity. 3:1987;90-113.
81. Rose H. E. A Course in Number Theory. 1994;Clarendon, Oxford Univ. Press, New York.
82. J. Kilian and S. Goldwasser, Almost all primes can be quickly certified, in 18th Annual ACM Symp. on Theory of Computing, 1986, pp. 316-329.
83. Schmidt W. M. Diophantine Approximation. 1980;Springer-Verlag, Berlin.
84. Schönhage A. preliminary report. 1981.
85. A. Schönhage, Equation solving in terms of computational complexity, in, Proceedings of the International Congress of Mathematicians, 1986, Vol, 3, p, 40.
86. Schwartz J. T. Probabilistic algorithms for verification of polynomial identities. ISSAC '79: Proceedings of Int'l. Symp. on Symbolic and Algebraic Computation. Lecture Notes in Computer Science. 72:1979;Springer-Verlag, New York/Berlin.
87. Shub M., Smale S. Computational complexity: On the geometry of polynomials and a theory of cost, I. Ann. Sci. École Norm. Sup. 18:1985;107-142.
88. Shub M., Smale S. Computational complexity: On the geometry of polynomials and a theory of cost, II. SIAM J. Comput. 15:1986;145-161.
89. Shub M., Smale S. Complexity of Bézout's theorem. I. Geometric aspects. J. Amer. Math. Soc. 6:1993;459-501.
90. Shub M., Smale S. Complexity of Bézout's theorem. II. Volumes and probabilities. Proceedings Effective Methods in Algebraic Geometry. Progress in Mathematics. 109:1993;Birkhäuser, Basel. p. 267-285.
91. Shub M., Smale S. Complexity of Bézout's theorem. III. Condition number and packing. J. Complexity. 9:1993;4-14.
92. M. Shub, and, S. Smale, Complexity of Bézout's theorem. IV. Probability of success, extensions, SIAM J. Numer. Anal, in press.
93. Shub M., Smale S. Complexity of Bézout's theorem. V. Polynomial time. Theoret. Comput. Sci. 133:1994;141-164.
94. Shub M., Smale S. Complexity of Bezout's theorem. IV. Probability of success and extensions. SIAM J. Numer. Anal. 33:1996;128-148.
95. Smale S. The fundamental theorem of algebra and complexity theory. Bull. Amer. Math. Soc. (N.S.). 4:1981;1-36.
96. Smale S. On the efficiency of algorithms of analysis. Bull. Amer. Math. Soc. 13:1985;87-121.
97. S. Smale, Algorithms for solving equations, in Proceedings of the International Congress of Mathematicians, Berkeley, CA, 1986, pp. 172-195.
98. Smale S. Newton's method estimates from data at one point. The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics, Laramie, WY, 1985. 1986;Springer-Verlag, New York. p. 185-196.
99. Sombra M. Estimaciones para el teorema de ceros de Hilbert. 1998;Universidad de Buenos Aires.
100. Strassen V. Algebraic complexity theory. Handbook of Theoretical Computer Science. 1990;Elsevier, Amsterdam. p. 634-671.
101. Sturmfels B. Gröbner Bases and Convex Polytopes. University Lecture Series. 8:1996;Amer. Math. Soc. Providence.
102. Tyler S. The Lagrange Spectrum in Projective Space over a Local Field. 1994;University of Texas at Austin.
103. Vogel W. Results on Bézout's Theorem. 1984;Springer-VerlagTata Institute of Fundamental Research, New York/Berlin.
104. Yakoubsohn J. C. Une constante universelle pour la convergence de la méthode de Newton. C.R. Acad. Sci. Paris Sér. I Math. 320:1995;385-390.
105. Yakoubsohn J. C. A universal constant for the convergence of Newton's method and an application to the classical homotopy method. Numer. Algorithms. 9:1995;223-244.
106. Zariski O. Algebraic Surfaces. 1995;Springer-Verlag, New York/Berlin.
107. Zariski O., Samuel P. Commutative Algebra. 1958;Van Nostrand, Princeton.
108. Zippel R. Probabilistic algorithms for sparse polynomials. Proceedings EUROSAM'79. Lecture Notes in Comput. Sci. 72:1979;Springer-Verlag, New York/Berlin. p. 216-226.