Mathematics From Leningrad to Austin 1997
DOI: 10.1007/978-1-4612-5329-7_86
|View full text |Cite
|
Sign up to set email alerts
|

Inverse Theorems for Bernstein Polynomials

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
38
0

Year Published

1997
1997
2017
2017

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 44 publications
(38 citation statements)
references
References 3 publications
0
38
0
Order By: Relevance
“…In many cases such investigations lead to so-called inverse or saturation results. For the first type of theorems the method introduced by Berens and Lorentz [1] turns out to be a simple and efficient tool. However, for the second case a different technique should be used.…”
Section: Introductionmentioning
confidence: 98%
“…In many cases such investigations lead to so-called inverse or saturation results. For the first type of theorems the method introduced by Berens and Lorentz [1] turns out to be a simple and efficient tool. However, for the second case a different technique should be used.…”
Section: Introductionmentioning
confidence: 98%
“…By the well-known result of Berens and Lorentz [2], we have finished (1.4). Finally, (1.5) can be deduced by the same way as [5] or [10].…”
Section: Proof Of Theoremsmentioning
confidence: 69%
“…In fact, it was proved in [9] with a constant M f independent of n and x, if and only if | 1 ( f, t)=0(t a ), where Such an equivalence was first given by Berens and Lorentz [1] for Bernstein operators in 1972. Some more characterizations of second orders and higher orders of global smoothness of functions along this line can be found in [6,8] and [10,11] respectively.…”
Section: Introduction and Main Resultsmentioning
confidence: 91%