arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.11533math.NAcs.NA
收藏

伯恩斯坦逼近及更多:借助初等概率论的证明

Bernstein approximation and beyond: proofs by means of elementary probability theory

Tiangang Cui, Friedrich Pillichshammer

AI总结:

本研究介绍用初等概率论证明伯恩斯坦多项式相关的魏尔斯特拉斯逼近定理及利普希茨函数误差界的方法,并将其扩展到Szász-Mirakjan算子和Baskakov算子的情形。

摘要:

伯恩斯坦多项式为魏尔斯特拉斯逼近定理提供了构造性证明,该定理指出闭有界区间上的每个连续函数都能被多项式以任意精度一致逼近。有趣的是,这一结果的证明可以使用初等概率论完成。通过这种方式,人们甚至可以得到利普希茨函数的误差界。在本札记中,我们介绍这些技术,并展示该方法如何能自然地扩展到其他有趣的情形。作为示例,我们以初等方式得到了Szász-Mirakjan算子和Baskakov算子的相关结果。

英文摘要:

Bernstein polynomials provide a constructive proof for the Weierstrass approximation theorem, which states that every continuous function on a closed bounded interval can be uniformly approximated by polynomials with arbitrary accuracy. Interestingly the proof of this result can be done using elementary probability theory. This way one can even get error bounds for Lipschitz functions. In this note, we present these techniques and show how the method can be extended naturally to other interesting situations. As examples, we obtain in an elementary way results for the Szász-Mirakjan operator and the Baskakov operator.

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

↑