2008
DOI: 10.1016/j.jat.2008.03.011
|View full text |Cite
|
Sign up to set email alerts
|

K-functionals and multivariate Bernstein polynomials

Abstract: This paper estimates upper and lower bounds for the approximation rates of iterated Boolean sums of multivariate Bernstein polynomials. Both direct and inverse inequalities for the approximation rate are established in terms of a certain K -functional. From these estimates, one can also determine the class of functions yielding optimal approximations to the iterated Boolean sums.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 20 publications
(26 reference statements)
0
8
0
Order By: Relevance
“…The following theorem states for the pointwise and uniform convergence of our Bernstein polynomials with several variables. It should be mentionned that similar work has been done but only for two variables (see (Theorem 1.1 in Reference [26]), [30], (Theorems 3, 5 and 8 in [21]), (Theorem 6.7 in [33]), (Lemma 1 in [28]), (Theorem in [32]) and (Theorems 1 and 3 in [7]).…”
Section: Lemma 2 For a Givenmentioning
confidence: 99%
See 3 more Smart Citations
“…The following theorem states for the pointwise and uniform convergence of our Bernstein polynomials with several variables. It should be mentionned that similar work has been done but only for two variables (see (Theorem 1.1 in Reference [26]), [30], (Theorems 3, 5 and 8 in [21]), (Theorem 6.7 in [33]), (Lemma 1 in [28]), (Theorem in [32]) and (Theorems 1 and 3 in [7]).…”
Section: Lemma 2 For a Givenmentioning
confidence: 99%
“…(b) the Bernstein polynomials on a m-dimensional simplex and very useful in stochastic analysis (see References [7,[23][24][25][26]):…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…This theory has many applications in different areas in mathematics and physics, see [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17]. Throughout this paper we set I = [0, 1] and k ∈ N. Taking a k-dimensional simplex ∆ k :…”
Section: Introductionmentioning
confidence: 99%