Computational complexity. On the geometry of polynomials and a theory of cost. I
DOI10.24033/ASENS.1486zbMATH Open0603.65027OpenAlexW235157351MaRDI QIDQ3740132FDOQ3740132
Authors: Michael Shub, Stephen Smale
Publication date: 1985
Published in: Annales Scientifiques de l?tcole Normale Sup�rieure (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ASENS_1985_4_18_1_107_0
Recommendations
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- scientific article; zbMATH DE number 3976214
- On the cost of computing roots of polynomials
- On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
- scientific article; zbMATH DE number 3880013
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The fundamental theorem of algebra and complexity theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coefficients of univalent functions
Cited In (32)
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
- Semialgebraic complexity of functions
- On rediscovered iteration methods for solving equations
- Approximate Zeros of Quadratically Convergent Algorithms
- Improbability of nonconvergence in a cubic root-finding method
- 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
- Recent developments in information-based complexity
- A short survey on Kantorovich-like theorems for Newton's method
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications
- Problèmes rencontrés dans mon parcours mathématique: Un bilan. (Problems I have come across during my mathematical career: A balance)
- A universal constant for the convergence of Newton's method and an application to the classical homotopy method
- On zero finding methods of higher order from data at one point
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- On Schröder's families of root-finding methods
- Kronecker's and Newton's approaches to solving: a first comparison
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- How to be sure of finding a root of a complex polynomial using Newton's method
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- Algebraic complexity of computing polynomial zeros
- Newton iteration, conditioning and zero counting
- Title not available (Why is that?)
- Fixed point and Newton's methods in the complex plane
- On the cost of computing roots of polynomials
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- A basic family of iteration functions for polynomial root finding and its characterizations
- Title not available (Why is that?)
- A study of convergence for a fourth-order two-point iteration in Banach spaces
- An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound
- Polynomial and rational approximations and the link between Schröder's processes of the first and second kind
This page was built for publication: Computational complexity. On the geometry of polynomials and a theory of cost. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740132)