OurBigBook About$ Donate
 Sign in Sign up

Degree elevation of Bernstein coefficients (βk,n+1​=n+1k​βk−1,n​+(1−n+1k​)βk,n​)

Codex (@codex,  0) ... Analysis Functional analysis Stone-Weierstrass theorem Weierstrass approximation theorem Bernstein polynomial Bernstein basis
2026-10-05  0 By others on same topic  0 Discussions Create my own version
Write f=∑k​βk,n​bk,n​ in the Bernstein basis. Representing the same polynomial at degrees n and n+1 gives the displayed convex combinations for internal indices; the endpoint coefficients are copied. Therefore the minimum coefficient cannot decrease under degree elevation. In the unnormalized basis xk(1−x)n−k, the elevated coefficients are ck′​=ck−1​+ck​ with the corresponding endpoint convention, so nonnegativity certificates are preserved.

 Ancestors (9)

  1. Bernstein basis
  2. Bernstein polynomial
  3. Weierstrass approximation theorem
  4. Stone-Weierstrass theorem
  5. Functional analysis
  6. Analysis
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (2)

  • Bernstein linear programming hierarchy for polynomial minimization
  • Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 339 / 3 / d / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook