Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

Bernstein Polynomial

Analysis

A Bernstein polynomial, named for the mathematician Sergei Natanovich Bernstein, is a polynomial written as a linear combination of Bernstein basis polynomials, a family studied in the field of numerical analysis. Bernstein first used polynomials of this form in a constructive proof of the Weierstrass approximation theorem, which states that every continuous function on a closed interval can be uniformly approximated by polynomials. With the rise of computer graphics, Bernstein polynomials restricted to the interval from 0 to 1 became central to the definition of Bezier curves, and de Casteljau's algorithm gives a numerically stable way to evaluate a polynomial written in Bernstein form. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Connections

In Branch

Source Bernstein Polynomial (Wikipedia)
Sources
Bernstein Polynomial (Wikipedia)
In Branch: Numerical Analysis, Lead sentence
Quote, In Branch: Numerical Analysis, Lead sentence
In the mathematical field of numerical analysis, a Bernstein polynomial is a polynomial expressed as a linear combination of Berns
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.