Pages that link to "Item:Q2357369"
From MaRDI portal
The following pages link to Newton's method in practice: finding all roots of polynomials of degree one million efficiently (Q2357369):
Displaying 13 items.
- 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)
- A subspace expanding technique for global zero finding of multi-degree-of-freedom nonlinear systems (Q2659549) (← links)
- On the speed of convergence of Newton’s method for complex polynomials (Q2792334) (← links)
- Some Connections of Complex Dynamics (Q3296706) (← links)
- Combinatorial properties of Newton maps (Q5014749) (← 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)
- A characterization of postcritically minimal Newton maps of complex exponential functions (Q5235025) (← links)
- A combinatorial classification of postcritically fixed Newton maps (Q5235117) (← 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)
- 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)
