Skip Navigation

IMA Journal of Numerical Analysis 2001 21(1):285-300; doi:10.1093/imanum/21.1.285
© 2001 by Institute of Mathematics and its Applications
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wendland, H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Local polynomial reproduction and moving least squares approximation

Holger Wendland1

1 Institut für Numerische und Angewandte Mathematik, Universität Göttingen, Lotzestraße 16-18, D-37083 Göttingen, Germany

Local polynomial reproduction is a key ingredient in providing error estimates for several approximation methods. To bound the Lebesgue constants is a hard task especially in a multivariate setting. We provide a result which allows us to bound the Lebesgue constants uniformly and independently of the space dimension by oversampling. We get explicit and small bounds for the Lebesgue constants. Moreover, we use these results to establish error estimates for the moving least squares approximation scheme, also with special emphasis on the involved constants. We discuss the numerical treatment of the method and analyse its effort. Finally, we give large scale examples.

Key Words: scattered data approximation, approximation orders

Received 6 October 1999. Accepted 8 March 2000.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.