2010
DOI: 10.1007/s11253-010-0362-2
|View full text |Cite
|
Sign up to set email alerts
|

Are the degrees of the best (co)convex and unconstrained polynomial approximations the same? II

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
6
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 9 publications
1
6
0
Order By: Relevance
“…The case q = 2, 2 < α, N = s + 3 of Theorem 2 resolves the question posed in ( [5], see comments for the table s ≥ 3, pp. 424-425) in that we have "⊕" for these (α, N ).…”
Section: )supporting
confidence: 53%
See 3 more Smart Citations
“…The case q = 2, 2 < α, N = s + 3 of Theorem 2 resolves the question posed in ( [5], see comments for the table s ≥ 3, pp. 424-425) in that we have "⊕" for these (α, N ).…”
Section: )supporting
confidence: 53%
“…This overview deals only with comonotone approximation, q = 1; the complete picture is known also for q = 2, see [4,5] and Corollary 3, while for larger q the full generality has not been achieved. For a survey of shape-preserving, in particular q-coconvex, approximation see [3].…”
Section: Overview Of Comonotone Approximationmentioning
confidence: 99%
See 2 more Smart Citations
“…This implies, in particular, that these moduli are the right measure of smoothness to be used while investigating constrained weighted approximation (see e.g. [3,7,8]).…”
Section: Introduction and Main Resultsmentioning
confidence: 99%