Convexity and generalized Bernstein polynomials
- 1 February 1999
- journal article
- research article
- Published by Cambridge University Press (CUP) in Proceedings of the Edinburgh Mathematical Society
- Vol. 42 (1) , 179-190
- https://doi.org/10.1017/s0013091500020101
Abstract
In a recent generalization of the Bernstein polynomials, the approximated function f is evaluated at points spaced at intervals which are in geometric progression on [0, 1], instead of at equally spaced points. For each positive integer n, this replaces the single polynomial Bnf by a one-parameter family of polynomials , where 0 < q ≤ 1. This paper summarizes briefly the previously known results concerning these generalized Bernstein polynomials and gives new results concerning when f is a monomial. The main results of the paper are obtained by using the concept of total positivity. It is shown that if f is increasing then is increasing, and if f is convex then is convex, generalizing well known results when q = 1. It is also shown that if f is convex then, for any positive integer n This supplements the well known classical result that when f is convex.Keywords
This publication has 5 references indexed in Scilit:
- A generalization of the Bernstein polynomials based on the q-integersThe ANZIAM Journal, 2000
- A de Casteljau algorithm for generalized Bernstein polynomialsBIT Numerical Mathematics, 1997
- Total Positivity and the Shape of CurvesPublished by Springer Nature ,1996
- Polynomial interpolation at points of a geometric mesh on a triangleProceedings of the Royal Society of Edinburgh: Section A Mathematics, 1988
- On polynomial interpolation at the points of a geometric progressionProceedings of the Royal Society of Edinburgh: Section A Mathematics, 1981