K-functionals and multivariate Bernstein polynomials

Chunmei Ding, Feilong Cao

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 K<math><mi is="true">K</mi></math>-functional. From these estimates, one can also determine the class of functions yielding optimal approximations to the iterated Boolean sums.