Back to Search
Start Over
Fast computation of triangular Shepard interpolants.
- Source :
-
Journal of Computational & Applied Mathematics . Jul2019, Vol. 354, p457-470. 14p. - Publication Year :
- 2019
-
Abstract
- Abstract 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *INTERPOLATION algorithms
*INTERPOLATION
Subjects
Details
- Language :
- English
- ISSN :
- 03770427
- Volume :
- 354
- Database :
- Academic Search Index
- Journal :
- Journal of Computational & Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 135350855
- Full Text :
- https://doi.org/10.1016/j.cam.2018.03.012