On the maximum principle of Bernstein polynomials on a simplex
Chang and Zhang gave in bivariate case a proof of what they called a converse theorem of convexity. Using semigroup technique, Dahmen and Micchelli have extended the above theorem to a multivariate case: Let \(S_ m\) be the barycentric unit simplex in the \(m\)-dimensional Euclidean space and \(f\) a continuous function on \(S_ m\) such that, for the Bernstein polynomial \(B_ n f\), \(B_ n f(x)\geq f(x)\), \(x\in S_ m\). Then \(f\) achieves its maximum on the boundary of \(S_ m\). In this paper, the author gives a short and elementary proof of the above theorem.
- Convexity and Bernstein polynomials on \(k\)-simploids
- scientific article; zbMATH DE number 4111260
- On the degree of multivariate Bernstein polynomial operators
- Bernstein's inequality for multivariate polynomials on the standard simplex
- Converse theorems of convexity for Bernstein polynomials over triangles
- On the degree of multivariate Bernstein polynomial operators
- The genuine Bernstein-Durrmmeyer operator on a simplex
- Converse theorems of convexity for Bernstein polynomials over triangles
- Bernstein's inequality for multivariate polynomials on the standard simplex
- Maximality of the Bernstein polynomials
- scientific article; zbMATH DE number 927885 (Why is no real title available?)
- scientific article; zbMATH DE number 3411776 (Why is no real title available?)
This page was built for publication: On the maximum principle of Bernstein polynomials on a simplex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198949)
