Optimal stencils in Sobolev spaces

From MaRDI portal
Publication:5113340

DOI10.1093/IMANUM/DRX076zbMATH Open1483.65170arXiv1611.04750OpenAlexW2562220820MaRDI QIDQ5113340FDOQ5113340


Authors: Robert Schaback, O. Davydov Edit this on Wikidata


Publication date: 4 June 2020

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Abstract: This paper proves that the approximation of pointwise derivatives of order s of functions in Sobolev space W2m(Rd) by linear combinations of function values cannot have a convergence rate better than msd/2, no matter how many nodes are used for approximation and where they are placed. These convergence rates are attained by {em scalable} approximations that are exact on polynomials of order at least lfloormd/2floor+1, proving that the rates are optimal for given m,,s, and d. And, for a fixed node set XsubsetRd, the convergence rate in any Sobolev space W2m(Omega) cannot be better than qs where q is the maximal possible order of polynomial exactness of approximations based on X, no matter how large m is. In particular,scalable stencil constructions via polyharmonic kernels are shown to realize the optimal convergence rates, and good approximations of their error in Sobolev space can be calculated via their error in Beppo-Levi spaces. This allows to construct near-optimal stencils in Sobolev spaces stably and efficiently, for use in meshless methods to solve partial differential equations via generalized finite differences (RBF-FD). Numerical examples are included for illustration.


Full work available at URL: https://arxiv.org/abs/1611.04750




Recommendations





Cited In (23)





This page was built for publication: Optimal stencils in Sobolev spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113340)