摘要

The root-finding problem of a univariate polynomial is a fundamental and long studied problem, which has wide applications in mathematics, engineering, computer science, and natural sciences. This paper presents a progressive interpolation based method for solving a simple root within a given interval, which is of convergence order 3.2(n-3) and needs n functional evaluations of the given function f(t). The new method can ensure the convergence and achieve a better efficiency index. It needs none of the evaluations of the derivatives of f (t). Numerical examples show the convergence order of the progressive method.