Smale's Fundamental Theorem of Algebra reconsidered

2012/03/30 by Diego Armentano, Armentano, Diego, Michael Shub +1
Computer Science · Engineering · #Algebraic Geometry (math.AG) #Complex Variables (math.CV) #Complexity and Algorithms in Graphs #Dynamical Systems (math.DS) #FOS: Mathematics #Numerical Analysis (math.NA) #Polynomial and algebraic computation #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1204.0036

openalex publication_date 2012/03/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In his 1981 Fundamental Theorem of Algebra paper Steve Smale initiated the complexity theory of finding a solution of polynomial equations of one complex variable by a variant of Newton's method. In this paper we reconsider his algorithm in the light of work done in the intervening years. Smale's upper bound estimate was infinite average cost. Our's is polynomial in the Bézout number and the dimension of the input. Hence polynomial for any range of dimensions where the Bézout number is polynomial in the input size. In particular not just for the case that Smale considered but for a range of dimensions as considered by Bürgisser-Cucker where the max of the degrees is greater than or equal to n^1+ε for some fixed ε. It is possible that Smale's algorithm is polynomial cost in all dimensions and our main theorem raises some problems that might lead to a proof of such a theorem.

Related

• Condition length and complexity for the solution of polynomial systems
• The complexity and geometry of numerically solving polynomial systems
• Lower Bounds for diophantine Approximation
• On Smale's 17th problem over the reals
• A Direct Ultrametric Approach to Additive Complexity and the Shub-Smale Tau Conjecture