Abstract
Given a real functionf εC 2k[0,1],k ≥ 1 and the corresponding Bernstein polynomials {B n (f)} n we derive an asymptotic expansion formula forB n (f). Then, by applying well-known extrapolation algorithms, we obtain new sequences of polynomials which have a faster convergence thanB n (f). As a subclass of these sequences we recognize the linear combinations of Bernstein polynomials considered by Butzer, Frentiu, and May [2, 6, 9]. In addition we prove approximation theorems which extend previous results of Butzer and May. Finally we consider some applications to numerical differentiation and quadrature and we perform numerical experiments showing the effectiveness of the considered technique.
Similar content being viewed by others
References
S. N. Bernstein,Complétement a l'article de E. Voronowskaja, C. R. Acad. Sci. U.R.S.S., (1932), pp. 86–92.
P. L. Butzer,Linear combinations of Bernstein polynomials, Can. J. Math., 5 (1953), pp. 559–567.
R. De Vore and G. Lorentz,Constructive Approximation, Springer-Verlag, Berlin, 1991.
Z. Ditzian,A global inverse theorem for combinations of Bernstein polynomials, J. Approximation Theory, 26 (1979), pp. 277–292.
H. Engels,Numerical Quadrature and Cubature, Acad. Press, London, 1980.
M. Frentiu,Linear combinations of Bernstein polynomials and of Mirakjan operators, Studia Univ. Babes-Boljai Ser. Math. Mech., 15 (1970), pp. 63–68.
D. Jackson,The Theory of Approximation, Amer. Math. Soc. Coll. Publ., 11, New York, 1930.
G. C. Lorentz,Bernstein Polynomials, Univ. of Toronto Press, Toronto, 1953.
C. P. May,Saturation and inversed theorems for combinations of a class of exponential-type operators, Can. J. Math., 28 (1976), pp. 1224–1250.
M. J. D. Powell,On the maximum errors of polynomial approximation defined by interpolation and least squares criteria, Comput. J., 9 (1966), pp. 404–407.
E. J. Remez,Sur le calcul effectif des polynomes d'approximation de Tchebichef, C. R. Acad. Sci. Paris, 199 (1934), pp. 337–340.
J. Stoer and R. Bulirsch,Introduction to Numerical Analysis, Springer-Verlag, Berlin, 1970.
P. Tang,A fast algorithm for linear complex Chebyshev approximation, Math. Comp., 51 (1988), pp. 721–739.
E. Voronowskaja,détermination de la forme asymptotique d'approximation des fonctions par les polynomes de m. Bernstein, c. R. Acad. Sci. U.R.S.S., (1932), pp. 79–85.
Author information
Authors and Affiliations
Additional information
This work was partially supported by a grant from MURST 40.
Rights and permissions
About this article
Cite this article
Costabile, F., Gualtieri, M.I. & Serra, S. Asymptotic expansion and extrapolation for Bernstein polynomials with applications. Bit Numer Math 36, 676–687 (1996). https://doi.org/10.1007/BF01733787
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01733787