Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4608008 | Journal of Approximation Theory | 2008 | 11 Pages |
Abstract
This paper estimates upper and lower bounds for the approximation rates of iterated Boolean sums of multivariate Bernstein polynomials. Both direct and inverse inequalities for the approximation rate are established in terms of a certain KK-functional. From these estimates, one can also determine the class of functions yielding optimal approximations to the iterated Boolean sums.
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
Authors
Chunmei Ding, Feilong Cao,