Kriging in a global neighborhood

The kriging estimator is usually computed in a moving neighborhood; only the data near the point to be estimated are used. This moving neighborhood approach creates discontinuities in mapping applications. An alternative approach is presented here, whereby all points are estimated using all the available data. To solve the resulting large linear system the kriging estimator is expressed in terms of the inverse of the covariance matrix. The covariance matrix has the advantage of being positive definite and the size of system which can be solved without encountering numerical instability is substantially increased. Because the kriging matrix does not change, the estimator can be written in terms of scalar products, thus avoiding the more time-consuming matrix multiplications of the standard approach. In the particular case of a covariance which is zero for distances greater than a fixed value (the range), the resulting banded structure of the covariance matrix is shown to lead to substantial computational savings in both run time and storage space. In this case the calculation time for the kriging variance is also substantially reduced. The present method is extended to the nonstationary case.