Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

When it is preferable to use Bernstein polynomials to approximate a continuous function instead of using the only following preliminary Numerical Analysis methods: "Lagrange Polynomials", "Simple finite differences operators". One aspect of my question is to see that is there any predominance to use this method instead of those were mentioned even at very especial case? BERNSTEIN Polynomials are nice themselves and have lots of properties, but are they better to use for example in computer program or other situations too?

Thank Mr. Nikita Sidorov, Mr. Pietro Maior, Mr. Neeks, Mr. quid. but when I click to accept one, the other will non-accepted automaticly, Why?

Your answers was nice all.

share|improve this question
    
You can only accept one answer ---this is how the software works. –  Mariano Suárez-Alvarez Dec 9 '12 at 4:21
    
So I think it is better to change some settings in this software, I just suggest it and there is not any pressure but some questions have more than one solutions or way of solving. –  AmirHosein SadeghiManesh Dec 9 '12 at 6:21
    
Well, we have no control on the software so we cannot change it. –  Mariano Suárez-Alvarez Dec 10 '12 at 21:03
add comment

4 Answers

up vote 6 down vote accepted

The only practical advantage of Bernstein polynomials is their universality. They really work for any continuous function $f$. However, it is well known that if $$ \|f-B_n(f)\|_\infty=o(1/n),\quad n\to\infty, $$ then $f(x)=ax+b$. In other words, one cannot hope to approximate a non-linear function by a Bernstein polynomial with an error term better than $1/n$ - which is impractical.

share|improve this answer
    
Lojasiewicz proves Weierstrass approximation theorem using Bernstein and Tonelli polynomials in his textbook Łojasiewicz, Stanisław An introduction to the theory of real functions. With contributions by M. Kosiek, W. Mlak and Z. Opial. Third edition. Translated from the Polish by G. H. Lawden. Translation edited by A. V. Ferreira. A Wiley-Interscience Publication. John Wiley & Sons, Ltd., Chichester, 1988. x+230 pp. ISBN: 0-471-91414-2 –  Margaret Friedland Dec 5 '12 at 21:28
    
Thanks! What's a Tonelli polynomial? I have to admit I've never heard of them and Google is no help either... –  Nikita Sidorov Dec 5 '12 at 23:55
    
I must be missing something. Surely the approximation error is $o(1/n)$ (in particular, identically zero for all but a finite number of $n$) if $f$ is any polynomial? –  Fredrik Johansson Dec 5 '12 at 23:56
    
Fredrik: not really. Take, for instance, $f(x)=x^2$; then $B_n(f;x)=x^2+x(1-x)/n$, so $B_n(f;x)-f(x)\asymp 1/n$. –  Nikita Sidorov Dec 6 '12 at 0:16
    
I see. Still, any polynomial can be written in the Bernstein basis, so if you are working with the Bernstein basis for computational purposes, you always have the option to choose an exact interpolant instead of "the" Bernstein polynomial $B_n(f)$. –  Fredrik Johansson Dec 6 '12 at 1:39
show 3 more comments

I am not an expert on this but my understanding is that in some sense Bernstein polynomials are really used all over in graphics (Adobe Flash, PostScript, Metafont, SVG,...), via Bézier curves and related things. The De Casteljau algorithm mentioned there is for numerically evaluating Bernstein polynomials, and see at the end under 'Terminology' where Bernstein polynomials are mentioned explicitly.

share|improve this answer
    
quid: Can you name some refrence? to I observe these facts by my own logic, I will be happy if you do. Thanks. –  AmirHosein SadeghiManesh Dec 9 '12 at 3:22
    
As said I am not an expert but the following notes seem nice tsplines.com/resources/class_notes/Bezier_curves.pdf (in particular not the part on the fonts; so in some sense we look at Bernstein polynomials all the time). Also the wiki page I link to gives various additional information. –  quid Dec 9 '12 at 11:26
    
where 'not' is 'note' of course. –  quid Dec 9 '12 at 11:27
add comment

Very recently I am also amazed by their properties and so little applications. An useful read is: "The Bernstein polynomial basis: a centennial retrospective" [google it]. Nikita is right but their is the another aspect of not fitting the spurious peaks in the signal. This can smooth the signal better.

share|improve this answer
    
Neeks: I couldn't reach this site "google.it", please say another way to see your refrence, because I think it should be important. This application you told here is a good thing. –  AmirHosein SadeghiManesh Dec 9 '12 at 3:19
1  
In the suggestion 'google' was used as a verb. So Neeks recommended to use Google (or another search-engine) to find 'it' (the paper). But tangentially, I am surprised why google.it did not give you the Italian Google site, which it is. In any case, I used Google to find it for you see mae.engr.ucdavis.edu/~farouki/bernstein.pdf ; I even made the extra effort to use google.it :) –  quid Dec 9 '12 at 13:20
    
This «google it» incident is quite funny :-) –  Mariano Suárez-Alvarez Dec 10 '12 at 21:04
    
@quid , the address you wrote here was useful. thank you. –  AmirHosein SadeghiManesh Jan 3 '13 at 7:09
add comment

A classical application of the Bernstein polinomials is the solution of the Hausdorff moment problem, that I mentioned in this answer.

share|improve this answer
    
It was nice. thank you. –  AmirHosein SadeghiManesh Jan 3 '13 at 7:11
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.