SearcharxivSearch

arXiv · 1711.07083

Interpolatory pointwise estimates for monotone polynomial approximation

Abstract

Given a nondecreasing function $f$ on $[-1,1]$, we investigate how well it can be approximated by nondecreasing algebraic polynomials that interpolate it at $\pm 1$. We establish pointwise estimates of the approximation error by such polynomials that yield interpolation at the endpoints (i.e., the estimates become zero at $\pm 1$). We call such estimates "interpolatory estimates". In 1985, DeVore and Yu were the first to obtain this kind of results for monotone polynomial approximation. Their estimates involved the second modulus of smoothness $\omega_2(f,\cdot)$ of $f$ evaluated at $\sqrt{1-x^2}/n$ and were valid for all $n\ge1$. The current paper is devoted to proving that if $f\in C^r[-1,1]$, $r\ge1$, then the interpolatory estimates are valid for the second modulus of smoothness of $f^{(r)}$, however, only for $n\ge N$ with $N= N(f,r)$, since it is known that such estimates are in general invalid with $N$ independent of $f$. Given a number $\alpha>0$, we write $\alpha=r+\beta$ where $r$ is a nonnegative integer and $0<\beta\le1$, and denote by $Lip^*\alpha$ the class of all functions $f$ on $[-1,1]$ such that $\omega_2(f^{(r)}, t) = O(t^\beta)$. Then, one important corollary of the main theorem in this paper is the following result that has been an open problem for $\alpha\geq 2$ since 1985: If $\alpha>0$, then a function $f$ is nondecreasing and in $Lip^*\alpha$, if and only if, there exists a constant $C$ such that, for all sufficiently large $n$, there are nondecreasing polynomials $P_n$, of degree $n$, such that \[ |f(x)-P_n(x)| \leq C \left(\frac{\sqrt{1-x^2}}{n}\right)^\alpha, \quad x\in [-1,1]. \]

Explore related subjects

Keep this discovery

BibTeXRIS

K. A. Kopotun, D. Leviatan, I. A. Shevchuk. 2017-11-19. Interpolatory pointwise estimates for monotone polynomial approximation. https://arxiv.org/abs/1711.07083

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the log-concavity of the composite Bessel function $x^{\alpha}J_{\nu }\left( \beta x^{\gamma}\right) $

For a twice differentiable function $f:\left( a,b\right) \rightarrow \mathbb{R}$ define $v\left( f\right) =f^{\prime}f^{\prime}-f^{\prime\prime }f.$ It is well known that the positivity of $v\left( f\right) $ implies that the function $\left\vert f\right\vert $ is strictly log-concave on each subinterval which does not contain zeros of $f.$ In this paper we provide criteria for the positivity of $v\left( F\right) $ for the composite Bessel function $F\left( x\right) =J_{\alpha,\beta,\gamma,\nu}\left( x\right) :=x^{\alpha}J_{\nu}\left( \beta x^{\gamma}\right) $ for positive numbers $\beta$ and $\gamma$ and real numbers $\alpha$ and $\nu.$

math.CA

Riesz capacity ratios with negative exponents

We investigate sharp inequalities for ratios of Riesz capacities with negative exponents by combining computational experiments with rigorous analysis. For finite subsets of the line, we prove positivity of equilibrium masses when $-1<p<0$, enabling numerical tests of conjectured extremal ratios. In the plane, comparisons of the disk with regular polygon vertex sets reveal a cascade of transitions among the tested competitors and suggest a precise conjecture for the equilibrium measure of odd polygons, for which we give a partial proof. Numerical intersections of equality curves show that the regions where these sets outperform the disk are not simply nested. Similar numerical intersections occur in three dimensions between the regular-simplex equality curve and those of explicit five-point and six-point configurations. Motivated by the dimensional dependence of these comparisons, we prove that for each fixed $p<-2<q<0$, the regular simplex has a larger capacity ratio than the ball in all sufficiently large dimensions. Accompanying Python and Mathematica code supports reproduction and further testing of the conjectures.

math.CA

Shorter proof of dimension-free $L^p$ estimates for maximal Riesz transforms

We provide a shorter and more direct proof of $L^p$ estimates for maximal Riesz transforms (of an arbitrary order) in terms of the corresponding Riesz transforms, with a constant independent of the dimension of the Euclidean space $\mathbb R^d$. This result was originally proved by Mateu, Orobitg, P\'erez and Verdera with a constant depending on the dimension, and improved to a dimension-free inequality by Kucharski, Wr\'obel and Zienkiewicz.

math.CA