{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T07:56:42Z","timestamp":1776412602209,"version":"3.51.2"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T00:00:00Z","timestamp":1751068800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T00:00:00Z","timestamp":1751068800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003385","name":"Georg-August-Universit\u00e4t G\u00f6ttingen","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003385","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2026,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    There are many ways to upsample functions from multivariate scattered data locally, using only a few neighbouring data points of the evaluation point. The position and number of the actually used data points is not trivial, and many cases like Moving Least Squares require point selections that guarantee local recovery of polynomials up to a specified order. This paper suggests a kernel-based greedy local algorithm for point selection that has no such constraints. It realizes the optimal\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$L_\\infty $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>L<\/mml:mi>\n                            <mml:mi>\u221e<\/mml:mi>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    convergence rates in Sobolev spaces using the minimal number of points necessary for that purpose. On the downside, it does not care for smoothness, relying on fast\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$L_\\infty $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>L<\/mml:mi>\n                            <mml:mi>\u221e<\/mml:mi>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    convergence to a smooth function. The algorithm ignores near-duplicate points automatically and works for quite irregularly distributed point sets by proper selection of points. Its computational complexity is constant for each evaluation point, being dependent only on smoothness and scale parameters of the kernel. Various numerical examples are provided. As a byproduct, it turns out that the well-known instability of global kernel-based interpolation in the standard basis of kernel translates arises already locally, independent of global kernel matrices and small separation distances.\n                  <\/jats:p>","DOI":"10.1007\/s11075-025-02142-5","type":"journal-article","created":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T21:25:31Z","timestamp":1751059531000},"page":"611-635","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Greedy adaptive local recovery of functions in Sobolev spaces"],"prefix":"10.1007","volume":"102","author":[{"given":"Robert","family":"Schaback","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,28]]},"reference":[{"issue":"1","key":"2142_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1137\/S0036142999361608","volume":"39","author":"MG Armentano","year":"2001","unstructured":"Armentano, M.G.: Error estimates in Sobolev spaces for moving least square approximations. SIAM J. Numer. Anal. 39(1), 38\u201351 (2001)","journal-title":"SIAM J. Numer. Anal."},{"key":"2142_CR2","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1002\/(SICI)1097-0207(19970228)40:4<727::AID-NME86>3.0.CO;2-N","volume":"40","author":"I Babuska","year":"1997","unstructured":"Babuska, I., Melenk, J.M.: The Partition of Unity Method. Int. J. Numer. Meths. Eng. 40, 727\u2013758 (1997)","journal-title":"Int. J. Numer. Meths. Eng."},{"key":"2142_CR3","unstructured":"Barnett, G.A.: A Robust RBF-FD Formulation based on Polyharmonic Splines and Polynomials. PhD thesis, Univ. of Colorado, Boulder, (2015)"},{"key":"2142_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18, 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"2142_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0021-9045(89)90090-7","volume":"59","author":"LP Bos","year":"1989","unstructured":"Bos, L.P., Salkauskas, K.: Moving least squares are Backus-Gilbert optimal. J. Approximation Theory 59, 267\u2013275 (1989)","journal-title":"J. Approximation Theory"},{"key":"2142_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543241","volume-title":"Radial Basis Functions","author":"MD Buhmann","year":"2003","unstructured":"Buhmann, M.D.: Radial Basis Functions. Theory and Implementations. Cambridge University Press, Cambridge, UK (2003)"},{"key":"2142_CR7","doi-asserted-by":"crossref","unstructured":"Cavoretto, R.: Adaptive radial basis function partition of unity interpolation, a bivariate algorithm for unstructured data. J. Sci. Comput. 87 (2021)","DOI":"10.1007\/s10915-021-01432-z"},{"key":"2142_CR8","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s00211-018-0973-3","volume":"140","author":"O Davydov","year":"2018","unstructured":"Davydov, O., Schaback, R.: Minimal numerical differentiation formulas. Numerische Mathematik 140, 555\u2013592 (2018)","journal-title":"Numerische Mathematik"},{"key":"2142_CR9","first-page":"398","volume":"39","author":"O Davydov","year":"2019","unstructured":"Davydov, O., Schaback, R.: Optimal stencils in Sobolev spaces. IMA J. Numerical Anal. 39, 398\u2013422 (2019)","journal-title":"IMA J. Numerical Anal."},{"key":"2142_CR10","unstructured":"De\u00a0Marchi, S.,\u00a0Schaback, R.,\u00a0Wendland, H.: Optimal point locations for radial basis interpolation. In: preparation (2002)"},{"key":"2142_CR11","doi-asserted-by":"crossref","unstructured":"De\u00a0Marchi, S.,\u00a0Schaback, R.,\u00a0Wendland, H.: Near-optimal data-independent point locations for radial basis function interpolation. Adv. Comput. Math. 23(3), 317\u2013330 (2005)","DOI":"10.1007\/s10444-004-1829-1"},{"key":"2142_CR12","unstructured":"Di Tommaso, F., Dell\u2019Accio, F.: Scattered data interpolation by Shepard\u2019s like methods: Classical results and recent advances. 9, 32\u201344 (2016)"},{"key":"2142_CR13","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0898-1221(01)00295-4","volume":"43","author":"TA Driscoll","year":"2002","unstructured":"Driscoll, T.A., Fornberg, B.: Interpolation in the limit of increasingly flat radial basis functions. Comput. Math. Appl. 43, 413\u2013422 (2002)","journal-title":"Comput. Math. Appl."},{"key":"2142_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0377-0427(86)90175-5","volume":"16","author":"R Farwig","year":"1986","unstructured":"Farwig, R.: Multivariate interpolation of arbitrarily spaced data by moving least squares methods. J. Comp. Appl. Math. 16, 79\u201393 (1986)","journal-title":"J. Comp. Appl. Math."},{"key":"2142_CR15","series-title":"Interdisciplinary Mathematical Sciences","doi-asserted-by":"crossref","DOI":"10.1142\/9335","volume-title":"Kernel-based Approximation Methods using MATLAB","author":"G Fasshauer","year":"2015","unstructured":"Fasshauer, G., McCourt, M.: Kernel-based Approximation Methods using MATLAB. Interdisciplinary Mathematical Sciences, vol. 19. World Scientific, Singapore (2015)"},{"key":"2142_CR16","doi-asserted-by":"crossref","unstructured":"Fasshauer, G.E.: Approximate moving least-squares approximation with compactly supported radial weights. In Meshfree methods for partial differential equations (Bonn, 2001), volume\u00a026 of Lect. Notes Comput. Sci. Eng. pages 105\u2013116. Springer, Berlin (2003)","DOI":"10.1007\/978-3-642-56103-0_8"},{"key":"2142_CR17","doi-asserted-by":"crossref","unstructured":"Flyer, N.,\u00a0Fornberg, B.,\u00a0Bayona, V., Barnett, G.A.: On the role of polynomials in RBF-FD approximations: I. Interpolation and accuracy. J. Computat. Phys. 321, 21\u201338 (2016)","DOI":"10.1016\/j.jcp.2016.05.026"},{"key":"2142_CR18","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.camwa.2012.11.006","volume":"65","author":"B Fornberg","year":"2013","unstructured":"Fornberg, B., Lehto, E., Powell, C.: Stable calculation of Gaussian-based RBF-FD stencils. Comput. Math. Appl. 65, 627\u2013637 (2013)","journal-title":"Comput. Math. Appl."},{"key":"2142_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0898-1221(04)90004-1","volume":"47","author":"B Fornberg","year":"2004","unstructured":"Fornberg, B., Wright, G., Larsson, E.: Some observations regarding interpolants in the limit of flat radial basis functions. Comput. Math. Appl. 47, 37\u201355 (2004). https:\/\/doi.org\/10.1016\/S0898-1221(04)90004-1","journal-title":"Comput. Math. Appl."},{"key":"2142_CR20","doi-asserted-by":"crossref","unstructured":"Franke, R., Nielson, G.M.: Scattered data interpolation and applications: A tutorial and survey. In:\u00a0Hagen, H., and\u00a0Roller, D. editors, Geometric Modeling, Methods and Applications, pages 131\u2013160 (1991)","DOI":"10.1007\/978-3-642-76404-2_6"},{"key":"2142_CR21","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1007\/s10915-015-0120-6","volume":"67","author":"A Heryudono","year":"2016","unstructured":"Heryudono, A., Larsson, E., Ramage, A.: Preconditioning for radial basis function partition of unity methods. J. Sci. Comput. 67, 1089\u20131109 (2016)","journal-title":"J. Sci. Comput."},{"key":"2142_CR22","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1090\/S0025-5718-1981-0616367-1","volume":"37","author":"P Lancaster","year":"1981","unstructured":"Lancaster, P., Salkauskas, K.: Surfaces generated by moving least squares methods. Math. Comput. 37, 141\u2013158 (1981)","journal-title":"Math. Comput."},{"key":"2142_CR23","doi-asserted-by":"publisher","first-page":"A2096","DOI":"10.1137\/120899108","volume":"35","author":"E Larsson","year":"2013","unstructured":"Larsson, E., Lehto, E., Heryodono, A., Fornberg, B.: Stable computation of differentiation matrices and scattered node stencils based on Gaussian radial basis functions. SIAM J. Sci. Comput. 35, A2096\u2013A2119 (2013)","journal-title":"SIAM J. Sci. Comput."},{"key":"2142_CR24","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.camwa.2005.01.010","volume":"49","author":"Elisabeth Larsson","year":"2005","unstructured":"Larsson, Elisabeth, Fornberg, Bengt: Theoretical and computational aspects of multivariate interpolation with increasingly flat radial basis functions. Comput. Math. Appl. 49, 103\u2013130 (2005)","journal-title":"Comput. Math. Appl."},{"issue":"6","key":"2142_CR25","doi-asserted-by":"publisher","first-page":"A2538","DOI":"10.1137\/17M1118087","volume":"39","author":"Elisabeth Larsson","year":"2017","unstructured":"Larsson, Elisabeth, Shcherbakov, Victor, Heryudono, Alfa: A least squares radial basis function partition of unity method for solving PDEs. SIAM J. Sci. Comput. 39(6), A2538\u2013A2563 (2017)","journal-title":"SIAM J. Sci. Comput."},{"key":"2142_CR26","doi-asserted-by":"publisher","first-page":"1517","DOI":"10.1090\/S0025-5718-98-00974-0","volume":"67","author":"D Levin","year":"1998","unstructured":"Levin, D.: The approximation power of moving least-squares. Math. Comput. 67, 1517\u20131531 (1998)","journal-title":"Math. Comput."},{"issue":"3","key":"2142_CR27","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1093\/imanum\/drr030","volume":"32","author":"D Mirzaei","year":"2012","unstructured":"Mirzaei, D., Schaback, R., Dehghan, M.: On generalized moving least squares and diffuse derivatives. IMA J. Numer. Anal. 32(3), 983\u20131000 (2012)","journal-title":"IMA J. Numer. Anal."},{"key":"2142_CR28","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10496-009-0301-y","volume":"25","author":"M Mouattamid","year":"2009","unstructured":"Mouattamid, M., Schaback, R.: Recursive kernels. Anal. Theory Appl. 25, 301\u2013316 (2009)","journal-title":"Anal. Theory Appl."},{"key":"2142_CR29","unstructured":"M\u00fcller, S.: Komplexit\u00e4t und Stabilit\u00e4t von kernbasierten Rekonstruktionsmethoden. PhD thesis, University of G\u00f6ttingen, (2009). https:\/\/ediss.uni-goettingen.de\/handle\/11858\/00-1735-0000-0006-B3BA-E"},{"key":"2142_CR30","doi-asserted-by":"crossref","unstructured":"M\u00fcller, S.,\u00a0Schaback, R.: A Newton basis for kernel spaces. J. Approximation Theory 161, 645\u2013655 (2009)","DOI":"10.1016\/j.jat.2008.10.014"},{"key":"2142_CR31","doi-asserted-by":"crossref","unstructured":"Noorizadeghan, A.,\u00a0Schaback, R.: Introducing the evaluation condition number: A novel assessment of conditioning in radial basis function methods. Eng. Anal. Boundary Elements 166 (2024)","DOI":"10.1016\/j.enganabound.2024.105827"},{"key":"2142_CR32","unstructured":"Santin, G.,\u00a0Haasdonk, B.: Convergence rate of the data-independent $$P$$-greedy algorithm in kernel-based approximation. Dolomites Res. Notes Approx. 10(Special Issue), 68\u201378 (2017)"},{"issue":"2","key":"2142_CR33","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1006\/jath.1994.1130","volume":"79","author":"R Schaback","year":"1994","unstructured":"Schaback, R.: Lower bounds for norms of inverses of interpolation matrices for radial basis functions. J. Approximation Theory 79(2), 287\u2013306 (1994)","journal-title":"J. Approximation Theory"},{"key":"2142_CR34","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF02432002","volume":"3","author":"R Schaback","year":"1995","unstructured":"Schaback, R.: Error estimates and condition numbers for radial basis function interpolation. Adv. Comput. Math. 3, 251\u2013264 (1995)","journal-title":"Adv. Comput. Math."},{"key":"2142_CR35","unstructured":"Schaback, R.: Reconstruction of multivariate functions from scattered data. Manuscript, available via http:\/\/webvm.num.math.uni-goettingen.de\/schaback\/teaching\/rbfbook_2.pdf (1997)"},{"key":"2142_CR36","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00365-004-0585-2","volume":"21","author":"R Schaback","year":"2005","unstructured":"Schaback, R.: Multivariate interpolation by polynomials and radial basis functions. Constructive Approximation 21, 293\u2013317 (2005)","journal-title":"Constructive Approximation"},{"key":"2142_CR37","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.cam.2006.11.023","volume":"212","author":"R Schaback","year":"2008","unstructured":"Schaback, R.: Limit problems for interpolation by analytic radial basis functions. J. Comp. Appl. Math. 212, 127\u2013149 (2008)","journal-title":"J. Comp. Appl. Math."},{"key":"2142_CR38","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.1016\/j.spa.2010.05.009","volume":"120","author":"M Scheuerer","year":"2010","unstructured":"Scheuerer, M.: Regularity of the sample paths of a general second order random field. Stoch. Proc. Appl. 120, 1879\u20131897 (2010)","journal-title":"Stoch. Proc. Appl."},{"key":"2142_CR39","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1017\/S0956792513000016","volume":"24","author":"M Scheuerer","year":"2013","unstructured":"Scheuerer, M., Schlather, M., Schaback, R.: Interpolation of spatial data - a stochastic or a deterministic problem? Eur. J. Appl. Math. 24, 601\u2013629 (2013)","journal-title":"Eur. J. Appl. Math."},{"key":"2142_CR40","doi-asserted-by":"crossref","unstructured":"Shepard, D.: A two-dimensional interpolation function for irregularly-spaced data. In: Proceedings of the 23th National Conference ACM, pages 517\u2013523. ACM New York (1968)","DOI":"10.1145\/800186.810616"},{"key":"2142_CR41","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10444-011-9192-5","volume":"36","author":"G Song","year":"2012","unstructured":"Song, G., Riddle, J., Fasshauer, G.E., Hickernell, F.J.: Multivariate interpolation with increasingly flat radial basis functions of finite smoothness. Adv. Comp. Math. 36, 485\u2013501 (2012)","journal-title":"Adv. Comp. Math."},{"key":"2142_CR42","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/imanum\/21.1.285","volume":"21","author":"H Wendland","year":"2001","unstructured":"Wendland, H.: Local polynomial reproduction and moving least squares approximation. IMA J. Numerical Anal. 21, 285\u2013300 (2001)","journal-title":"IMA J. Numerical Anal."},{"key":"2142_CR43","unstructured":"Wendland, H.: Fast evaluation of radial basis functions: Methods based on partition of unity. In: Chui, C.K., Schumaker, L.L. and\u00a0St\u00f6ckler, J. editors, Approximation Theory X: Wavelets, Splines, and Applications, pages 473\u2013483. Vanderbilt University Press (2002)"},{"key":"2142_CR44","volume-title":"Scattered Data Approximation","author":"H Wendland","year":"2005","unstructured":"Wendland, H.: Scattered Data Approximation. Cambridge University Press, Cambridge, UK (2005)"},{"key":"2142_CR45","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00365-022-09592-3","volume":"57","author":"T Wenzel","year":"2023","unstructured":"Wenzel, T., Santin, G., Haasdonk, B.: Analysis of target data-dependent greedy kernel algorithms: Convergence rates for $$f$$-,$$f\\cdot p$$, and $$f\/p$$ -greedy. Constructive Approximation 57, 45\u201374 (2023)","journal-title":"Constructive Approximation"},{"issue":"1","key":"2142_CR46","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.jcp.2005.05.030","volume":"212","author":"GB Wright","year":"2006","unstructured":"Wright, G.B., Fornberg, B.: Scattered node compact finite difference-type formulas generated from radial basis functions. J. Comput. Phys. 212(1), 99\u2013123 (2006)","journal-title":"J. Comput. Phys."},{"issue":"2","key":"2142_CR47","first-page":"1","volume":"8","author":"Z Wu","year":"1992","unstructured":"Wu, Z.: Hermite-Birkhoff interpolation of scattered data by radial basis functions. Approximation Theory Appl. 8(2), 1\u201310 (1992)","journal-title":"Approximation Theory Appl."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02142-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02142-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02142-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T07:17:17Z","timestamp":1776410237000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02142-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,28]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["2142"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02142-5","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,28]]},"assertion":[{"value":"29 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}