Pages that link to "Item:Q6073133"
From MaRDI portal
The following pages link to 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):
Displaying 10 items.
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
- Numerical methods for roots of polynomials. Part I (Q885496) (← links)
- Numerical methods for roots of polynomials. II (Q1949539) (← links)
- Finding polynomial roots by dynamical systems -- a case study (Q2211136) (← links)
- On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots (Q2672185) (← links)
- Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038) (← links)
- On the efficient global dynamics of Newton’s method for complex polynomials (Q5872372) (← 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)
