arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.09502math.CA
收藏

关于检验标记函数的最佳一致多项式逼近

On the Best Uniform Polynomial Approximation to the Checkmark Function

Peter D. Dragnev, Alan R. Legg, Ramon Orive

摘要:

当$α$在$(-1,1)$中变化时,检查标记函数$f(x)=|x-α|$的最佳一致多项式逼近被考虑。对于每个固定度$n$,极小极大误差$E_n (α)$在$α$中是分段解析的。此外,示出了$E_n(α)$以$n-1$分段线性减小/增大部分为特征,称为V形。证明了$α$中交替集上的点是单调递增的,并完整地刻画了它们的动力学性质。我们还证明了Shekhtman的一个猜想,即对于奇数$n$,$E_n(α)$在$α=0$有一个局部极大值。

英文摘要:

The best uniform polynomial approximation of the checkmark function $f(x)=|x-α|$ is considered, as $α$ varies in $(-1,1)$. For each fixed degree $n$, the minimax error $E_n (α)$ is shown to be piecewise analytic in $α$. In addition, $E_n(α)$ is shown to feature $n-1$ piecewise linear decreasing/increasing sections, called V-shapes. The points of the alternation set are proven to be monotone increasing in $α$ and their dynamics are completely characterized. We also prove a conjecture of Shekhtman that for odd $n$, $E_n(α)$ has a local maximum at $α=0$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑