Summary
A crucial concern when implementing computer algorithms for geostatistical analyses on microcomputers is speed of execution. Kriging, in particular, typically relies on a Gauss elimination algorithm to solve for weights. Because such an alogrithm is required for each estimate, the solution for weights can result in very slow program execution speed on a microcomputer. One approach to enhancing the efficiency of Gauss elimination is demonstrated herein. The upper triangle plus diagonal of the intersample covariance matrix is used in a modified banded Gauss elimination algorithm. Results show that such an algorithm yields approximately a two-fold reduction in execution time for kriging when the number of nearest neighbours used for estimation is large.
Similar content being viewed by others
References
Carr, J.R. and Myers, D.E. (1990) Efficiency of different equation solvers in co-kriging,Comp. Geosci.,16 (5), 705–6.
Cook, R.D. (1974)Concepts and Applications of Finite Element Analysis, John Wiley, New York.
Davis, M.W. and Culhane, P.G. (1984) Contouring very large datasets using kriging, inGeostatistics for Natural Resources Characterization, Verly, G.et al. (eds), Part 2. D. Reidel Publishing, Amsterdam, pp. 599–619.
Kreyszig, E. (1988)Advanced Engineering Mathematics (6th edn), John Wiley, New York.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Carr, J.R. Rapid solution of kriging equations, using a banded Gauss elimination algorithm. International Journal of Mining and Geological Engineering 8, 393–399 (1990). https://doi.org/10.1007/BF00920650
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00920650