Study of linear information for classes of polynomial equations (Q1123546)

The author studies linear sequential information for approximating real zeros of real polynomials. It turns out that, e.g. in the class of sequential continuous information optimal information consists of evaluations of a polynomial at n points generated by the bisection method. To show this a theorem is proved and used, that a smooth function can be arbitrarily well uniformly approximated by a polynomial which satisfies constraints given by n arbitrary continuous linear functionals.