Pages that link to "Item:Q5872372"
From MaRDI portal
The following pages link to On the efficient global dynamics of Newton’s method for complex polynomials (Q5872372):
Displaying 11 items.
- Moduli space of cubic Newton maps (Q1678134) (← links)
- Finding polynomial roots by dynamical systems -- a case study (Q2211136) (← links)
- On the speed of convergence of Newton's method for complex polynomials (Q2792334) (← links)
- A note on the newton method for degree four polynomials (Q3376318) (← links)
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials (Q4728110) (← links)
- A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton’s method (Q4911911) (← links)
- Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038) (← links)
- The Weierstrass–Durand–Kerner root finder is not generally convergent (Q5058658) (← links)
- How to find all roots of complex polynomials by Newton's method. (Q5950709) (← links)
- 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 (Q6073133) (← links)
- Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis (Q6572622) (← links)
