Matrix computations (3rd ed.)
The approximation power of moving least-squares
Mathematics of Computation
Vorticity transport on a Lagrangian Tetrahedral Mesh
Journal of Computational Physics
Journal of Scientific Computing
On derivative estimation and the solution of least squares problems
Journal of Computational and Applied Mathematics
A singularity-avoiding moving least squares scheme for two-dimensional unstructured meshes
Journal of Computational Physics
Hi-index | 0.00 |
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.