||This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. (June 2016) (Learn how and when to remove this template message)|
In the mathematical field of numerical analysis, a Bernstein polynomial, named after Sergei Natanovich Bernstein, is a polynomial in the Bernstein form, that is a linear combination of Bernstein basis polynomials.
Polynomials in Bernstein form were first used by Bernstein in a constructive proof for the Stone–Weierstrass approximation theorem. With the advent of computer graphics, Bernstein polynomials, restricted to the interval [0, 1], became important in the form of Bézier curves.
The n + 1 Bernstein basis polynomials of degree n are defined as
where is a binomial coefficient.
A linear combination of Bernstein basis polynomials
is called a Bernstein polynomial or polynomial in Bernstein form of degree n.
The coefficients are called Bernstein coefficients or Bézier coefficients.
The first few Bernstein basis polynomials are:
The Bernstein basis polynomials have the following properties:
- , if or .
- and where is the Kronecker delta function.
- has a root with multiplicity at point (note: if , there is no root at 0).
- has a root with multiplicity at point (note: if , there is no root at 1).
- for .
- The derivative can be written as a combination of two polynomials of lower degree:
- The integral is constant for a given
- If , then has a unique local maximum on the interval at . This maximum takes the value:
- The Bernstein basis polynomials of degree form a partition of unity:
- By taking the first derivative of where , it can be shown that
- The second derivative of where can be used to show
- A Bernstein polynomial can always be written as a linear combination of polynomials of higher degree:
Approximating continuous functions
Let ƒ be a continuous function on the interval [0, 1]. Consider the Bernstein polynomial
It can be shown that
uniformly on the interval [0, 1]. This is a stronger statement than the proposition that the limit holds for each value of x separately; that would be pointwise convergence rather than uniform convergence. Specifically, the word uniformly signifies that
Bernstein polynomials thus afford one way to prove the Weierstrass approximation theorem that every real-valued continuous function on a real interval [a, b] can be uniformly approximated by polynomial functions over R.
A more general statement for a function with continuous kth derivative is
is an eigenvalue of Bn; the corresponding eigenfunction is a polynomial of degree k.
Suppose K is a random variable distributed as the number of successes in n independent Bernoulli trials with probability x of success on each trial; in other words, K has a binomial distribution with parameters n and x. Then we have the expected value E(K/n) = x.
for every δ > 0. Moreover, this relation holds uniformly in x, which can be seen from its proof via Chebyshev's inequality, taking into account that the variance of K/n, equal to x(1-x)/n, is bounded from above by 1/(4n) irrespective of x.
Because ƒ, being continuous on a closed bounded interval, must be uniformly continuous on that interval, one infers a statement of the form
uniformly in x. Taking into account that ƒ is bounded (on the given interval) one gets for the expectation
uniformly in x. To this end one splits the sum for the expectation in two parts. On one part the difference does not exceed ε; this part cannot contribute more than ε. On the other part the difference exceeds ε, but does not exceed 2M, where M is an upper bound for |ƒ(x)|; this part cannot contribute more than 2M times the small probability that the difference exceeds ε.
Finally, one observes that the absolute value of the difference between expectations never exceeds the expectation of the absolute value of the difference, and that E(ƒ(K/n)) is just the Bernstein polynomial Bn(ƒ, x).
See for instance.
- G. G. Lorentz (1953) Bernstein Polynomials, University of Toronto Press
- Natanson (1964) p.6
- Natanson (1964) p.3
- L. Koralov and Y. Sinai, "Theory of probability and random processes" (second edition), Springer 2007; see page 29, Section "Probabilistic proof of the Weierstrass theorem".
- Caglar, Hakan; Akansu, Ali N. (July 1993). "A generalized parametric PR-QMF design technique based on Bernstein polynomial approximation". IEEE Transactions on Signal Processing 41 (7): 2314–2321. doi:10.1109/78.224242. Zbl 0825.93863.
- Korovkin, P.P. (2001), "Bernstein polynomials", in Hazewinkel, Michiel, Encyclopedia of Mathematics, Springer, ISBN 978-1-55608-010-4
- Natanson, I.P. (1964). Constructive function theory. Volume I: Uniform approximation. Translated by Alexis N. Obolensky. New York: Frederick Ungar. MR 0196340. Zbl 0133.31101.
- Bill Casselman, From Bézier to Bernstein, Feature Column from American Mathematical Society
- Kenneth I. Joy (2000) Bernstein Polynomials from University of California, Davis.
- Weisstein, Eric W., "Bernstein Polynomial", MathWorld.
- This article incorporates material from properties of Bernstein polynomial on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.