MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).

## Bernstein Polynomials [closed]

Hello

If instead of equis point in Bernstein polynomials, we use Chebyshev points, What do you think?

-
Could you please make more precise what you would like to ask. – quid Dec 17 2011 at 15:03
You can edit this question. Press the button below the auestion. Please do not do this via a new question. (If ever you should have major difficulties to edit, please at least do this sort of clarfication via an answer. But also this is only a last-resort solution.) – quid Dec 17 2011 at 15:39
I mean, If we insteaf of (k/N) points, k=o,....N we use Chebyshev points to approximate a continuous function uniformly by Bernstien polynomials. – nada Dec 17 2011 at 16:45
If we do that what? you have to ask a complete question for there to be any chance of it being answered! – Mariano Suárez-Alvarez Dec 17 2011 at 17:23
(1) I am pretty sure that the OP is hoping to improve something like the result in en.wikipedia.org/wiki/… (2) OP may wish to look up the very beautiful and extensive study of "quadrature formulas." This area deals with selecting appropriate points in order to best approximate given families of functions. It would be interesting to see if Chebyshev points give a better rate of approximation than uniformly distributed points. However, the result given on Wikipedia is so classical, I would strongly suggest a literature search first. – J.L. Nelson Dec 18 2011 at 7:16
show 1 more comment