Iterative polynomial-root-finding procedure with enhanced accuracy

10/07/2019

∙

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.

READ FULL TEXT

Iterative polynomial-root-finding procedure with enhanced accuracy

Solving p-adic polynomial systems via iterative eigenvector algorithms

Improving the minimum distance bound of Trace Goppa codes

Solving polynomial systems via homotopy continuation and monodromy

Direct transformation from Cartesian into geodetic coordinates on a triaxial ellipsoid

Old and New Nearly Optimal Polynomial Root-finders

Polynomial Factorization Is Simple and Helpful -- More So Than It Seems to Be

Enhancing the accuracy of the Taylor polynomial by determining the remainder term

Iterative polynomial-root-finding procedure with enhanced accuracy

Related Research

Solving p-adic polynomial systems via iterative eigenvector algorithms

Improving the minimum distance bound of Trace Goppa codes

Solving polynomial systems via homotopy continuation and monodromy

Direct transformation from Cartesian into geodetic coordinates on a triaxial ellipsoid

Old and New Nearly Optimal Polynomial Root-finders

Polynomial Factorization Is Simple and Helpful -- More So Than It Seems to Be

Enhancing the accuracy of the Taylor polynomial by determining the remainder term