Fast computation of triangular Shepard interpolants

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

卷:354

Article; Proceedings Paper

Cavoretto, Roberto¹  De Rossi, Alessandra¹  Dell'Accio, Francesco²  Di Tommaso, Filomena² 

[1] Univ Torino, Dept Math Giuseppe Peano, Via Carlo Alberto 10, I-10123 Turin, Italy

[2] Univ Calabria, Dept Math & Comp Sci, Via P Bucci Cubo 30 A, I-87036 Arcavacata Di Rende, CS, Italy

关键词: Scattered data interpolation;    Triangular Shepard method;    Fast computation;    Approximation algorithms;   

DOI  :  10.1016/j.cam.2018.03.012

来源: Elsevier

【 摘 要 】

In this paper, we present an efficient algorithm for the computation of triangular Shepard interpolation method. More precisely, it is well known that the triangular Shepard method reaches an approximation order better than the Shepard one (DellAccio et al., 2016), but it needs to identify useful general triangulation of the node set. Here we propose a searching technique used to detect and select the nearest neighbor points in the interpolation scheme (Cavoretto et al., 2016, 2017). It consists in determining the closest points belonging to the different neighborhoods and subsequently applies to the triangulation -based approach. Numerical experiments and some geological applications show efficiency and accuracy of the interpolation procedure. (C) 2018 Elsevier B.V. All rights reserved.

【 授权许可】

Free