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

次数$(n+1)$多项式是最难用次数$n$多项式一致逼近的$C^{\,n + 1}$函数

The degree-$(n+1)$ polynomials are the most difficult $C^{\,n + 1}$ functions to uniformly approximate with degree-$n$ polynomials

Patrick Kidger

摘要:

函数$f \in C^{\,n + 1}([-1, 1])$与其最佳多项式逼近次数$n$之间的误差存在众所周知的紧界。我们表明,当且仅当$f$是一个多项式的次数$n + 1$的错误满足这些界限。

英文摘要:

There exist well-known tight bounds on the error between a function $f \in C^{\,n + 1}([-1, 1])$ and its best polynomial approximation of degree $n$. We show that the error meets these bounds when and only when $f$ is a polynomial of degree $n + 1$.

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

↑