Iterative polynomial-root-finding procedure with enhanced accuracy
Hashim A. Yamani, Abdulaziz D. Alhaidari

TL;DR
This paper introduces a new iterative method for finding polynomial roots that significantly improves accuracy over existing algorithms used in common software.
Contribution
A simple yet highly accurate iterative routine for polynomial root-finding applicable to polynomials of any degree.
Findings
Results show improved accuracy over standard methods.
Method is simple to implement and effective.
Applicable to polynomials of any degree.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScientific Research and Discoveries · Numerical Methods and Algorithms · Computational Physics and Python Applications
