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

用连续分段多项式函数近似梯度

Approximating gradients with continuous piecewise polynomial functions

Andreas Veeser

AI总结:

本文研究了用连续分段多项式函数近似目标函数梯度的问题,证明全局最佳逼近误差等价于局部误差之和,指出连续性不降低局部逼近能力,离散分段多项式无额外逼近能力。

摘要:

受二阶椭圆问题符合有限元方法的启发,本文分析了用连续分段多项式函数近似目标函数梯度的问题。主要结论是全局最佳逼近误差等价于适当求和的局部最佳逼近误差之和。因此,要求连续性不会降低局部逼近能力,不连续分段多项式在固定网格下本质上不提供额外的逼近能力。这一结果意味着可以以分段正则性在整个可接受光滑性范围内给出误差界。此外,它允许在自适应树逼近中使用简单的局部误差函数。

英文摘要:

Motivated by conforming finite element methods for elliptic problems of second order, we analyze the approximation of the gradient of a target function by continuous piecewise polynomial functions over a simplicial mesh. The main result is that the global best approximation error is equivalent to an appropriate sum in terms of the local best approximations errors on elements. Thus, requiring continuity does not downgrade local approximability and discontinuous piecewise polynomials essentially do not offer additional approximation power, even for a fixed mesh. This result implies error bounds in terms of piecewise regularity over the whole admissible smoothness range. Moreover, it allows for simple local error functionals in adaptive tree approximation of gradients.

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

↑