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

通过正交多项式的移动最小二乘法

Moving least squares via orthogonal polynomials

University of Stuttgart(斯图加特大学);University of Bath(巴斯大学)

Michael Carley

AI总结:

提出一种基于离散点正交多项式的移动最小二乘插值与微分方法,有效避免节点配置奇异导致的算法失效,并通过二维和三维随机点分布上的导数估计验证了其鲁棒性、精度和收敛性。

摘要:

在离散点正交多项式的框架下,提出了一种移动最小二乘插值与微分方法。该方法鲁棒且高效,能够避免移动最小二乘法中因系统节点特定配置而导致的奇异性与崩溃。通过将其应用于二维和三维随机点分布上测试函数的一阶和二阶导数估计,并详细考察一个选定配置上的二阶导数评估,对该方法进行了测试。考察了该方法相对于长度尺度(点间距)和所用点数的精度与收敛性。结果表明该方法鲁棒、精确且收敛。

英文摘要:

A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the moving least squares method caused by particular configurations of nodes in the system. The method is tested by applying it to the estimation of first and second derivatives of test functions on random point distributions in two and three dimensions and by examining in detail the evaluation of second derivatives on one selected configuration. The accuracy and convergence of the method are examined with respect to length scale (point separation) and the number of points used. The method is found to be robust, accurate and convergent.

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

↑