On the maximum principle of Bernstein polynomials on a simplex (Q1198949)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the maximum principle of Bernstein polynomials on a simplex
scientific article

    Statements

    On the maximum principle of Bernstein polynomials on a simplex (English)
    0 references
    0 references
    16 January 1993
    0 references
    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.
    0 references
    0 references
    converse theorem of convexity
    0 references
    Bernstein polynomial
    0 references
    0 references