Bernstein polynomials and numerical integration
β Scribed by Erwin Kreyszig
- Publisher
- John Wiley and Sons
- Year
- 1979
- Tongue
- English
- Weight
- 199 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0029-5981
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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 fu
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
We construct explicitly (nonpolynomial) eigenfunctions of the difference operators by Macdonald in the case t=q k , k Β₯ Z. This leads to a new, more elementary proof of several Macdonald conjectures, proved first by Cherednik. We also establish the algebraic integrability of Macdonald operators at t
The linear combination of iterates \(1-\left(1-P_{n}\right)^{M}\) of Bernstein and Durrmeyer operators of a fixed degree \(n\) is considered for increasing order of iteration \(M\). The resulting sequence of polynomials is shown to converge to the Lagrange interpolating polynomial for the Bernstein