Computing roots of polynomials by quadratic clipping

We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip bounded by two quadratic polynomials which encloses the graph of the polynomial within the interval of interest. The new interval(s) containing the root(s) is (are) obtained by intersecting this strip with the abscissa axis. In the case of single roots, the sequence of the lengths of the intervals converging towards the root has the convergence rate 3. For double roots, the convergence rate is still superlinear (3 2). We show that the new technique compares favorably with the classical technique of B´ezier clipping. Key words: root finding, polynomial, B´ezier clipping

• Type: Journal
• Year: 2007
• Where: CAGD
• Authors: Michael Barton, Bert Jüttler
• Keywords: CAGD 2007, Convergence Rate, Polynomial, Univariate Polynomial