Moving least squares via orthogonal polynomials

Details Moving least squares via orthogonal polynomials Moving least squares via orthogonal polynomials

2009-08-05

arxiv.org/abs/0908.0668v2

Mathematics

Numerical Analysis

Extensively revised in response to referees' comments

Scientific paper

10.1137/09076711X

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.

Affiliated with

Also associated with

No associations

Rating

Moving least squares via orthogonal polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Moving least squares via orthogonal polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Moving least squares via orthogonal polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-254886