Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets

Authors:
Nargess Memarsadeghi;David M. Mount
Affiliations:
NASA/GSFC, Code 588, Greenbelt, MD, 20771, and University of Maryland, College Park, MD, 20742,;University of Maryland, College Park, MD, 20742,
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
Year:
2007

Citing 4
Cited 0

Scattered data interpolation in three or more variables

Mathematical methods in computer aided geometric design
Numerical Recipes in C++: the art of scientific computing

Numerical Recipes in C++: the art of scientific computing
An Introduction to the Conjugate Gradient Method Without the Agonizing Pain

An Introduction to the Conjugate Gradient Method Without the Agonizing Pain
Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning)

Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Interpolating scattered data points is a problem of wide ranging interest. One of the most popular interpolation methods in geostatistics is ordinary kriging. The price for its statistical optimality is that the estimator is computationally very expensive. We demonstrate the space and time efficiency and accuracy of approximating ordinary kriging through the use of covariance tapering combined with iterative methods.