Iterative polynomial-root-finding procedure with enhanced accuracy
arXiv:1910.03507
Abstract
We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular software packages.
It turned out that the proposed procedure in this work is a rediscovery of the "Durand-Kerner" method