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

快速衰减多项式再生

Fast-Decaying Polynomial Reproduction

Department of Mathematics “Tullio Levi-Civita(数学系“图利奥·莱维-奇维塔”);University of Padova(帕多瓦大学);Department of Medicine (DIMED), University of Padova(帕多瓦大学医学部(DIMED))

Stefano De Marchi, Giacomo Cappellazzo

AI总结:

本文提出基于快速衰减多项式再生的统一框架,放宽紧支撑限制,实现稳定收敛且光滑的逼近格式,并数值验证了收敛率、Lebesgue常数及光滑性。

摘要:

多项式再生在各种逼近格式的误差估计推导中起着至关重要的作用。特别是,局部多项式再生是误差估计和稳定性分析中的关键要素。然而,对于某些计算相关的方法,如重标定局部径向基函数(RL-RBF),这一要求构成了限制。为了能够以统一且高效的方式分析更广泛类别的逼近方法,本工作引入了一个基于快速衰减多项式再生的框架。在这种方法中,我们不局限于紧支撑基函数,而是允许基函数在无穷远处衰减至零,其衰减速率作为分离距离的函数进行控制。采用快速衰减多项式再生可产生稳定且收敛的逼近格式。当与移动最小二乘法结合使用时,这些方法可以实现光滑性。本文提出的所有关于收敛速率、Lebesgue常数和逼近函数光滑性的理论结果均已通过数值验证,包括在多变量情形下的验证。

英文摘要:

Polynomial reproduction plays a crucial role in deriving error estimates for various approximation schemes. In particular, local polynomial reproduction is a key ingredient in both error estimation and stability analysis. However, for certain computationally relevant methods, such as Rescaled Localized Radial Basis Functions (RL-RBF), this requirement constitutes a limitation. To enable the analysis of a broader class of approximation methods in a unified and efficient manner, the present work introduces a framework based on fast-decaying polynomial reproduction. In this approach, we do not restrict ourselves to compactly supported basis functions. Instead, we allow the basis functions to decay to zero at infinity, with the decay rate controlled as a function of the separation distance. The adoption of fast-decaying polynomial reproduction yields stable and convergent approximation schemes. These methods can achieve smoothness when used in conjunction with moving least squares. All theoretical results presented in this paper regarding the rate of convergence, the Lebesgue constant and the smoothness of the approximant have been numerically validated, including in the multivariate setting.

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

↑