Approximations and expansions Definition
Bernstein polynomial
Definition
Let be a function and let be an integer. The -th Bernstein polynomial of is The polynomials are the Bernstein basis polynomials.
Remarks
If is continuous, then uniformly on . This proves the Weierstrass approximation theorem.
The basis polynomials are nonnegative on , and they sum to by the binomial theorem.
Sergei Bernstein gave this proof in 1912, with an argument from probability. Mathlib defines the basis polynomials as bernsteinPolynomial.
Where this leads
15 pages build on this one.
- Weierstrass approximation theorem
- Bernstein–Bézier form
- Stone–Weierstrass theorem
- L2 convergence of Fourier series
- Uniform convergence of Bernstein approximations
- Continuous functional calculus
- Bézier curve
- Approximation of a kernel by degenerate kernels
- Density of trigonometric polynomials in continuous functions
- Compactness of integral operators
- Commutative Gelfand–Naimark theorem
- Fourier basis of L2 of the circle
- Jentzsch's theorem on positive kernels
- Noncommutative geometry
- Basel problem via Fourier series
Further reading
About this page
| Tag | 0C4VWBFY73 |
|---|---|
| URI | m2://0C4VWBFY73 |
| Kind | definition |
| Writing | W1 stated |
| MSC | 41A10 |
| Defines | Bernstein polynomial |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.