Approximate Bernstein Polynomials

Greg Fee

We review Maple's bernstein procedure, and then some alternative
algorithms for computing Bernstein polynomials.  Our best method
approximates a Bernstein polynomial with a piecewise rational
function.  The degree n approximation may be calculated in O(n)
operations, and it may be evaluated at a single point in O(sqrt(n))