A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding
2002
Journal of symbolic computation
To approximate all roots (zeros) of a univariate polynomial, we develop two effective algorithms and combine them in a single recursive process. One algorithm computes a basic well isolated zero-free annulus on the complex plane, whereas another algorithm numerically splits the input polynomial of the n-th degree into two factors balanced in the degrees and with the zero sets separated by the basic annulus. Recursive combination of the two algorithms leads to recursive computation of the
doi:10.1006/jsco.2002.0531
fatcat:6wam4dzplvcplgpg7v2haetoim