The Computation of Multiple Roots of a Bernstein Basis Polynomial.

This paper describes the algorithms of Musser and Gauss for the computation of multiple roots of a theoretically exact Bernstein basis polynomial (f) over cap (y) when the coefficients of its given form f (y) are corrupted by noise. The exact roots of f (y) can therefore be assumed to be simple, and thus the problem reduces to the calculation of multiple roots of a polynomial (f) over tilde (y) that is near f (y), such that the backward error is small. The algorithms require many greatest common divisor (GCD) computations and polynomial deconvolutions, both of which are implemented by a structure-preserving matrix method. The motivation of these algorithms arises from the unstructured and structured condition numbers of a multiple root of a polynomial. These condition numbers have an elegant interpretation in terms of the pejorative manifold of (f) over cap (y), which allows the geometric significance of the GCD computations and polynomial deconvolutions to be considered. A variant of the Sylvester resultant matrix is used for the GCD computations because it yields better results than the standard form of this matrix, and the polynomial deconvolutions can be computed in several different ways, sequentially or simultaneously, and with the inclusion or omission of the preservation of the structure of the coefficient matrix. It is shown that Gauss' algorithm yields better results than Musser's algorithm, and the reason for these superior results is explained.