Kriging with strings of data

The concept of a random function and, consequently, the application of kriging cells for the implicit assumption that the data locations are embedded within an infinite domain. An implication of this assumption is that, all else being equal, outlying data locations will receive greater weight because they are seen as less redundant, hence, more informative of the infinite domain. A two- step kriging procedure is proposed for correcting this siring effect. The first step is to establish the total kriging weight attributable to each string. The distribution of that total weight to the samples in the string is accomplished by a second stage of kriging. In the second stage, a spatial redundancy measure r_(n) is used in place of the covariance measure in the data-data kriging matrix. This measure is constructed such that each datum has the same redundancy with the (n)data of the string to which it belongs. This paper documents the problem of kriging with strings of data, develops the redundancy measure r_(n),and presents a number of examples.