Efficient polynomial root-refiners: A survey and new record efficiency estimates


A typical iterative polynomial root-finder begins with a relatively slow process of computing a crude but sufficiently close initial approximation to a root and then rapidly refines it. The policy of using the same iterative process at both stages of computing an initial approximation and refining it, however, is neither necessary nor most effective. The… (More)
DOI: 10.1016/j.camwa.2011.11.015

1 Figure or Table


  • Presentations referencing similar topics