REVIEW 2 cited by
A Survey of Weighted Approximation for Exponential Weights
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Let W: R to (0,1] be continuous. Bernstein's approximation problem, posed in 1924, deals with approximation by polynomials in the weighted uniform norm ||fW|| Linfinity(R) . The qualitative form of this problem was solved by Achieser, Mergelyan, and Pollard, in the 1950's. Quantitative forms of the problem were actively investigated starting from the 1960's. We survey old and recent aspects of this topic, including the Bernstein problem, weighted Jackson and Bernstein Theorems, Markov-Bernstein and Nikolskii inequalities, orthogonal expansions and Lagrange interpolation. We present the main ideas used in many of the proofs, and different techniques of proof, though not the full proofs. The class of weights we consider is typically even, and supported on the whole real line, so we exclude Laguerre type weights on [0,infinity). Nor do we discuss Saff's weighted approximation problem, nor the asymptotics of orthogonal polynomials.
Forward citations
Cited by 2 Pith papers
-
Sharp Inequalities between Total Variation and Hellinger Distances for Gaussian Mixtures
Compactly supported Gaussian location mixtures satisfy H ≤ TV^{1-o(1)} with sharp examples, resolving the Jia et al. open problem on TV-Hellinger comparability.
-
Entropy and Learning of Lipschitz Functions under Log-Concave Measures
For regression of 1-Lipschitz functions under log-concave measures with Gaussian-like polynomial approximation, low-degree polynomial estimators achieve the minimax L2 risk of order log d / log n when n is subexponent...
Discussion (0). Continue with ORCID to comment.