Recursive de Casteljau bisection and rounding errors Original Research Article

Rounding errors of the de Casteljau bisection algorithm applied recursively to finding zeros of polynomials of one or more variables are analyzed. Apart from error bounds for this procedure, the paper contains a proof of the so called numerical variation diminishing property (formulated for one-dimensional case), which is significant in practical procedures of solving algebraic equations.