2020
DOI: 10.48550/arxiv.2007.01607
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Pointwise Remez inequality

Abstract: The standard well-known Remez inequality gives an upper estimate of the values of polynomials on [−1, 1] if they are bounded by 1 on a subset of [−1, 1] of fixed Lebesgue measure. The extremal solution is given by the rescaled Chebyshev polynomials for one interval. Andrievskii asked about the maximal value of polynomials at a fixed point, if they are again bounded 1 on a set of fixed size. We show that the extremal polynomials are either Chebyshev (one interval) or Akhiezer polynomials (two intervals) and pro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…Such polynomials have been studied in numerical analysis as they have applications to the Krylov subspace iterations, see, for example, [10,15,22]. Recently they have also been used to study the Remez inequality [12]. The residual norm is given by r z 0 ,n ≡ R z 0 ,n e (1.2)…”
Section: Introductionmentioning
confidence: 99%
“…Such polynomials have been studied in numerical analysis as they have applications to the Krylov subspace iterations, see, for example, [10,15,22]. Recently they have also been used to study the Remez inequality [12]. The residual norm is given by r z 0 ,n ≡ R z 0 ,n e (1.2)…”
Section: Introductionmentioning
confidence: 99%