On the existence of generally convergent algorithms

DOI10.1016/0885-064X(86)90020-8zbMATH Open0595.65048OpenAlexW1969872508MaRDI QIDQ1077876FDOQ1077876

Authors: Michael Shub, Stephen Smale 

Publication date: 1986

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(86)90020-8

Recommendations

• Braiding of the attractor and the failure of iterative algorithms
• scientific article; zbMATH DE number 3856296
• scientific article; zbMATH DE number 4095835
• Families of rational maps and iterative root-finding algorithms
• How to be sure of finding a root of a complex polynomial using Newton's method

zbMATH Keywords

convergenceiterative algorithmsNewton's methodzeros of polynomials

Mathematics Subject Classification ID

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

• Morse Theory. (AM-51)
• Invariant manifolds
• On the dynamics of rational maps
• The fundamental theorem of algebra and complexity theory
• Title not available (Why is that?)
• Families of rational maps and iterative root-finding algorithms
• On the efficiency of algorithms of analysis
• On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
• Title not available (Why is that?)
• On Algorithms for Solvingf(x)=0
• Any iteration for polynomial equations using linear information has infinite complexity
• Rate of Approach to Minima and Sinks--The Morse-Smale Case
• Global Convergence of a Modified Newton Iteration for Algebraic Equations

Cited In (23)

• On invariant volumes of codimension-one Anosov flows and the Verjovsky conjecture
• On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
• McMullen’s root-finding algorithm for cubic polynomials
• Perspectives on information-based complexity
• Title not available (Why is that?)
• Some informational requirements for convergence
• Recent developments in information-based complexity
• Algorithms with mediant convergents and their metrical theory
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Julia sets for the super-Newton method, Cauchy’s method, and Halley’s method
• Title not available (Why is that?)
• On a general \(\rho\)-algorithm
• Newton's method and complex dynamical systems
• Geometric analysis of nondeterminacy in dynamical systems
• On a generalization of the \(\epsilon\)-algorithm
• Some remarks on Smale's “Algorithms for solving equations”
• Solving the quintic by iteration
• Families of rational maps and convergence basins of Newton's method
• On general convergence in extracting radicals via a fundamental family of iteration functions
• Braiding of the attractor and the failure of iterative algorithms
• Families of rational maps and iterative root-finding algorithms
• Some connections of complex dynamics
• Some aspects of studying an optimization or decision problem in different computational models

This page was built for publication: On the existence of generally convergent algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077876)