Smale's fundamental theorem of algebra reconsidered

DOI10.1007/S10208-013-9155-YzbMath1316.65050arXiv1204.0036OpenAlexW2043325110MaRDI QIDQ404254

Diego Armentano, Michael Shub

Publication date: 4 September 2014

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.0036

zbMATH Keywords

homotopy methodNewton methodnumerical experimentpolynomial equationSmale's fundamental theorem of algebra

Mathematics Subject Classification ID

Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical computation of roots of polynomial equations (65H04)

Related Items (1)

Complexity of path-following methods for the eigenvalue problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A continuation method to solve polynomial systems and its complexity
• Fast linear homotopy to find approximate zeros of polynomial systems
• On a problem posed by Steve Smale
• Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
• A note on the finite variance of the averaging function for polynomial system solving
• Complexity of Bezout's theorem. III: Condition number and packing
• An arithmetic Poisson formula for the multi-variate resultant
• Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
• The fundamental theorem of algebra and complexity theory
• Complexity of Bezout's Theorem I: Geometric Aspects
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• Adaptive step-size selection for homotopy methods to solve polynomial equations

This page was built for publication: Smale's fundamental theorem of algebra reconsidered