Error bounds for kernel-based numerical differentiation
The literature on meshless methods shows that kernel-based numerical differentiation formulae are robust and provide high accuracy at low cost. This paper analyzes the error of such formulas, using the new technique of growth functions. It allows to bypass certain technical assumptions that were needed to prove the standard error bounds on interpolants and their derivatives. Since differentiation formulas based on polynomials also have error bounds in terms of growth functions, we have a convenient way to compare kernel-based and polynomial-based formulas. It follows that kernel-based formulas are comparable in accuracy to the best possible polynomial-based formulas. A variety of examples is provided.
- 3.Davydov, O.: Error bound for radial basis interpolation in terms of a growth function. In: Cohen, A., Merrien, J.L., Schumaker, L.L. (eds.) Curve and Surface Fitting: Avignon 2006, pp. 121–130. Nashboro Press, Brentwood (2007)Google Scholar
- 8.Rieger, C., Zwicknagl, B., Schaback, R.: Sampling and stability. In: Dæhlen, M., Floater, M., Lyche, T., Merrien, J.-L., Mørken, K., Schumaker, L. (eds.) Mathematical Methods for Curves and Surfaces, vol. 5862 of Lecture Notes in Computer Science, pp. 347–369. Springer (2010)Google Scholar
- 9.Schaback, R.: Native Hilbert spaces for radial basis functions I. In: Buhmann, M., Mache, D.H., Felten, M., Müller, M. (eds.) New Developments in Approximation Theory, number 132 in International Series of Numerical Mathematics, pp. 255–282. Birkhäuser Verlag (1999)Google Scholar
- 10.Schaback, R.: Direct discretizations with applications to meshless methods for PDEs. Dolomites Research Notes on Approximation, vol. 6. Proceedings of DWCAA12, pp. 37–51 (2013)Google Scholar