Bernstein polynomial explained

In the mathematical field of numerical analysis, a Bernstein polynomial is a polynomial expressed as a linear combination of Bernstein basis polynomials. The idea is named after mathematician Sergei Natanovich Bernstein.

Polynomials in Bernstein form were first used by Bernstein in a constructive proof for the 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.

A numerically stable way to evaluate polynomials in Bernstein form is de Casteljau's algorithm.

Definition

Bernstein basis polynomials

The n+1 Bernstein basis polynomials of degree n are defined as

b _{\nu,n} (x) l{:} l{=} \binom{n}{\nu} x ^{\nu} \left( 1 - x \right) ^{n} , \nu = 0 , \ldots, n,

where

\tbinom{n}{\nu} is a binomial coefficient.

So, for example,

b _{2,5} (x) = \tbinom{ 5 }{ 2 }x ^{2(1-x)} ^{3} = 10 x ^{2(1-x)} ^{3.}

The first few Bernstein basis polynomials for blending 1, 2, 3 or 4 values together are:

\begin{align} b _{0,0} (x) & = 1 , \\ b _{0,1} (x) & = 1 - x, & b _{1,1} (x) & = x \\ b _{0,2} (x) & = ( 1 - x) ^{2,} & b _{1,2} (x) & = 2 x( 1 - x), & b _{2,2} (x) & = x ^{2} \\ b _{0,3} (x) & = ( 1 - x) ^{3,} & b _{1,3} (x) & = 3 x( 1 - x) ^{2,} & b _{2,3} (x) & = 3 x ^{2(1} - x), & b _{3,3} (x) & = x ^{3 \end{align}} \Pi _{n} of polynomials of degree at most n with real coefficients.

Bernstein polynomials

A linear combination of Bernstein basis polynomials

B _{n(x)} l{:} l{=} \sum ^{n} _{\nu =0} \beta _{\nu} b _{\nu,n} (x)

is called a Bernstein polynomial or polynomial in Bernstein form of degree n. The coefficients

\beta _{\nu} are called Bernstein coefficients or Bézier coefficients.

The first few Bernstein basis polynomials from above in monomial form are:

\begin{align} b _{0,0} (x) & = 1 , \\ b _{0,1} (x) & = 1 - 1 x, & b _{1,1} (x) & = 0 + 1 x \\ b _{0,2} (x) & = 1 - 2 x + 1 x ^{2,} & b _{1,2} (x) & = 0 + 2 x - 2 x ^{2,} & b _{2,2} (x) & = 0 + 0 x + 1 x ^{2} \\ b _{0,3} (x) & = 1 - 3 x + 3 x ^{2} - 1 x ^{3,} & b _{1,3} (x) & = 0 + 3 x - 6 x ^{2} + 3 x ^{3,} & b _{2,3} (x) & = 0 + 0 x + 3 x ^{2} - 3 x ^{3,} & b _{3,3} (x) & = 0 + 0 x + 0 x ^{2} + 1 x ^{3 \end{align}}

Properties

The Bernstein basis polynomials have the following properties:

b _{\nu,} (x) = 0 , if \nu < 0 or \nu > n. b _{\nu,} (x) \ge 0 for x \in [ 0 , 1 ]. b _{\nu,} \left( 1 - x \right) = b _{n} (x). b _{\nu,} ( 0 ) = \delta _{\nu,} and b _{\nu,} ( 1 ) = \delta _{\nu,} where \delta is the Kronecker delta function: \delta _{ij} = \begin{cases} 0 & if i ≠ j, \\ 1 & if i = j. \end{cases} b _{\nu,} (x) has a root with multiplicity \nu at point x = 0 (note: if \nu = 0 , there is no root at 0).b _{\nu,} (x) has a root with multiplicity \left( n - \nu \right) at point x = 1 (note: if \nu = n , there is no root at 1).

• The derivative can be written as a combination of two polynomials of lower degree: $$b\text{'}\_(x)\; =\; n\; \backslash left(b\_(x)\; -\; b\_(x)\; \backslash right).$$
• The k-th derivative at 0: $$b\_^(0)\; =\; \backslash frac\; \backslash binom\; (-1)^.$$
• The k-th derivative at 1: $$b\_^(1)\; =\; (-1)^k\; b\_^(0).$$
• The transformation of the Bernstein polynomial to monomials is $$b\_(x)\; =\; \backslash binom\backslash sum\_^\; \backslash binom(-1)^\; x^\; =\; \backslash sum\_^n\; \backslash binom\backslash binom(-1)^x^\backslash ell,$$ and by the inverse binomial transformation, the reverse transformation is^[1] $$x^k\; =\; \backslash sum\_^\; \backslash binom\; \backslash frac\; b\_(x)\; =\; \backslash frac\; \backslash sum\_^n\; \backslash binomb\_(x).$$
• The indefinite integral is given by $$\backslash int\; b\_(x)\; \backslash ,\; dx\; =\; \backslash frac\; \backslash sum\_^\; b\_(x).$$
• The definite integral is constant for a given n: $$\backslash int\_0^1\; b\_(x)\; \backslash ,\; dx\; =\; \backslash frac\; \backslash quad\backslash \; \backslash ,\; \backslash text\; \backslash nu\; =\; 0,1,\; \backslash dots,\; n.$$
• If

n \ne 0 , then b _{\nu,} (x) has a unique local maximum on the interval [ 0 , 1 ] at x = (\nu)/(n) . This maximum takes the value $$\backslash nu^\backslash nu\; n^\; \backslash left(n\; -\; \backslash nu\; \backslash right)^\; .$$

• The Bernstein basis polynomials of degree

n form a partition of unity: $$\backslash sum\_^n\; b\_(x)\; =\; \backslash sum\_^n\; x^\backslash nu\; \backslash left(1\; -\; x\backslash right)^\; =\; \backslash left(x\; +\; \backslash left(1\; -\; x\; \backslash right)\; \backslash right)^n\; =\; 1.$$

• By taking the first

x -derivative of (x + y) ^{n} , treating y as constant, then substituting the value y = 1- x , it can be shown that $$\backslash sum\_^\; \backslash nu\; b\_(x)\; =\; nx.$$

• Similarly the second

x -derivative of (x + y) ^{n} , with y again then substituted y = 1- x , shows that $$\backslash sum\_^\backslash nu(\backslash nu-1)\; b\_(x)\; =\; n(n-1)x^2.$$

• A Bernstein polynomial can always be written as a linear combination of polynomials of higher degree: $$b\_(x)\; =\; \backslash frac\; b\_(x)\; +\; \backslash frac\; b\_(x).$$
• The expansion of the Chebyshev Polynomials of the First Kind into the Bernstein basis is^[2] $$T\_n(u)\; =\; (2n-1)!!\; \backslash sum\_^n\; \backslash frac\; b\_(u).$$

Approximating continuous functions

Let ƒ be a continuous function on the interval [0,&nbsp;1]. Consider the Bernstein polynomial

B _{n(f)(x)} = \sum ^{n} _{\nu =0} f\left( (\nu)/(n) \right) b _{\nu,n} (x).

It can be shown that

\lim _{n} { B _{n(f)} } = f

uniformly on the interval [0,&nbsp;1].^[3]

Bernstein polynomials thus provide one way to prove the Weierstrass approximation theorem that every real-valued continuous function on a real interval [''a'',&nbsp;''b''] can be uniformly approximated by polynomial functions over 

R .^[4]

A more general statement for a function with continuous k^th derivative is

{\left\| B ^{(k)} _{n(f)} \right\|} _{infty} \le ((n) _{k})/(n ^{k}) \left\| f ^{(k)} \right\| _{infty} and \left\| f ^{(k)} - B ^{(k)} _{n(f)} \right\| _{infty} \to 0 , where additionally((n) _{k})/(n ^{k}) = \left( 1 - (0)/(n) \right) \left( 1 - (1)/(n) \right) … \left( 1 - (k -1)/(n) \right) is an eigenvalue of B_n; the corresponding eigenfunction is a polynomial of degree k.

Probabilistic proof

This proof follows Bernstein's original proof of 1912. See also Feller (1966) or Koralov & Sinai (2007).^[5]

\operatorname{ l E}\left[ (K)/(n) \right] = x andp(K) = {n \choose K} x ^{K} \left( 1 - x \right) ^{n} = b _{K,n} (x)

By the weak law of large numbers of probability theory,

\lim _{n} { P\left( \left| (K)/(n) - x \right|>\delta \right) } = 0

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, equal to  x(1-x), is bounded from above by 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

\lim _{n} { P\left( \left| f\left( (K)/(n) \right) - f\left( x \right) \right| > \varepsilon \right) } = 0

uniformly in x. Taking into account that ƒ is bounded (on the given interval) one gets for the expectation

\lim _{n} { \operatorname{ l E}\left( \left| f\left( (K)/(n) \right) - f\left( x \right) \right| \right) } = 0 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

\operatorname{ l E}\left[f\left( (K)/(n) \right)\right] = \sum ^{n} _{K =0} f\left( (K)/(n) \right) p(K) = \sum ^{n} _{K =0} f\left( (K)/(n) \right) b _{K,n} (x) = B _{n(f)(x)}

Elementary proof

The probabilistic proof can also be rephrased in an elementary way, using the underlying probabilistic ideas but proceeding by direct verification:

The following identities can be verified:

\sum _{k} {n \choose k} x ^{k} ( 1- x) ^{n-k} = 1 ("probability")\sum _{k} {k\over n} {n \choose k} x ^{k} ( 1- x) ^{n-k} = x ("mean")\sum _{k} \left( x - {k\over n}\right) ^{2} {n \choose k} x ^{k} ( 1- x) ^{n-k} = {x( 1- x)\over n}. ("variance")

In fact, by the binomial theorem

$$(1+t)^n\; =\; \backslash sum\_k\; t^k,$$

and this equation can be applied twice to

t (d)/(dt) . The identities (1), (2), and (3) follow easily using the substitution t = x/ ( 1 - x) .

Within these three identities, use the above basis polynomial notation

b _{k,n} (x) = {n\choose k} x ^{k} ( 1- x) ^{n-k} ,

and let

f _{n(x)} = \sum _{k} f(k/n) b _{k,n} (x).

Thus, by identity (1)

f _{n(x)} - f(x) = \sum _{k} [f(k/n) - f(x)] b _{k,n} (x),

so that

|f _{n(x)} - f(x)| \le \sum _{k} |f(k/n) - f(x)| b _{k,n} (x).

Since f is uniformly continuous, given

\varepsilon > 0 , there is a \delta > 0 such that |f(a) - f(b)| < \varepsilon whenever|a - b| < \delta . Moreover, by continuity, M = \sup |f| < inf ty . But then|f _{n(x)} - f(x)| \le \sum _{|x} |< \delta} |f(k/n) - f(x)| b _{k,n} (x) + \sum _{|x} |\ge \delta} |f(k/n) - f(x)| b _{k,n} (x) .

The first sum is less than ε. On the other hand, by identity (3) above, and since

|x - k/n| \ge \delta , the second sum is bounded by 2 M times\sum _{|x} b _{k,n} (x) \le \sum _{k} \delta ^{-2} \left(x - {k\over n}\right) ^{2} b _{k,n} (x) = \delta ^{-2} {x( 1- x)\over n} < { 1 \over 4 } \delta ^{-2} n ^{-1} .

(Chebyshev's inequality)

It follows that the polynomials f_n tend to f uniformly.

Generalizations to higher dimension

Bernstein polynomials can be generalized to dimensions – the resulting polynomials have the form . In the simplest case only products of the unit interval are considered; but, using affine transformations of the line, Bernstein polynomials can also be defined for products . For a continuous function on the -fold product of the unit interval, the proof that can be uniformly approximated by

\sum _{i _{1}} \sum _{i _{2}} … \sum _{i _{k}} {n _{1\choose} i _{1}} {n _{2\choose} i _{2}} … {n _{k\choose} i _{k} f\left({i} _{1\over} n _{1},} {i _{2\over} n _{2},} ... , {i _{k\over} n _{k}\right)} x ^{i _{1}} _{1} ( 1- x ^{n _{1-i} _{1}} _{1 )} x ^{i _{2}} _{2} ( 1- x ^{n _{2-i} _{2}} _{2 )} … x ^{i _{k}} _{k} ( 1- x ^{n _{k} - i _{k}} _{k)} is a straightforward extension of Bernstein's proof in one dimension.

See also

• Polynomial interpolation
• Newton form
• Lagrange form
• Binomial QMF (also known as Daubechies wavelet)

Notes

1. 1802.09518 . R. J. . Mathar . 2018 . Orthogonal basis function over the unit circle with the minimax property . math.NA . Appendix B.
2. Abedallah. Rababah . Transformation of Chebyshev-Bernstein Polynomial Basis . 10.2478/cmam-2003-0038. 2003. Comp. Meth. Appl. Math.. 3. 4 . 608–622 . 120938358. free.
3. Natanson (1964) p. 6
4. Natanson (1964) p. 3
5. Book: L. . Koralov . Y. . Sinai . Theory of probability and random processes . 2nd . Springer . 2007 . 29 . "Probabilistic proof of the Weierstrass theorem".

References

• , English translation
  • , Russian edition first published in 1940
    • Caglar . Hakan . Akansu . Ali N. . A generalized parametric PR-QMF design technique based on Bernstein polynomial approximation . 0825.93863 . IEEE Transactions on Signal Processing . 41 . 7 . 2314–2321 . July 1993 . 10.1109/78.224242. 1993ITSP...41.2314C .
  • Book: Natanson, I.P. . Isidor Natanson

. Isidor Natanson . Constructive function theory. Volume I: Uniform approximation . Alexis N. Obolensky . 0133.31101 . 0196340 . New York . Frederick Ungar . 1964 .

External links

• Mark. Kac. Mark Kac. Une remarque sur les polynomes de M. S. Bernstein . . 1938. 7 . 49–51. 10.4064/sm-7-1-49-51. free.
• Richard Paul . Kelisky . Theodore Joseph . Rivlin . Iteratives of Bernstein Polynomials. 1967 . . 21 . 3 . 511. 10.2140/pjm.1967.21.511. free .
• Book: E. L. . Stark. Bernstein Polynome, 1912-1955 . 1981. 10.1007/978-3-0348-9369-5_40. 443–461. P.L. . Butzer . ISNM60. 978-3-0348-9369-5.
• Sonia . Petrone . Sonia Petrone . Random Bernstein polynomials . Scand. J. Stat. . 1999. 26. 3. 373–393. 10.1111/1467-9469.00155. 122387975 .
• Halil . Oruc . Geoerge M. . Phillips. A generalization of the Bernstein Polynomials . 1999 . Proceedings of the Edinburgh Mathematical Society. 42 . 2 . 403–413 . 10.1017/S0013091500020332. free .
• Web site: Kenneth I. . Joy . 2000 . Bernstein Polynomials . 2009-02-28 . https://web.archive.org/web/20120220143625/http://www.idav.ucdavis.edu/education/CAGDNotes/Bernstein-Polynomials.pdf . 2012-02-20 . dead . from University of California, Davis. Note the error in the summation limits in the first formula on page 9.
• M.. Idrees Bhatti . P. . Bracken . Solutions of differential equations in a Bernstein Polynomial basis. 10.1016/j.cam.2006.05.002. 2007. J. Comput. Appl. Math.. 272–280. 205. 1 . 2007JCoAM.205..272I . free.
• Web site: Bill. Casselman. Bill Casselman (mathematician). From Bézier to Bernstein. 2008. Feature Column from American Mathematical Society
• Mehmet . Acikgoz . Serkan . Araci. On the generating function for Bernstein Polynomials . 2010 . AIP Conf. Proc. . AIP Conference Proceedings . 10.1063/1.3497855. 1281 . 1 . 1141. 2010AIPC.1281.1141A .
• E. H. . Doha. A. H.. Bhrawy . M. A. . Saker . Integrals of Bernstein polynomials: An application for the solution of high even-order differential equations . 10.1016/j.aml.2010.11.013. 2011 . Appl. Math. Lett.. 24 . 4. 559–565. free.
• Rida T.. Farouki . The Bernstein polynomial basis: a centennial retrospective . 2012. Comp. Aid. Geom. Des.. 29. 6 . 379–419. 10.1016/j.cagd.2012.03.001.
• Xiaoyan. Chen. Jieqing. Tan. Zhi. Liu. Jin. Xie. Approximations of functions by a new family of generalized Bernstein operators. J. Math. Ann. Applic. . 2017 . 450 . 244–261 . 10.1016/j.jmaa.2016.12.075. free.