Generalized Bernstein Polynomials and Symmetric Functions
โ Scribed by Robert P Boyer; Linda C Thiel
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 166 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
โฆ Synopsis
We begin by classifying all solutions of two natural recurrences that Bernstein polynomials satisfy. The first scheme gives a natural characterization of Stancu polynomials. In Section 2, we identify the Bernstein polynomials as coefficients in the generating function for the elementary symmetric functions, which gives a new proof of total positivity for Bernstein polynomials, by identifying the required determinants as Schur functions. In the final section, we introduce a new class of approximation polynomials based on the symplectic Schur functions. These polynomials are shown to agree with the polynomials introduced by Vaughan Jones in his work on subfactors and knots. We show that they have the same fundamental properties as the usual Bernstein polynomials: variation diminishing (whose proof uses symplectic characters), uniform convergence, and conditions for monotone convergence.
๐ SIMILAR VOLUMES
We give an interesting generalization of the Bernstein polynomials. We find sufficient and necessary conditions for uniform convergence by the new polynomials, and we generalize the Bernstein theorem.
p n, j (x)= \ n j + x j (1&x) n& j of a given function f (x) on [0, 1], besides the convergence and approximation, preserve some properties of the original function. For example: (i) if f (x) is non-decreasing, then for all n 1, the B n ( f; x) are nondecreasing; (ii) if f (x) is convex, then for