On the existence of generally convergent algorithms
- 1 March 1986
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 2 (1) , 2-11
- https://doi.org/10.1016/0885-064x(86)90020-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Families of Rational Maps and Iterative Root-Finding AlgorithmsAnnals of Mathematics, 1987
- On the efficiency of algorithms of analysisBulletin of the American Mathematical Society, 1985
- On the dynamics of rational mapsAnnales Scientifiques de lʼÉcole Normale Supérieure, 1983
- Any iteration for polynomial equations using linear information has infinite complexityTheoretical Computer Science, 1983
- Global Convergence of a Modified Newton Iteration for Algebraic EquationsSIAM Journal on Numerical Analysis, 1982
- The fundamental theorem of algebra and complexity theoryBulletin of the American Mathematical Society, 1981
- On Algorithms for Solving f(x)=0Communications on Pure and Applied Mathematics, 1979