Newton's method in practice: Finding all roots of polynomials of degree one million efficiently

We specify an algorithm that provably terminates and finds all roots of any polynomial of arbitrary degree, provided all roots are distinct and exact computation is available. It is known that Newton's method is inherently stable, so computing errors do not accumulate; we provide an exact bound on how much numerical precision is sufficient.