Search

Computational power poses heavy limitations to the achievable problem size for Kriging. In separate research lines, Kriging algorithms based on FFT, the separability of certain covariance functions, and low-rank representations of covariance functions have been investigated, all three leading to drastic speedup factors. The current study combines these ideas, and so combines the individual speedup factors of all ideas. This way, we reduce the mathematics behind Kriging to a computational complexity of only $\mathcal{O}(dL^{*} \log L^{*})$ , where L ∗ is the number of points along the longest edge of the involved lattice of estimation points, and d is the physical dimensionality of the lattice. For separable (factorized) covariance functions, the results are exact, and nonseparable covariance functions can be approximated well through sums of separable components. Only outputting the final estimate as an explicit map causes computational costs of $\mathcal{O}(n)$ , where n is the number of estimation points. In illustrative numerical test cases, we achieve speedup factors up to 108 (eight orders of magnitude), and we can treat problem sizes of up to 15 trillion and two quadrillion estimation points for Kriging and spatial design, respectively, within seconds on a contemporary desktop computer. The current study assumes second-order stationarity and simple Kriging on a regular, equispaced lattice, without working with restricted neighborhoods. Extensions to many other cases are straightforward.

Studies of site exploration, data assimilation, or geostatistical inversion measure parameter uncertainty in order to assess the optimality of a suggested scheme. This study reviews and discusses measures for parameter uncertainty in spatial estimation. Most measures originate from alphabetic criteria in optimal design and were transferred to geostatistical estimation. Further rather intuitive measures can be found in the geostatistical literature, and some new measures will be suggested in this study. It is shown how these measures relate to the optimality alphabet and to relative entropy. Issues of physical and statistical significance are addressed whenever they arise. Computational feasibility and efficient ways to evaluate the above measures are discussed in this paper, and an illustrative synthetic case study is provided. A major conclusion is that the mean estimation variance and the averaged conditional integral scale are a powerful duo for characterizing conditional parameter uncertainty, with direct correspondence to the well-understood optimality alphabet. This study is based on cokriging generalized to uncertain mean and trends because it is the most general representative of linear spatial estimation within the Bayesian framework. Generalization to kriging and quasi-linear schemes is straightforward. Options for application to non-Gaussian and non-linear problems are discussed.

Looking at kriging problems with huge numbers of estimation points and measurements, computational power and storage capacities often pose heavy limitations to the maximum manageable problem size. In the past, a list of FFT-based algorithms for matrix operations have been developed. They allow extremely fast convolution, superposition and inversion of covariance matrices under certain conditions. If adequately used in kriging problems, these algorithms lead to drastic speedup and reductions in storage requirements without changing the kriging estimator. However, they require second-order stationary covariance functions, estimation on regular grids, and the measurements must also form a regular grid. In this study, we show how to alleviate these rather heavy and many times unrealistic restrictions. Stationarity can be generalized to intrinsicity and beyond, if decomposing kriging problems into the sum of a stationary problem and a formally decoupled regression task. We use universal kriging, because it covers arbitrary forms of unknown drift and all cases of generalized covariance functions. Even more general, we use an extension to uncertain rather than unknown drift coefficients. The sampling locations may now be irregular, but must form a subset of the estimation grid. Finally, we present asymptotically exact but fast approximations to the estimation variance and point out application to conditional simulation, cokriging and sequential kriging. The drastic gain in computational and storage efficiency is demonstrated in test cases. Especially high-resolution and data-rich fields such as rainfall interpolation from radar measurements or seismic or other geophysical inversion can benefit from these improvements.