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.

Bernstein Polynomial
Filter Results1 entry
Connections

In Branch

Source Bernstein Polynomial (Wikipedia)

Principal Result Of

Source Bernstein Polynomial (Wikipedia)

Proved By

Source Bernstein Polynomial (Wikipedia)
Sources
Bernstein Polynomial (Wikipedia)
  • Lead section
    In the mathematical field of numerical analysis, a Bernstein polynomial is a polynomial expressed as a linear combination of Bernstein basis polynomials.
  • Principal Result Of: Sergei Bernstein, Lead sentence of the article on the result
    The idea is named after mathematician Sergei Natanovich Bernstein.
  • 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.

Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme