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.
Comparison between compactly-supported spherical radial basis functions and interpolating moving least squares meshless interpolants for gravity data interpolation in geodesy and geophysics
On the role of weak Marcinkiewicz-Zygmund constants in polynomial approximation by orthogonal bases
School of Mathematics and Statistics, Guizhou University(贵州大学数学与统计学院);Department of Mathematics "Tullio Levi-Civita", University of Padova(帕多瓦大学蒂利奥·莱维-奇维塔数学系)
The Linearly Independent Non Orthogonal yet Energy Preserving (LINOEP) vectors
Indian Institute of Technology Delhi(印度德里理工学院);Jaypee Institute of Information Technology - NOIDA(贾伊皮信息技术学院-诺伊达);Samsung R & D Institute India - Delhi(三星印度研发中心-德里)
Generalized Moving Least-Squares Methods for Solving Vector-valued PDEs on Unknown Manifolds
School of Information Science and Technology, ShanghaiTech University(上海科技大学信息科学与技术学院);School of Mathematics, University of Minnesota(明尼苏达大学数学学院);Institute of Mathematical Sciences, ShanghaiTech University(上海科技大学数学科学研究所)
Alternating least squares as moving subspace correction
Skolkovo Institute of Science and Technology(斯科尔科沃科学技术研究所);ETH Zurich(苏黎世联邦理工学院);University of Bonn(波恩大学);Max Planck Institute for Mathematics in the Sciences(马克斯·普朗克科学促进学会数理研究所)
Probabilistic Analysis of Least Squares, Orthogonal Projection, and QR Factorization Algorithms Subject to Gaussian Noise
Department of Computer Science, University of Saskatchewan(萨斯喀彻温大学计算机科学系);Department of Applied Mathematics, University of Colorado Denver(科罗拉多大学丹佛分校应用数学系);Department of Mathematics, The University of Tulsa(塔尔萨大学数学系)