Pages that link to "Item:Q2792334"
From MaRDI portal
The following pages link to On the speed of convergence of Newton's method for complex polynomials (Q2792334):
Displaying 18 items.
- On the number of places of convergence for Newton's method over number fields (Q719158) (← links)
- On the convergence of Newton's method (Q1122312) (← links)
- Finding polynomial roots by dynamical systems -- a case study (Q2211136) (← links)
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently (Q2357369) (← links)
- Geometry of polynomials and root-finding via path-lifting (Q4606640) (← 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)
- Combinatorial properties of Newton maps (Q5014749) (← links)
- Diverging orbits for the Ehrlich–Aberth and the Weierstrass root finders (Q5027172) (← links)
- The Weierstrass–Durand–Kerner root finder is not generally convergent (Q5058658) (← links)
- ON THE DISTANCE TO A ROOT OF COMPLEX POLYNOMIALS UNDER NEWTON'S METHOD (Q5146447) (← links)
- Puzzles and the Fatou–Shishikura injection for rational Newton maps (Q5853490) (← links)
- On the efficient global dynamics of Newton’s method for complex polynomials (Q5872372) (← 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)
- A new fast root-finder for black box polynomials (Q6658315) (← links)
