HOME JOURNALS CONTACT

Journal of Applied Sciences

Year: 2005 | Volume: 5 | Issue: 8 | Page No.: 1405-1407
DOI: 10.3923/jas.2005.1405.1407
Semivariogram Fitting with a Simple Optimizing Algorithm
B. Kushavand, H. Aghababaee, M.J. Mohammadzadeh and B. Alizadeh

Abstract: One of the most essential and important stages in a geostatistical study is variogram modeling from the experimental semivariogram values. In order to achieve accurate results, it is suggested to find the variogram parameter value by auto fitting technique. In this study a simple and fast algorithm based on least square and weight least square has been presented. In first step, the objective function defined, then the parameters have been limited at an acceptable range and finally a stochastic algorithm has minimized the objected function.

Fulltext PDF Fulltext HTML

How to cite this article
B. Kushavand, H. Aghababaee, M.J. Mohammadzadeh and B. Alizadeh, 2005. Semivariogram Fitting with a Simple Optimizing Algorithm. Journal of Applied Sciences, 5: 1405-1407.

Keywords: stochastic algorithm, Semivariogram and weighted least square

INTRODUCTION

Semivariogram or covariance inference provides a set of experimental values for a finite number of lags, hk, k=1,...,K and directions. Continues functions must be fitted to these experimental values, so as to deduce semivariogram or covariance values for any possible lag h required by interpolation algorithms and also to smooth out sample fluctuations[1].

The first stage is determining the type of semivariogram model by comparing the experimental semivariogram diagram with basic semivariogram models diagrams[1,2].

There after, its parameter should be estimated. Here is a sample semivariogram model that is a linear combination of Spherical model and Nugget effect:

(1)

If the experimental semivariogram were according to sample semivariogram model (1), the aim is estimate of the best a,c,c0 values. However, some of these parameters must be at acceptable limits, for example nugget effect (c0) must be positive, to reach these conditions some variable conventions needed. If there is no limitations to parameters, for some experimental semivariograms, the algorithm will estimate unacceptable values to parameters, like negative nugget effect.

Two common criteria that used in automatic fitting are the least square and weight least square that are sum of squares of differences between experimental and model γ(a, c, c0, hk) semivariogram value.

Objective function: At least square method the purpose is to estimate a, c, c0 values to minimize the below function:

(2)

hk: The lag distances

: Experimental semivariogram

γ(a, c, c0 hk): semivariogram model.

In addition, at Weight Least Square there is a weight coefficient, w(hk) at relation (2) as below:

(3)

Such as:

(4)

N(hk): The number of pair samples which have hk distance from each other.

Variable conventions: There are so many different ways to limit a variable to an acceptable range but to reach the maximum speed, the simple conventions will be better. Table 1 shows some of these easiest conventions to use.

Algorithm: There are many ways for solving the constrained nonlinear model[3-5].

But between all these ways, the chosen way should have the following specification:

Since the functions are so complicate, the method should not need differentiation.

Table 1: Constrains and useful conventions

Algorithm should contain high convergence speed.
Designing of the computer program should be easy.
Algorithm is always converging to global minimization.

From the Most optimization methods, it seems that the Stochastic Algorithms are more suitable for achieving above points. Figure 1 shows the general flowchart of this kind of algorithms[3-5].

One of the useful methods of this kind of algorithms is Random walk method with direction exploitation[5].

In this algorithm, at first the constrained nonlinear programming model has been converted to an abstract non-liner programming model. The convention that has been used at this algorithm is abs(X).

Now, different steps of this algorithm for Weighted Least Square are shown as follow:

Choose the repetition number of algorithm m and Length Step e.
Suggest first values to a, c, c0.
i =1
Define new variables:
f = fWLS (a′, c′, c′0)
Produce the monotonic stochastic digits:
-1<r1, r2, r3<1
If , go to step 14
Go to 8

Fig. 1: Flowchart of general stochastic algorithm

If i<m, go to step 6
Stop, The answers are:

Example: The data used at this study were collected by the Swiss Federal Institute of Technology at Lausanne[1]. Table 2 and Fig. 2 show the experimental semivariogram that has been calculated from Zn grades. Figure 2 indicate that the spherical model with nugget effect is more appropriate for Zn semivariogram at this region. Therefore, the objective function is:

Min

and

Table 2 contains the values of . By applying the given stochastic algorithm which is presented here and starting by initial answer:

a = 1.4, c = 70, c0 = 10

Table 2: Experimental semivariogram values for Zn

Fig. 2: Diagram of experimental and fitted theoretical semivariogram: Model=Spherical + Nugget Effect: a = 1.362, c = 74.802, c0 = 10.572

With initial parameters:

The results of the algorithm will be as:

The theoretical and experimental semivariogram diagram of the Zn data is plotted in Fig. 2.

CONCLUSIONS

In this study, an appropriate method has been represented for finding the theoretical semivariogram parameters.

The algorithm will be repeated at least m counts, so in applying this stochastic algorithm, correct choosing of m is so important such that with increasing m, optimized estimation for theoretical semivariogram model parameters can be calculated but the running time of program will be more longer. The second parameter of algorithm denoted by e (the length of step) in which decreasing of this parameter result in increase of accuracy and decrease in the rate of algorithm.

In order to achieve accurate result, it is suggested to repeat the algorithm frequently with different initial values. Nested structures can also be modeled by this algorithm, in which the number of parameters that must be found is increased, leading in decrease of the rate of algorithm.

ACKNOWLEDGMENTS

The authors wish to express their thanks to Dr. Gregoire Dubois, Radioactivity Environmental Monitoring group Emissions and Health Unit of ITALY for his constructive advices during the course of this study.

REFERENCES

  • Goovaerts, P., 1997. Geostatistics for Natural Resources Evaluation. 1st Edn., Oxford University Press, London


  • Journel, A.G. and C.J. Huijbregts, 1978. Mining Geostatistics. 1st Edn., Academic Press, London, ISBN-10: 0123910501, Pages: 600


  • Bazara, M.S. and C.M. Shetty, 1979. Nonlinear Programming: Theory and Algorithms. John Wiley and Sons, New York, pp: 332-434


  • Chong, E.K.P. and S.H. Zak, 2001. An Introduction to Optimization. John Wiley and Sons, New York, pp: 365-433


  • Rao, S.S., 1984. Optimization: Theory and Applications. 2nd Edn., John Wiley, New York

  • © Science Alert. All Rights Reserved