Optimal stencils in Sobolev spaces
From MaRDI portal
Publication:5113340
Abstract: This paper proves that the approximation of pointwise derivatives of order of functions in Sobolev space by linear combinations of function values cannot have a convergence rate better than , 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 , proving that the rates are optimal for given and . And, for a fixed node set , the convergence rate in any Sobolev space cannot be better than where is the maximal possible order of polynomial exactness of approximations based on , no matter how large 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.
Recommendations
- Error bounds for GMLS derivatives approximations of Sobolev functions
- Kernel based approximation in Sobolev spaces with radial basis functions
- Spectral approximation orders of radial basis function interpolation on the Sobolev space
- Convergence of derivatives of optimal nodal splines
- Optimal approximation of multivariate periodic Sobolev functions in the sup-norm
Cited in
(23)- An iterated quasi-interpolation approach for derivative approximation
- Error and stability estimates of a least-squares variational kernel-based method for second order elliptic PDEs
- A weighted combination of reproducing kernel particle shape functions with cardinal functions of scalable polyharmonic spline radial kernel utilized in Galerkin weak form of a mathematical model related to anti-angiogenic therapy
- A non-oscillatory finite volume scheme using a weighted smoothed reconstruction
- Minimal numerical differentiation formulas
- A meshless finite difference method for elliptic interface problems based on pivoted QR decomposition
- The direct radial basis function partition of unity (D-RBF-PU) method for solving PDEs
- The Matérn model: a journey through statistics, numerical analysis and machine learning
- A fault detection method based on partition of unity and kernel approximation
- An RBF-FD closest point method for solving PDEs on surfaces
- Error bounds for a least squares meshless finite difference method on closed manifolds
- Octant-based stencil selection for meshless finite difference methods in 3D
- MGM: A Meshfree Geometric Multilevel Method for Systems Arising from Elliptic Equations on Point Cloud Surfaces
- Improved stencil selection for meshless finite difference methods in 3D
- A direct RBF-PU method for simulating the infiltration of cytotoxic T-lymphocytes into the tumor microenvironment
- A flux-corrected RBF-FD method for convection dominated problems in domains and on manifolds
- A weak-form RBF-generated finite difference method
- A compact radial basis function partition of unity method
- Approximation with conditionally positive definite kernels on deficient sets
- Guidelines for RBF-FD discretization: numerical experiments on the interplay of a multitude of parameter choices
- Generalized moving least squares vs. radial basis function finite difference methods for approximating surface derivatives
- A rational RBF interpolation with conditionally positive definite kernels
- Numerical simulation of a prostate tumor growth model by the RBF-FD scheme and a semi-implicit time discretization
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)