Converse theorems of convexity for Bernstein polynomials over triangles (Q1813783): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q1803692 / rank
Normal rank
 
Property / author
 
Property / author: Jing-Zhong Zhang / rank
Normal rank
 
Property / author
 
Property / author: Geng-zhe Chang / rank
 
Normal rank
Property / author
 
Property / author: Jing-Zhong Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convexity of Bernstein polynomials over triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3848301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5337349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear approximation and generalized convexity / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:07, 14 May 2024

scientific article
Language Label Description Also known as
English
Converse theorems of convexity for Bernstein polynomials over triangles
scientific article

    Statements

    Converse theorems of convexity for Bernstein polynomials over triangles (English)
    0 references
    25 June 1992
    0 references
    The authors consider the \(n\)th Bernstein polynomial \(B_ n(f;p)\) of a real function \(f(p)\) whose domain is a given triangle \(T\). They show that if the function \(f(p)\) is continuous on \(T\) and one of the inequalities \(B_ n(f;p)\geq f(p)\) or \(B_ n(f;p)>B_{n+1}(f;p)\) holds of all positive integers \(n\) and for all points in \(T\), then the function \(f\) cannot have a strict local maximum at an interior point of \(T\).
    0 references
    Bernstein polynomial
    0 references
    0 references
    0 references

    Identifiers