na20

Design, analysis, and implementation of a multiprecision polynomial rootfinder. We present the design, analysis, and implementation of an algorithm for the computation of any number of digits of the roots of a polynomial with complex coefficients. The real and the imaginary parts of the coefficients may be integer, rational, or floating point numbers represented with an arbitrary number of digits. The algorithm has been designed to deal also with numerically hard polynomials like those arising from the symbolic preprocessing of systems of polynomial equations, where the degree and the size of the coefficients are typically huge. (netlib numeralgo na20)

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element