You are on page 1of 10

conventional

Estimation Techniques
( ) ( )
( )
( )
0
1
0
*
*
n
i i
i
i
i
X u X u
X u thevalueat theunsampled location
X u thevalueat theneighboring location
the weight assigned totheneighboring value
ì
ì
=
=
=
=
=
¿
The value at the unsampled location is estimated by
Preliminary Considerations
a. Defining a search neighborhood
b. Conducting a cross-validation exercise
Search Neighborhood
1. Defines the neighboring sample points used in estimating
value at the unsample location.
2. All Kriging procedures use a linear estimation to the
neighboring values.
3. To obtain the weight λi, Kriging algorithms involve
inverting matrix.
a. Number of samples
b. Size of search neigborhood
c. Shape of neighborhood
The following factors must be considered
Cross Validation
( ) ( ) ( )
i i i
u x u x u e
  
*
÷ =
Too large of search
neighborhood
Mixing of two regions of
stationary
Spread of errors is uniform
Linear kriging procedures
1. Simple Kriging
( ) ( )
¿
=
+ =
n
i
i i o o
u X u X
1
*
 
ì ì
( ) ( ) | | 0
*
= ÷
o o
u X u X E
 
We use the MVUE (Minimum Variance Unbiased estimation) to calculate λ
i
( ) | | ( ) | |
o
n
i
i i o
u X E u X E
 
= +
¿
=1
ì ì
|
.
|

\
|
÷ =
¿
=
n
i
i o
m
1
1 ì ì
This is unbiased condition
( ) ( ) | |
o o
u X u X
 
* 2
÷ o
Minimum variance
( ) ( ) , ,..., 1 , ,
1
n i for u u C u u C
o i
n
j
j i j
= =
¿
=
   
ì
Is minimized
( ) ( )
( ) ( )
( )
( )(
(
(
¸
(

¸

=
|
|
|
.
|

\
|
(
(
(
¸
(

¸

o n
o
n n n n
n
u u C
u u C
u u C u u C
u u C u u C
 

 

 

 
 
 

 
,
,
, ,
, ,
1 1
1
1 1 1
ì
ì
c C
1 ÷
= A
or
So that
( ) ( )
¿
=
÷ =
n
i
o i i o o E
u u C u u C
1
2
, , ˆ
   
ì o With the variance
1. Numerical Example 4.1
2. Field Example 4.1. Simple Kriging Cross Validation
3. Field Example 4.2 – Simple Kriging To Generate Gross Thickness
Maps
Kuliah 29 Okt 2012
 Mahasiswa diharapkan memahami:
1. Konsep MVUE (Minimum Variance Unbiased Estimation)
2. Cara menghitung estimasi harga pada titik tertentu dengan
metoda Simple Kriging