Abstract
The Bernstein operators of second kind were introduced by Paolo Soardi in 1990, in terms of a random walk on a certain hypergroup. They have the same relation with Chebyshev polynomials of second kind as the classical Bernstein operators have with Chebyshev polynomials of first kind. In this paper we describe a de Casteljau type algorithm for these operators.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Heyer, H.: Probability theory on a hypergroup: a survey. In: Lect. Notes Math., vol. 1064, pp. 481–550. Springer, Berlin Heidelberg New York (1984)
Lasser, R.: Orthogonal polynomials and hypergroups. Rend. Mat. Appl. 2, 185–209 (1983)
Locher, F.: Numerische Mathematik für Informatiker. Springer, Berlin Heidelberg New York (1992)
Pavel, L.: Hipergrupuri. Editura Academiei Române, Bucharest (2000)
Polyanin, A.D., Manzhirov, A.V.: Handbook of Mathematics for Engineers and Scientists. Chapman & Hall/CRC Taylor & Francis Group, Boca Raton, London, New York (2007)
Raşa, I.: On Soardi’s Bernstein operators of second kind. Anal. Numér. Théor. Approx. 29, 191–199 (2000)
Raşa, I.: Classes of convex functions associated with Bernstein operators of second kind. Math. Inequal. Appl. 9(4), 599–605 (2006)
Soardi, P.: Bernstein polynomials and random walks on hypergroups. In: Probability Measures on Groups, X, Oberwolfach 1990, pp. 387–393. Plenum, New York (1991)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Inoan, D., Raşa, I. A recursive algorithm for Bernstein operators of second kind. Numer Algor 64, 699–706 (2013). https://doi.org/10.1007/s11075-012-9688-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-012-9688-1