The fundamental theorem of algebra and complexity theory

68Q25: Analysis of algorithms and problem complexity

65H05: Numerical computation of solutions to single equations

12D10: Polynomials in real and complex fields: location of zeros (algebraic theorems)

30D10: Representations of entire functions of one complex variable by series and integrals

Related Items

Responses to ``Theoretical Mathematics: Toward\\ a cultural synthesis of mathematics and\\ theoretical physics, by A. Jaffe and F. Quinn, Approximate Zeros of Quadratically Convergent Algorithms, How to be sure of finding a root of a complex polynomial using Newton's method, Numerical computation of polynomial zeros by means of Aberth's method, Corrections to Probabilistic analysis of numerical methods for integral equations, Some computational methods for systems of nonlinear equations and systems of polynomial equations, On the history of the fundamental theorem of algebra: theory of equations and integral calculus, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], On the convergence of Wang-Zheng's method, On the complexity of a PL homotopy algorithm for zeros of polynomials, Uniform convergence of higher order quasi Hermite-Fejér interpolation, Some remarks on Dvorcuk's root-finding method, Complexity of Bezout's theorem. V: Polynomial time, Point estimation of a family of simultaneous zero-finding methods, A universal constant for the convergence of Newton's method and an application to the classical homotopy method, Optimal and nearly optimal algorithms for approximating polynomial zeros, Linear programming, complexity theory and elementary functional analysis, Two-square theorems for infinite matrices on certain fields