Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
DOI10.1137/0215011zbMATH Open0625.65036OpenAlexW2029950920MaRDI QIDQ3028211FDOQ3028211
Authors: Michael Shub, Stephen Smale 
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7f26baa2f3c2995ec06a78db98e483f9e81b51e4
Recommendations
- Computational complexity. On the geometry of polynomials and a theory of cost. I
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Algebraic complexity of computing polynomial zeros
- Newton's method and some complexity aspects of the zero-finding problem
- scientific article; zbMATH DE number 4032923
computational complexityefficiencyEuler methodpolynomial root findingnumber of iterationsgeneralized Euler with modificationzero of a complex polynomial
Analysis of algorithms and problem complexity (68Q25) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)
Cited In (41)
- Geometric function theory and Smale's mean value conjecture
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
- Semialgebraic complexity of functions
- Complexity and algorithms for nonlinear optimization problems
- Critical points and values of complex polynomials
- On critical values of polynomials with real critical points
- Title not available (Why is that?)
- Approximate Zeros of Quadratically Convergent Algorithms
- Extremal problems in geometric function theory
- Flow box decomposition for gradients of univariate polynomials, billiards on the Riemann sphere, tree-like configurations of vanishing cycles for \(A_{n}\) curve singularities and geometric cluster monodromy
- Smale's problem for critical points on certain two rays
- Recent developments in information-based complexity
- A short survey on Kantorovich-like theorems for Newton's method
- Newton's method and the computational complexity of the fundamental theorem of algebra
- On zero finding methods of higher order from data at one point
- On the average number of steps of the simplex method of linear programming
- Computational complexity. On the geometry of polynomials and a theory of cost. I
- Geometry of polynomials and root-finding via path-lifting
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- Dual mean value problem for complex polynomials
- Topological complexity of a root finding algorithm
- Kronecker's and Newton's approaches to solving: a first comparison
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- On the efficient global dynamics of Newton’s method for complex polynomials
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- Optimal solution of nonlinear equations
- How to be sure of finding a root of a complex polynomial using Newton's method
- A probabilistic theory for error estimation in automatic integration
- Complexity of Bezout's theorem. V: Polynomial time
- On the efficiency of algorithms of analysis
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- Algebraic complexity of computing polynomial zeros
- Globally convergent, iterative path-following for algebraic equations
- Average case optimality
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- Statistical complexity of the power method for Markov chains
- Smale’s mean value conjecture and the coefficients of univalent functions
- On the cost of approximating all roots of a complex polynomial
- Smale's mean value conjecture for finite Blaschke products
This page was built for publication: Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028211)
