Pages that link to "Item:Q4911911"
From MaRDI portal
The following pages link to A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton’s method (Q4911911):
Displaying 10 items.
- A bias in the volatility smile (Q1621642) (← links)
- Dynamics and limiting behavior of Julia sets of König's method for multiple roots (Q1680126) (← 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)
- On the speed of convergence of Newton's method for complex polynomials (Q2792334) (← 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 efficient global dynamics of Newton’s method for complex polynomials (Q5872372) (← 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)
