arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.11819math.NAcs.NA
收藏

基于Bernstein基的有界约束多项式逼近

Bounds-constrained polynomial approximation using the Bernstein basis

Larry Allen, Robert C. Kirby

摘要:

用多项式逼近光滑函数是数值分析和逼近论中的一个基本问题。最近考虑的一个更难的版本是对近似多项式施加边界约束。本文研究了多项式对函数的逼近函数的问题,当多项式的Bernstein系数在给定次数上满足这样的界时,逼近函数就有这样的界.我们把这个问题归结为一个不等式约束的最优化问题,并给出了一个求精确解的Bernstein系数的算法。此外,我们的方法可以稍微修改,包括等式约束,如质量守恒。它也自然地扩展到单形上的多元多项式。

英文摘要:

A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In this paper, we consider the problem of approximating functions by polynomials whose Bernstein coefficients with respect to a given degree satisfy such bounds, which implies such bounds on the approximant. We frame the problem as an inequality-constrained optimization problem and give an algorithm for finding the Bernstein coefficients of the exact solution. Additionally, our method can be modified slightly to include equality constraints such as mass preservation. It also extends naturally to multivariate polynomials over a simplex.

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

↑