Pages that link to "Item:Q1077876"
From MaRDI portal
The following pages link to On the existence of generally convergent algorithms (Q1077876):
Displaying 15 items.
- Geometric analysis of nondeterminacy in dynamical systems (Q868434) (← links)
- Solving the quintic by iteration (Q918135) (← links)
- On invariant volumes of codimension-one Anosov flows and the Verjovsky conjecture (Q958175) (← links)
- Braiding of the attractor and the failure of iterative algorithms (Q1108637) (← links)
- A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927) (← links)
- Newton's method and complex dynamical systems (Q1119771) (← links)
- Families of rational maps and convergence basins of Newton's method (Q1201500) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- Some Connections of Complex Dynamics (Q3296706) (← links)
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial (Q3477120) (← links)
- Recent developments in information-based complexity (Q3780359) (← links)
- Perspectives on information-based complexity (Q3992024) (← links)
- McMullen’s root-finding algorithm for cubic polynomials (Q4330583) (← links)
- Some remarks on Smale's “Algorithms for solving equations” (Q5288737) (← links)
- Julia sets for the super-Newton method, Cauchy’s method, and Halley’s method (Q5706259) (← links)
