{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T07:55:49Z","timestamp":1776412549509,"version":"3.51.2"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T00:00:00Z","timestamp":1750982400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T00:00:00Z","timestamp":1750982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"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                    Shepard\u2019s method is a fast algorithm that has been classically used to interpolate scattered data in several dimensions. This is an important and well-known technique in numerical analysis founded in the main idea that data that is far away from the approximation point should contribute less to the resulting approximation. Approximating piecewise smooth functions in\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathbb {R}^{\\varvec{n}}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mrow>\n                              <mml:mi>R<\/mml:mi>\n                            <\/mml:mrow>\n                            <mml:mrow>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:mrow>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    near discontinuities along a hypersurface in\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathbb {R}^{\\varvec{n-1}}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mrow>\n                              <mml:mi>R<\/mml:mi>\n                            <\/mml:mrow>\n                            <mml:mrow>\n                              <mml:mi>n<\/mml:mi>\n                              <mml:mo>-<\/mml:mo>\n                              <mml:mn>1<\/mml:mn>\n                            <\/mml:mrow>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    is challenging for the Shepard\u2019s method or any other linear technique for sparse data due to the inherent difficulty in accurately capturing sharp transitions. This article is devoted to constructing a non-linear Shepard\u2019s method using the basic ideas that arise from the weighted essentially non-oscillatory interpolation method (WENO). The proposed method aims to enhance the accuracy and reduce the smearing of the traditional Shepard\u2019s method by incorporating WENO\u2019s adaptive and non-linear weighting mechanism. To address this challenge, we non-linearly modify the weight function in a general Shepard\u2019s method, considering any weight function, rather than relying solely on the inverse of the distance squared. This approach effectively reduces the smearing of discontinuities providing a sharper approximation. The numerical experiments presented demonstrate the superior performance of the new method close to the discontinuities and confirm the theoretical results exposed in this manuscript.\n                  <\/jats:p>","DOI":"10.1007\/s11075-025-02141-6","type":"journal-article","created":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T07:22:09Z","timestamp":1751008929000},"page":"593-609","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Weighted essentially non-oscillatory shepard method"],"prefix":"10.1007","volume":"102","author":[{"given":"David","family":"Levin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 M.","family":"Ram\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Ruiz-\u00c1lvarez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dionisio F.","family":"Y\u00e1\u00f1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,27]]},"reference":[{"key":"2141_CR1","doi-asserted-by":"crossref","unstructured":"Shepard, D.: A two-dimensional interpolation function for irregularly-spaced data. In: Proceedings of the 1968 23rd ACM National Conference, pp. 517\u2013524 (1968)","DOI":"10.1145\/800186.810616"},{"key":"2141_CR2","volume-title":"Gaussian Processes for Machine Learning","author":"CE Rasmussen","year":"2006","unstructured":"Rasmussen, C.E., Williams, C.K.I.: Gaussian Processes for Machine Learning. MIT Press, Cambridge, MA, USA (2006)"},{"issue":"8","key":"2141_CR3","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1029\/JB076i008p01905","volume":"76","author":"RL Hardy","year":"1971","unstructured":"Hardy, R.L.: Multiquadric equations of topography and other irregular surfaces. J. Geophys. Res. 76(8), 1905\u20131915 (1971)","journal-title":"J. Geophys. Res."},{"key":"2141_CR4","unstructured":"Mat\u00e9rn, B.: Spatial Variation: Stochastic Models and Their Application to Some Problems in Forest Surveys and Other Sampling Investigations vol. 49, pp. 1\u2013144. Meddelanden fran Statens Skogsforskningsinstitut, Stockholm, Sweden (1960)"},{"key":"2141_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511617539","volume-title":"Scattered Data Approximation","author":"H Wendland","year":"2004","unstructured":"Wendland, H.: Scattered Data Approximation. Cambridge University Press, Cambridge, UK (2004)"},{"key":"2141_CR6","volume-title":"Approximation Theory X: Wavelets","author":"H Wendland","year":"2002","unstructured":"Wendland, H.: Fast evaluation of radial basis functions: Methods based on partition of unity. In: Chui, C.K., Schumaker, L.L., St\u00f6cker, J. (eds.) Approximation Theory X: Wavelets. Splines and Applications. Vanderbilt University Press, Nashville, TN, USA (2002)"},{"key":"2141_CR7","doi-asserted-by":"crossref","unstructured":"Fasshauer, G.E.: Meshfree Approximation Methods with MATLAB. World Scientifc, Singapore (2007). Chap. 23","DOI":"10.1142\/6437"},{"issue":"1","key":"2141_CR8","first-page":"359","volume":"36","author":"F Dell\u2019Accio","year":"2016","unstructured":"Dell\u2019Accio, F., Di Tommaso, F., Hormann, K.: On the approximation order of triangular shepard interpolation. IMA J. Numer. Anal. 36(1), 359\u2013379 (2016)","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"2141_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10915-020-01159-3","volume":"82","author":"R Cavoretto","year":"2020","unstructured":"Cavoretto, R., De Rossi, A., Dell\u2019Accio, F., Di Tommaso, F.: An efficient trivariate algorithm for tetrahedral shepard interpolation. J. Sci. Comput. 82(3), 57 (2020)","journal-title":"J. Sci. Comput."},{"key":"2141_CR10","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1214\/aoms\/1177728190","volume":"27","author":"M Rosenblatt","year":"1956","unstructured":"Rosenblatt, M.: Remarks on some nonparametric estimates of a density function. Ann. Math. Stat. 27, 832\u2013837 (1956)","journal-title":"Ann. Math. Stat."},{"key":"2141_CR11","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1214\/aoms\/1177704472","volume":"33","author":"E Parzen","year":"1962","unstructured":"Parzen, E.: On estimation of a probability density function and mode. Annals of Mathematical Statistics 33, 1065\u20131076 (1962)","journal-title":"Annals of Mathematical Statistics"},{"key":"2141_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1137\/1109020","volume":"9","author":"EA Nadaraya","year":"1964","unstructured":"Nadaraya, E.A.: On estimating regression. Theory Probab. Appl. 9, 141\u2013142 (1964)","journal-title":"Theory Probab. Appl."},{"key":"2141_CR13","first-page":"359","volume":"26","author":"GS Watson","year":"1964","unstructured":"Watson, G.S.: Smooth regression analysis. Sankhya, Series A 26, 359\u2013372 (1964)","journal-title":"Sankhya, Series A"},{"key":"2141_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.apnum.2019.09.005","volume":"150","author":"F Dell\u2019Accio","year":"2020","unstructured":"Dell\u2019Accio, F., Di Tommaso, F.: On the hexagonal shepard method. Appl. Numer. Math. 150, 51\u201364 (2020)","journal-title":"Appl. Numer. Math."},{"key":"2141_CR15","doi-asserted-by":"crossref","unstructured":"Dell\u2019Accio, F., Di\u00a0Tommaso, F., Ala, G., Francomano, E.: Electric scalar potential estimations for non-invasive brain activity detection through multinode shepard method. In: MELECON 2022 \u2013 IEEE Mediterranean Electrotechnical Conference, Proceedings, pp. 1264\u20131268 (2022)","DOI":"10.1109\/MELECON53508.2022.9842881"},{"key":"2141_CR16","doi-asserted-by":"publisher","first-page":"224","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, 224 (1998)","journal-title":"Math. Comput."},{"issue":"1","key":"2141_CR17","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1137\/070679065","volume":"51","author":"C-W Shu","year":"1999","unstructured":"Shu, C.-W.: High order weighted essentially nonoscillatory schemes for convection dominated problems. SIAM Rev. 51(1), 82\u2013126 (1999)","journal-title":"SIAM Rev."},{"issue":"2","key":"2141_CR18","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s10915-010-9351-8","volume":"43","author":"F Ar\u00e0ndiga","year":"2010","unstructured":"Ar\u00e0ndiga, F., Belda, A.M., Mulet, P.: Point-value WENO multiresolution applications to stable image compression. J. Sci. Comput. 43(2), 158\u2013182 (2010)","journal-title":"J. Sci. Comput."},{"key":"2141_CR19","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/BF01386213","volume":"2","author":"JH Halton","year":"1960","unstructured":"Halton, J.H.: On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numer. Math. 2, 84\u201390 (1960)","journal-title":"Numer. Math."},{"issue":"2","key":"2141_CR20","first-page":"35","volume":"15","author":"R Cavoretto","year":"2022","unstructured":"Cavoretto, R., Rossi, A.D., Perracchione, E., Lancellotti, S.: Software implementation of the partition of unity method. Dolomites Res. Notes Approx. 15(2), 35\u201346 (2022)","journal-title":"Dolomites Res. Notes Approx."},{"key":"2141_CR21","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF02123482","volume":"4","author":"H Wendland","year":"1995","unstructured":"Wendland, H.: Piecewise polynomial, positive definite and compactly supported radial functions with minimal degree. Adv. Comput. Math. 4, 389\u2013396 (1995)","journal-title":"Adv. Comput. Math."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02141-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02141-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02141-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T07:16:49Z","timestamp":1776410209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02141-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,27]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["2141"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02141-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,27]]},"assertion":[{"value":"14 January 2025","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":"27 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"}}]}}