2002
DOI: 10.1006/jmaa.2001.7700
|View full text |Cite
|
Sign up to set email alerts
|

Pointwise Estimate for Linear Combinations of Bernstein–Kantorovich Operators

Abstract: For linear combinations of Bernstein-Kantorovich operators K n r f x , we give an equivalent theorem with ω

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
8
0

Year Published

2006
2006
2017
2017

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 7 publications
0
8
0
Order By: Relevance
“…Proof. Using Lemma 3.1 and Lemma 3.2, the proof of Theorem 3.1 is similar to that of Theorem 1 of [3]. The details are omitted.…”
mentioning
confidence: 85%
See 1 more Smart Citation
“…Proof. Using Lemma 3.1 and Lemma 3.2, the proof of Theorem 3.1 is similar to that of Theorem 1 of [3]. The details are omitted.…”
mentioning
confidence: 85%
“…In order to obtain faster convergence, various modifications of Bernstein-Kantorovich operator, linear combinations of Bernstein-type sequences [2,3] or a family of intermediate Bernsteintype operators were considered to accelerate this convergence [4,5] . In [5], Sablonnière introduced such last-mentioned intermediate operator K (r) n , (n ≥ r) between Bernstein-Kantorovich operator K n and Lagrange interpolation operator and called it Bernstein-Kantorovich quasiinterpolants.…”
mentioning
confidence: 99%
“…The main result in [7] is Theorem A. If r ∈ N, 0 λ 1 and 0 < α < 2r 2−λ , then for all f ∈ C[0, 1], we have…”
Section: Introductionmentioning
confidence: 99%
“…From Lemma 3.2 in [7], we can easily obtain Lemma 3.2. If r ∈ N, 0 < β < 2r, 0 t 1 8r and rt < x < 1 − rt, then…”
mentioning
confidence: 94%
“…Direct and inverse theorems have been investigated in some approximation processes (cf. [1][2][3][4][5][6][7][8][9][10][11][12]). …”
Section: Introductionmentioning
confidence: 99%