The fundamental theorem of algebra and complexity theory

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to single equations (65H05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Representations of entire functions of one complex variable by series and integrals (30D10)

Related Items

On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials, On the cost of approximating all roots of a complex polynomial, Multiple attractors in Newton's method, How to be sure of finding a root of a complex polynomial using Newton's method, Smale’s mean value conjecture and the coefficients of univalent functions, On a cubically convergent derivative-free root finding method, Newton's Method for Underdetermined Systems of Equations Under the γ-Condition, On the efficiency of algorithms of analysis, Plane Autonomous Systems with Rational Vector Fields, Computational complexity. On the geometry of polynomials and a theory of cost. I, On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros, Responses to ``Theoretical Mathematics: Toward\\ a cultural synthesis of mathematics and\\ theoretical physics, by A. Jaffe and F. Quinn, Invertibility of random fredholm operators, On Gauss’s First Proof of the Fundamental Theorem of Algebra, Early Coefficients of the Inverse of a Regular Convex Function, Dynamics of singular complex analytic vector fields with essential singularities I, The foundations of spectral computations via the solvability complexity index hierarchy, Extremal problems in geometric function theory, Computing eigenvalues of the Laplacian on rough domains, Integrability of matrices, Recent developments in information-based complexity, Geometry of polynomials and root-finding via path-lifting, Ulam Stability of Zero Point Equations, The average condition number of most tensor rank decomposition problems is infinite, An adjoint-based approach for finding invariant solutions of Navier–Stokes equations, Multiscale Analysis of Accelerated Gradient Methods, SMALE’S PROBLEM FOR CRITICAL POINTS ON CERTAIN TWO RAYS, Chebyshev-like root-finding methods with accelerated convergence, DENSITY ESTIMATES ON COMPOSITE POLYNOMIALS, A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial, Computational complexity of a piecewise linear homotopy algorithm, A New Inequality for Complex-Valued Polynomial Functions, Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra, The probability that a slightly perturbed numerical analysis problem is difficult, On the cost of computing roots of polynomials, A Gröbner free alternative for polynomial system solving, Kronecker's and Newton's approaches to solving: a first comparison, On the volume of tubular neighborhoods of real algebraic varieties, On the average number of steps of the simplex method of linear programming, Approximate Zeros of Quadratically Convergent Algorithms, Point estimation of simultaneous methods for solving polynomial equations: A survey, On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial, Uniqueness of the singular points of vector fields on Riemannian manifolds under the \(\gamma\)-condition, Mean value conjectures for rational maps, On critical values of polynomials with real critical points, Reshaping the metaphor of proof, Letter to the editor, On isolation of simple multiple zeros and clusters of zeros of polynomial systems, On the Solvability Complexity Index, the 𝑛-pseudospectrum and approximations of spectra of operators, Extremal Problems for Polynomials in the Complex Plane, Smale's mean value conjecture for odd polynomials, Complexity of an Homotopy Method at the Neighbourhood of a Zero, Dual Smale’s mean value conjecture, Specifying attracting cycles for Newton maps of polynomials, The Probability That a Numerical Analysis Problem is Difficult, Convergence of Gauss-Newton's method and uniqueness of the solution, Polynomials Versus Finite Blaschke Products, A short survey on Kantorovich, On the existence of generally convergent algorithms, Shifted varieties and discrete neighborhoods around varieties, Average-case complexity without the black swans, One-dimensional Coulomb multiparticle systems, Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems, Uniform convergence of higher order quasi Hermite-Fejér interpolation, Some remarks on Dvorcuk's root-finding method, Two-square theorems for infinite matrices on certain fields, On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros, Extended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theory, Optimal solution of nonlinear equations, Complexity of Bezout's theorem. V: Polynomial time, Point estimation of simultaneous methods for solving polynomial equations: A survey. II., On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems, Finiteness of the set of conservative polynomials of given degree, Algebraic complexity of computing polynomial zeros, Sequential and parallel complexity of approximate evaluation of polynomial zeros, A universal constant for the convergence of Newton's method and an application to the classical homotopy method, A posteriori error bound methods for the inclusion of polynomial zeros, The geometry of ill-conditioning, On the worst-case arithmetic complexity of approximating zeros of polynomials, Complexity theory of numerical linear algebra, On the convergence of the sequences of Gerschgorin-like disks, Ecology models and Newton vector fields, Smoothed analysis of complex conic condition numbers, Improved two-step Newton's method for computing simple multiple zeros of polynomial systems, A probabilistic theory for error estimation in automatic integration, Ten misconceptions from the history of analysis and their debunking, Global aspects of the continuous and discrete Newton method: A case study, The guaranteed convergence of Laguerre-like method, Deformation techniques to solve generalised Pham systems, Statistical complexity of the power method for Markov chains, On zero finding methods of higher order from data at one point, Study of linear information for classes of polynomial equations, Optimal and nearly optimal algorithms for approximating polynomial zeros, Some inequalities for polynomials and rational functions associated with lemniscates, Linear programming, complexity theory and elementary functional analysis, Markov-type inequality and a lower bound for the moduli of critical values of polynomials, Geometric function theory and Smale's mean value conjecture, Smale's mean value conjecture and complex dynamics, New barriers in complexity theory: on the solvability complexity index and the towers of algorithms, Smale's fundamental theorem of algebra reconsidered, A continuation method to solve polynomial systems and its complexity, Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods, Certified predictor-corrector tracking for Newton homotopies, Computational complexity of kernel-based density-ratio estimation: a condition number analysis, Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions, The continuous, desingularized Newton method for meromorphic functions, Robust certified numerical homotopy tracking, Recent development in computational complexity characterization of Nash equilibrium, On the finite-increment theorem for complex polynomials, Local and global behavior for algorithms of solving equations, On one extremal problem for complex polynomials with constraints on critical values, A general approach to isolating roots of a bitstream polynomial, Kantorovich's type theorems for systems of equations with constant rank derivatives, Corrections to Probabilistic analysis of numerical methods for integral equations, Numerical computation of polynomial zeros by means of Aberth's method, Critical values of finite Blaschke products, A family of root-finding methods with accelerated convergence, Smale's mean value conjecture for finite Blaschke products, 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, An efficient higher order family of root finders, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, On the solution of systems of equations with constant rank derivatives, On the new fourth-order methods for the simultaneous approximation of polynomial zeros, The convergence of a family of parallel zero-finding methods, Dual mean value problem for complex polynomials, A new fourth-order family of simultaneous methods for finding polynomial zeros, Symmetric functions and root-finding algorithms, Smale's \(\alpha \)-theory for inexact Newton methods under the \(\gamma \)-condition, Extremal polynomials in Smale's mean value conjecture, Computing spectral measures and spectral types, Topological complexity of a root finding algorithm, On the dual mean-value conjecture for complex polynomials, Conservative polynomials and yet another action of \(\text{Gal}(\overline{\mathbb Q}/\mathbb Q)\) on plane trees, Point estimation of a family of simultaneous zero-finding methods, The invisible hand of Laplace: the role of market structure in price convergence and oscillation, The Newton transform: An operational method for constructing integrals of dynamical systems, Verified error bounds for singular solutions of nonlinear systems, Kantorovich-type convergence criterion for inexact Newton methods, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], On the infinite-dimensional QR algorithm, Convergence behavior for Newton-Steffensen's method under \(\gamma\)-condition of second derivative, Rational functions and pseudo-Newton algorithms, On the convergence of Wang-Zheng's method, The polynomial pivots as initial values for a new root-finding iterative method, Parametrized topological complexity of collision-free motion planning in the plane, The theory of Newton's method, Global convergence of the method of successive approximations on \(S^ 1\), Cayley's problem and Julia sets, On an efficient simultaneous method for finding polynomial zeros, Real computations with fake numbers, Critical points and values of complex polynomials, On the complexity of a PL homotopy algorithm for zeros of polynomials, Convergence analysis of Davidchack and Lai's algorithm for finding periodic orbits, Probabilistic analysis of numerical methods for integral equations, Average case optimality, Phase transitions in the one-dimensional Coulomb medium, Some thoughts on computational models: from massive human computing to abstract state machines, and beyond

Cites Work