Professional Documents
Culture Documents
ISATIS 2013
Technical References
Published, sold and distributed by GEOVARIANCES 49 bis Av. Franklin Roosevelt, BP 91, 77212 Avon Cedex, France http://www.geovariances.com
Contributing authors: Catherine Bleins Matthieu Bourges Jacques Deraisme Franois Geffroy Nicolas Jeanne Ophlie Lemarchand Sbastien Perseval Frdric Rambert Didier Renard Yves Touffait Laurent Wagner
All Rights Reserved 1993-2013 GEOVARIANCES No part of the material protected by this copyright notice may be reproduced or utilized in any form or by any means including photocopying, recording or by any information storage and retrieval system, without written permission from the copyright owner.
Table of Contents
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .1 1 1 Hints on Learning Isatis. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .3 2 2 Getting Help . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .5 Generalities. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .7 3 3 Structure Identification in the Intrinsic Case . . . . . . . . . . . . . . . . . .9 3.1 3.1 The Experimental Variability Functions. . . . . . . . . . . . . . . . . . . . . .10 3.2 3.2 Variogram Model. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .27 3.3 3.3 The Automatic Sill Fitting Procedure. . . . . . . . . . . . . . . . . . . . . . . .42 4 4 Non-stationary Modeling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .51 4.1 4.1 Unique Neighborhood . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .52 4.2 4.2 Moving Neighborhood . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .57 4.3 4.3 Case of External Drift(s) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .62 5 5 Quick Interpolations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .63 5.1 5.1 Inverse Distances. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .64 5.2 5.2 Least Square Polynomial Fit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .65 5.3 5.3 Moving Projected Slope . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .66 5.4 5.4 Discrete Splines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .67 5.5 5.5 Bilinear Grid Interpolation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .69 6 6 Grid Transformations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .71 6.1 6.1 List of the Grid Transformations . . . . . . . . . . . . . . . . . . . . . . . . . . .73 6.2 6.2 Filters. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .91 7 7 Linear Estimation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .97
7.1 7.1 Ordinary Kriging (Intrinsic Case). . . . . . . . . . . . . . . . . . . . . . . . . . 7.2 7.2 Simple Kriging (Stationary Case with Known Mean) . . . . . . . . . . 7.3 7.3 Kriging of One Variable in the IRF-k Case . . . . . . . . . . . . . . . . . . 7.4 7.4 Drift Estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.5 7.5 Estimation of a Drift Coefficient . . . . . . . . . . . . . . . . . . . . . . . . . . 7.6 7.6 Kriging with External Drift . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.7 7.7 Unique Neighborhood Case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.8 7.8 Filtering Model Components . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.9 7.9 Factorial Kriging. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.10 7.10 Block Kriging . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.11 7.11 Polygon Kriging . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.12 7.12 Gradient Estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.13 7.13 Kriging Several Variables Linked through Partial Derivatives . 7.14 7.14 Kriging with Inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.15 7.15 Kriging with Measurement Error . . . . . . . . . . . . . . . . . . . . . . . . 7.16 7.16 Lognormal Kriging . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.17 7.17 Cokriging . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.18 7.18 Extended Collocated Cokriging . . . . . . . . . . . . . . . . . . . . . . . . . 8 8 Gaussian Transformation: the Anamorphosis . . . . . . . . . . . . . . . . 8.1 8.1 Modeling and Variable Transformation . . . . . . . . . . . . . . . . . . . . . 8.2 8.2 Histogram Modeling and Block Support Correction . . . . . . . . . . . 8.3 8.3 Variogram on Raw and Gaussian Variables . . . . . . . . . . . . . . . . . . 9 9 Non Linear Estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9.1 9.1 Indicator Kriging . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9.2 9.2 Probability from Conditional Expectation . . . . . . . . . . . . . . . . . . . 9.3 9.3 Disjunctive Kriging . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9.4 9.4 Uniform Conditioning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9.5 9.5 Service Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9.6 9.6 Confidence Intervals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Simulations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 10 Turning Bands Simulations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10.1 10.1 Principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10.2 10.2 Non Conditional Simulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10.3 10.3 Conditioning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 11 Truncated Gaussian Simulations . . . . . . . . . . . . . . . . . . . . . . . . . . 12 12 Plurigaussian Simulations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12.1 12.1 Principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12.2 12.2 Variography. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12.3 12.3 Simulation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12.4 12.4 Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 13 Impalas Multiple-Point Statistics . . . . . . . . . . . . . . . . . . . . . . . . . 14 14 Fractal Simulations. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
98 101 102 104 106 107 109 112 114 116 118 119 121 124 125 127 130 133 135 136 143 147 149 150 152 153 155 158 160 161 163 164 165 168 169 173 174 177 181 183 185 193
14.1 14.1 Principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .194 14.2 14.2 Midpoint Displacement Method. . . . . . . . . . . . . . . . . . . . . . . . . .195 14.3 14.3 Interpolation Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .196 14.4 14.4 Spectral Synthesis. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .197 15 15 Annealing Simulations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .199 16 16 Spill Point Calculation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .203 16.1 16.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .204 16.2 16.2 Basic Principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .205 16.3 16.3 Maximum Reservoir Thickness Constraint . . . . . . . . . . . . . . . . .206 16.4 16.4 The "Forbidden types" of control points . . . . . . . . . . . . . . . . . . .207 16.5 16.5 Limits of the algorithm. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .208 16.6 16.6 Converting Unknown volumes into Inside ones . . . . . . . . . . . . .209 17 17 Multivariate Recoverable Resources Models. . . . . . . . . . . . . . . . .211 17.1 17.7 Theoretical reminders on Discrete Gaussian model applied to Uniform Conditioning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .212 17.2 17.8 Theoretical reminders on Discrete Gaussian model applied to block simulations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .218 18 18 Localized Uniform Conditionning . . . . . . . . . . . . . . . . . . . . . . . . .225 18.1 18.1 Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .226 19 19 Skin algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .229 Isatoil. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .233 20 19 Isatoil . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .235 20.1 19.1 Data description . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .236 20.2 19.2 Workflow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .238 20.3 19.3 Modelling the geological structure. . . . . . . . . . . . . . . . . . . . . . . .239 20.4 19.4 Modelling the petrophysical parameters . . . . . . . . . . . . . . . . . . .251
Introduction
Technical References
The Beginner's Guide, the On-Line documentation tools and the Case Studies Manual are the main ways to get started with Isatis.
l l
for new users to get familiar with Isatis and give some leading lines to carry a study through, for all users to improve their geostatistical knowledge by presenting detailed geostatistical workflows.
Basically, each case study describes how to carry out some specific calculations in Isatis as precisely as possible. You may either:
l
replay by yourself the case study proposed in the manual, as all the data sets are installed on your disk together with the software, or just be guided by the descriptions and apply the workflow on your own datasets.
Technical References
2 Getting Help
You have 3 options for getting help while using Isatis: the On-Line Help system, the Frequently Asked Questions and the Technical Support team (support@geovariances.com).
Getting Help
Generalities
Technical References
This technical reference reviews the main tools available in Isatis to describe the spatial variability (regularity, continuity, ...) of the variable(s) of interest, commonly referred to as the "Structure", in the Intrinsic Case.
10
m m
Z is the standard deviation calculated over the tail points and is considered to be at a distance of +h from .
Z Z n
(fig. 3.1-1)
Technical References
11
The Variogram
12 ----2 n ( Z Z )
n
(fig. 3.1-2)
1 -- ( Z mZ ) ( Z mZ ) n
n
(fig. 3.1-3)
12
1 -- Z Z n
n
(fig. 3.1-4)
(fig. 3.1-5)
Technical References
13
The Correlogram
( Z mZ ) ( Z mZ ) 1 -n ----------------------------------------------2
n Z
(fig. 3.1-6)
(fig. 3.1-7)
14
1- Z Z ---- 2n n
(fig. 3.1-8)
1----2n
n
Z Z
(fig. 3.1-9)
Technical References
15
( Z Z ) 2 1 ----- ------------------------2n m2
n Z
(fig. 3.1-10)
( Z Z ) 2 1-----------------------------------2n m+ + m - 2 Z Z n ------------------------ 2
(fig. 3.1-11)
16
(fig. 3.1-12)
Although the interest of the madogram and rodogram, as compared to the variogram, is quite obvious (at least graphically), as it tends to smooth out the function, the user must always keep in mind that the only tool that corresponds to the statement of kriging (namely minimizing a variance) is the variogram. This is particularly obvious when looking at the variability values (measured along the vertical axis) on the different figures, remembering that the experimental variance of the data is represented as a dashed line on the variogram picture.
Technical References
17
( Z Z ) 2 1 n
-- ---------------------------------------------2
(eq. 3.1-1)
Z Y n
(fig. 3.1-1)
The Cross-Variogram
1- ( Z Z ) ( Y Y ) ---- 2n n
18
(fig. 3.1-2)
1 -- ( Z mZ ) ( Y mY ) n
n
(fig. 3.1-3)
1 -- Z Y n n
Technical References
19
(fig. 3.1-4)
1 + )(Y m - ) -- ( Z mZ Y n
n
(fig. 3.1-5)
The Cross-Correlogram
( Z mZ ) ( Y mY ) 1 -- ----------------------------------------------n
n Z Y
20
(fig. 3.1-6)
(fig. 3.1-7)
The Cross-Madogram
1----2n
n
( Z Z ) ( Y Y )
Technical References
21
(fig. 3.1-8)
The Cross-Rodogram
1- 4 ( Z Z ) ( Y Y ) ---- 2n n
(fig. 3.1-9)
1- ( Z Z ) ( Y Y ) -------------------------------------------------2n mZ mY n
22
(fig. 3.1-10)
(fig. 3.1-11)
Technical References
23
(fig. 3.1-12)
This time most of the curves are no longer symmetrical. In the case of the covariance, it is even convenient to split it into its odd and even parts as represented below. If h designates the distance (vector) between the two data points constituting a pair, we then consider: The Even Part of the Covariance
1 -- [ C ( h ) + C ZY ( h ) ] 2 ZY
(fig. 3.1-13)
1 -- [ C ( h ) C ZY ( h ) ] 2 ZY
24
(fig. 3.1-14)
Note - The cross-covariance function is a more powerful tool than the cross-variogram in term of
structural analysis as it allows the identification of delay effects. However, it necessitates stronger hypotheses (stationarity, estimation of means), it is not really used in the estimation steps. In fact, the cross-variogram can be derived from the covariance as follows:
1 - [ C ( h ) + C ZY ( h ) ] ( h ) = C ZY ( 0 ) -2 ZY
and is therefore similar to the even part of the covariance. All the information carried by the odd part of the covariance is simply ignored. A last remark concerns the presence of information on all variables at the same data points: this property is known as isotopy. The opposite case is heterotopy: one variable (at least) is not defined at all the data points. The kriging procedure in the multivariate case can cope nicely with the heterotopic case. Nevertheless, in the meantime one has to calculate cross-variograms which can obviously be established from the common information only. This consideration is damaging in a strong heterotopic case where the structure, only inferred on a small part of the information, is used for a procedure which possibly operates on the whole data set.
Technical References
25
(fig. 3.1-1)
When this ratio is constant, the variable corresponding to the simple variogram is "self-krigeable". This means that in the isotopic case (both variables measured at the same locations) the kriging of this variable is equal to its cokriging. This property can be extended to more than 2 variables: the ratio should be considered for any pair of variables which includes the self-krigeable variable. The ratio between the square root of the variogram and the madogram:
(fig. 3.1-2)
This ratio is constant and equal to for a standard normal variable, when its pairs satisfy the hypothesis of binormality. A similar result is obtained in the case of a bigamma hypothesis. The ratio between the variogram and the madogram:
26
(fig. 3.1-3)
If the data obeys a mosaic model with tiles identically and independently valuated, this ratio is constant. The ratio between the cross-variogram and the square root of the product of the two simple variograms:
(fig. 3.1-4)
When two variables are in intrinsic correlation, the two simple variograms and the cross variogram are proportional to the same basic variogram. This means that this ratio, in the case of intrinsic correlation must be constant. When two variables are in intrinsic correlation cokriging and kriging are equivalent in the isotopic case.
Technical References
27
A coefficient which gives the order of magnitude of the variability along the vertical axis (homogenous to the variance). In the case of bounded functions (covariances), this value is simply the level of the plateau reached and is called the sill. The same concept has been kept even for the non-bounded functions and we continue to call it sill for convenience. The interest of this value is that it always comes as a multiplicative coefficient and therefore can be calculated using automatic procedures, as explained further. The sill is equal to "C" in the following models. A parameter which affects the horizontal axis by normalizing the distances: hence the name of scale factor. This term avoids having to normalize the space where the variable is defined beforehand (for example when data are given in microns whereas the field extends on several kilometers). This scale factor is also linked to the physical parameter of the selected basic function. When the function is bounded, it reaches a constant level (sill) or even changes its expression after a given distance: this distance value is the range (or correlation distance in statistical language) and is equal to the scale factor. For the bounded functions where the sill is reached asymptotically, the scale factor corresponds to the distance where the function reaches 95% of the sill (also called practical range). For functions where the sill is reached asymptotically in a sinusoidal way (hole-effect variogram), the scale factor is the distance from which the variation of the function does not exceed 5% around the sill value. This is why, in the variogram formulae, we systematically introduce the coefficient (norm) which gives the relationship between the Scale Factor (SF) and the parameter a:
SF = a .
For homogeneity of the notations, the norm and a are kept even for the functions which depend on a single parameter (linear variogram for example): the only interest is to manipulate distances "standardized" by the scaling factor and therefore to reduce the risk of numerical instabilities. Finally, the scale factor is used in case of anisotropy. For bounded functions, it is easy to say that the variable is anisotropic if the range varies with the direction. This concept is generalized to any basic function using the scale factor which depends on the direction, in the calculation of the distance.
m
28
l l
a chart representing the shape of the function for various values of the parameters. a non-conditional simulation performed on a 100 X 100 grid. As this technique systematically leads to a normal outcome (hence symmetrical), we have painted positive values in black and negative ones in white. Except for the linear model where the median is used as a threshold.
Spherical Variogram
3 h 1 h 3 - ----- ---- ( h ) = C - -2 a 2 a ( h) = C = 1 (h a)
(h < a)
(eq. 3.2-1)
(fig. 3.2-1)
(eq. 3.2-2)
Technical References
29
(fig. 3.2-2)
(eq. 3.2-3)
(fig. 3.2-3)
30
(eq. 3.2-4)
(fig. 3.2-4)
(eq. 3.2-5)
Technical References
31
(fig. 3.2-5)
Stable Variogram
h ---- ( h ) = C 1 exp a =
(eq. 3.2-6)
(fig. 3.2-6)
Variograms (SF= 8. & = .25, .50, .75, 1., 1.25, 1.5, 1.75, 2.)
32
Note - The technique for simulating stable variograms is not implemented in the Turning Bands method.
Gamma Variogram
1 ( h ) = C 1 ----------------------h 1 + ---- a =
(a > 0)
(eq. 3.2-7)
20 1
(fig. 3.2-7)
Variograms (SF= 8. & = .5,1.,2.,5.,10.,20.) & Simulation (SF= 10. & = 2.)
> d -- 1 2
(eq. 3.2-8)
where (from Chils J.P. & Delfiner P., 1999, Geostatistics: Modeling Spatial Uncertainty, Wiley series in Probability and Statistics, New-York):
Technical References
33
>0
by (Euler's integral)
( ) =
0 eu u 1 du
(eq. 3.2-9)
k =0
2k ( 1 ) k x ----------------------------------- -- k! ( + k + 1 ) 2
(eq. 3.2-10)
- the modified Bessel function of the first kind, used below, is defined by
x -- I ( x ) = 2
k =0
2k 1 x ----------------------------------- -- k! ( + k + 1 ) 2
(eq. 3.2-11)
- the modified Bessel function of the second kind, used in K-Bessel variogram hereafter, is defined by
I ( x ) I ( x ) - --------------------------------K ( x ) = -2 sin
(eq. 3.2-12)
(fig. 3.2-8)
Variograms (SF=1. & = .5,1.,2.,3.,4.,5.) & Simulation (SF=1. & = 1) K-Bessel Variogram
34
( > 0)
(eq. 3.2-13)
(fig. 3.2-9)
Variograms (SF=1. & = .1,.5,1.,2.,5.,10.) & Simulation (SF=1. & = 1.) Exponential Cosine (Hole Effect Model)
( h R , a 1 > 0, a 2 > 0 )
h 2 ( h ) = C 1 1 + ----- a =
( > 0)
(eq. 3.2-14)
20 1
Technical References
35
(fig. 3.2-10)
Variograms (SF=10. & = .1,.5,1.,2.,5.,10.) & Simulation (SF=10. & = 1.) Linear Variogram
h ----( h) = C a = 1
(eq. 3.2-15)
(fig. 3.2-11)
36
h (h ) = C ---- a = 1
(0 < < 2)
(eq. 3.2-16)
(fig. 3.2-12)
Variograms (SF= 5. & = 0.25, 0.5, 0.75, 1., 1.25, 1.5, 1.75)
Note - The technique for simulating Power variograms is not implemented in the Turning Bands
method.
same sill, different ranges: geometric anisotropy. Its name comes from the fact that by stretching the space in one direction by a convenient factor we also stretch the corresponding directional range until it reaches the range on the orthogonal direction. In this new space, the phenomenon is then isotropic: the correction is of a geometric nature.
Technical References
37
(fig. 3.2-1)
same range, different sills: zonal anisotropy This describes a phenomenon where its variability is larger in one direction than in the orthogonal one. This is typically the case for vertical orientation through a "layer cake" deposit by opposition to any horizontal orientation. No geometric correction will reduce this dissimilarity .
38
(fig. 3.2-2)
Practical calculations
The anisotropy consists of a rotation and the ranges along the different axes of the rotated system. The rotation can be defined either globally or for each basic structure. In the 2D case, for one basic structure, and if "u" and "v" designate the two components of the distance vector in the rotated system, we first calculate the equivalent distance:
u- 2 ---v 2 d 2 = ---+ a - a u v
where au and av are the ranges of the model along the two rotated axes.
(eq. 3.2-1)
Then this distance is used directly in the isotropic variogram expression where the range is normalized to 1. In the case of geometric anisotropy, the value au/av corresponds to the ratio between the two main axes of the anisotropy ellipse. For zonal anisotropy, we can consider that the contribution of the distance component along one of the rotated axes is discarded: this is obtained by setting the corresponding range to "infinity". Obviously, in nature, both anisotropies can be present, and, moreover, simultaneously. Finally the setup of any anisotropy requires the definition of a system: this is the system carrying the anisotropy ellipsoid in case of geometric (or elliptic) anisotropy, or the system carrying the direction or plane of zonal anisotropy.
Technical References
39
This new system is defined by one rotation angle in 2D, or by 3 angles (dip, azimuth and plunge) in 3D. It is possible to attach the anisotropy rotation system globally or individually to each one of the nested basic structures. This possibility leads to an enormous variety of different textures.
A =
C( h ) dh
x
(eq. 3.2-1)
A is a function of the dimension of the space. The following table gives the integral ranges of the main basic structures when the sill C is set to 1. with b
0 2b 3b/4
0 2 b2
0 8b3 -- b3 6
Spherical
-5
b2
Gaussian
b b + 1 ------------2b
2b -----------1 +
b2
+
b3
+ 4 + 3 -- b 3 ------------ 3
+ 2 ------------b2
Gamma
>1
else
40
J-Bessel
3 > -2 else
K-Bessel
1 2 2 b --------------------- ( )
-- +
4b2
3 2 8 b 3--------------------- ( )
- + -
Gen. Cauchy
b -----------1 +
>1 else
3.2.4 Convolution
If we know that the measured variable Z is the result of a convolution p applied on the underlying variable
Z = Y*p
(eq. 3.2-1)
We can demonstrate that the variogram of Z can be deduced from the variogram of Y as follows:
Y = Z * P with P = p * p
(eq. 3.2-2)
Therefore, if the convolution function is fully determined (its type and the corresponding parameters), specifying a model for Y will lead to the corresponding model for Z.
3.2.5 Incrementation
In order to introduce the concept of incrementation, we must recall the link between the variogram and the covariance:
(h ) = C( 0) C(h )
where
(eq. 3.2-1)
Technical References
41
(h)
1 ( h ) = -----Var Mk
q Z[ x + ( k + 1 q ) h ] ( 1 ) q Ck =1 q=0
k+1
(eq. 3.2-3)
where
k+1 Mk = C2 k+2
which requires data to be located along a regular. The scaling factor Mk is there to ensure that in the case of a pure nugget effect:
0 (h ) = C0
h = 0 h0
(eq. 3.2-4)
The benefit of the incrementation is that the generalized variogram can be derived using the generalized covariance:
(h ) =
(eq. 3.2-5)
Then, we make explicit the relationships between and for several orders : k 0 1 2
( h)
(h ) = K(0) K(h) 4 -K(h) + 1 -- K( 2h ) K ( 0 ) -3 3 3 1-K(h) + 3 -- K ( 2 h ) ----K ( 0 ) -K(3h ) 2 5 10
( h)
42
if K(h) is a standard covariance (range a and sill C), range: its shape is slightly different.
(h)
if K(h) is a generalized covariance of the h type, then ( h ) is of the same type: the only difference comes from its coefficient which is multiplied by:
1- k + 1 k + 1 + p p 1 -----( 1 )p C2 k+1 Mk
p = k1
(eq. 3.2-6)
Note - The cross-covariance value at the origin may be badly defined in the heterotopic case, or even undefined in the fully heterotopic case. It is possible to specify the values of the simple and cross-covariances at the origin, using for instance the knowledge about the variance-covariance coming from another dataset.
Technical References
43
l l
the number and types of basic structures, for each one of them, the range or third coefficient (if any),
finally for the anisotropy. This is why the term automatic fitting is somehow abusive. Considering a set of N second order stationary regionalized random functions Zi(x) we wish to establish the multivariate model taking into account all the simple and cross covariances Cij(h). If the variables Zi(x) are intrinsic, the covariances no longer exist and the model must then be derived from simple and cross variograms ij ( h ) . Nevertheless, this chapter will be developed in the stationary case. A well known result is that the matrix
ij for each basic structure p must be (semi-) definite posibp
tive in order to ensure the positiveness of the variance of any linear combination of the random variables Zi(x). In order to build this linear model of coregionalization, we assume that the variables Zi are decomposed on a basis of random variables generically denoted Y, stationary and orthogonal. These variables are regrouped in P groups of Yp random functions characterized by the same covariance Cp(h) called the basic structure. The count of variables within each group is equal to the number of variables N. We will then write:
P N
Zi ( x ) =
ik Y p ap k p=1 k =1
(eq. 3.3-1)
ik are the coefficients of the linear model. The covariance between two variables The coefficients a p Zi and Zj and can be written: P N
C ij ( h ) =
which can also be considered as:
ik a jk C p ( h ) p ap p=1 k =1
(eq. 3.3-2)
C ij ( h ) =
ij C p ( h ) bp p =1
(eq. 3.3-3)
44
ij = bp
ik a jk , homogeneous to sills, are symmetric and the matrices p ap k =1 ij are symmetric, semi-definite positive: they correspond to the varibp
3.3.1 Procedure
Assuming that the number of basic structures P, as well as all the characteristics of each basic model Cp(h), are defined, the procedure determines all the coefficients ance-covariance matrices. Starting from the experimental simple and cross-covariances procedure tries to minimize the quantity:
U ik and derives the variap
=
where
* ( h ) C ( h ) ]2 ( h ) u ij u u [ Cij i, j u=1
(eq. 3.3-1)
( hu ) is a weighting function chosen in order to reduce the importance of the lags with few
pairs, and to increase the size of the first lags corresponding to short distances. For more information on the choice of these weights, the user should refer to the next paragraph. Each matrix Bp is decomposed as:
T Bp = Xp p Xp
(eq. 3.3-2)
the eigen values. Instead of minimizing (eq. 3.3-1) under the constraints that Bp is definite positive, we prefer writing that:
N
ij = bp
ik a jk p ap k =1
(eq. 3.3-3)
Technical References
45
where
k p
ik p and x p
hypothesis will ensure the matrix Bp to be definite positive. Equation (eq. 3.3-1) can now be reformulated:
2 U P N
* (h ) C ij u
i, j u=1
ik a jk C p ( h ) p u ap p=1 k =1
( hu )
(eq. 3.3-5)
= 0
( i j )
(eq. 3.3-6)
K ij =
pq
C p ( hu ) C q ( h u ) ( h u )
u =1 * (h )(h ) u u C p ( hu ) Cij u=1 U
(eq. 3.3-7)
p A ij =
Kij +
i, j
i, j, p, q, k, l
ik a jk a il a jl T pq 2 ap p q q
i, j, p, k
ik a jk A p ap p ij
(eq. 3.3-8)
(eq. 3.3-9)
We shall describe the case of a single structure first before reviewing the more general case of several nested basic structures.
46
a jk a il a jl T
j l
a jk Aij
j
i, k
(eq. 3.3-1)
Using the orthogonality constraints, the only non-zero term in the left-hand side of the equality is obtained when j=i:
a ik ( a il ) 2 T =
l
a jk Ajk
j
i, k
(eq. 3.3-2)
If we introduce:
Pi =
then:
( a il ) 2
l
(eq. 3.3-3)
a ik ( P i ) 2 T =
a jk Ajk
j
i, k
(eq. 3.3-4)
This leads to an eigen vector problem. If we denote respectively by the corresponding normalized eigen vectors, then:
a ik = a ik = 0
The minimum of
k ---- x ik
k > 0 k 0
(eq. 3.3-5)
Kij
i, j
kK
( k )2 -----------T
(eq. 3.3-6)
where K designates the set of indices corresponding to positive eigen values. This result will now be generalized to the case of several nested basic structures.
Technical References
47
i, j, u
p (h ) ik a jk C p ( h ) ( h ) K ik u p u u ap p, k
(eq. 3.3-2)
i, j, u
* (h ) C ij u
2 ij C p ( h ) m p bp u
( hu )
(eq. 3.3-4)
ik m p a ik ap p
Return to step (1) Step (2) is used to equalize the weight of each basic structure as the first structure processed in step (1) has more influence than the next ones. The coefficient mq is the solution of the linear system:
48
ij b ij T pq q m q bp q i, j
ij A p ij bp i, j
(eq. 3.3-6)
Note - This procedure ensures that converges but does not induce that the bp converge.
Each lag of each direction has the same weights. The weight for each lag of each direction is proportional to the total number of pairs for all the lags of this direction. The weight for each lag of each direction is proportional to the number of pairs and inversely proportional to the average distance of the lag. The weight for each lag of each direction is inversely proportional to the number of lags in this direction.
an exponential variogram with a scale factor of 2.5km (practical range) a linear variogram (Order-1 G.C.) with a scale factor of 1km.
Number of basic structures = 2 S1 : Exponential - Scale = 2.50km Variance-Covariance matrix : Variable 1 Variable 2 Variable 1 1.1347 0.5334 Variable 2 0.5334 1.8167 Decomposition into factors (normalized eigen vectors) : Variable 1 Variable 2 Factor 1 0.6975 1.2737 Factor 2 0.8051 -0.4409 Decomposition into eigen vectors (whose variance is eigen values) :
Technical References
49
E.Vect 1 E.Vect 2
S2 : Order-1 G.C. - Scale = 1km Variance-Covariance matrix : Variable 1 Variable 2 Variable 1 0.2562 0.0927 Variable 2 0.0927 0.1224 Decomposition into factors (normalized eigen vectors) : Variable 1 Variable 2 Factor 1 0.4906 0.2508 Factor 2 -0.1246 0.2438 Decomposition into eigen vectors (whose variance is eigen values) : Variable 1 Variable 2 Eigen Val. Var. Perc. E.Vect 1 0.8904 0.4552 0.3036 80.20 E.Vect 2 -0.4552 0.8904 0.0750 19.80
For each basic structure, the printout contains the following information: In the Variance-Covariance matrix, the sill of the simple variogram for the first variable "Pb" and for the exponential basic structure is equal to 1.1347. This sill is equal to 1.8167 for the second variable "Zn" and the same exponential basic structure. The cross-variogram has a sill of 0.5334. These
ij matrix for the first basic structure. values correspond to the b p
This Variance-Covariance matrix is decomposed into the orthogonal normalized vectors Y1 and Y2. In this example and for the first basic structure, we can read that:
check, for example that for the first basic structure (p=1):
11 = ( a 11 ) 2 + ( a 12 ) 2 b1 1 1
50
11 = a1
1 x11 1 1
( 0.6975 ) =
12 = a1
2.1087 ( 0.4803 )
2 x12 1 1
( 0.8051 ) =
21 = a1
0.8426 ( 0.8771 )
(eq. 3.3-3)
1 x21 1 1
( 1.2737 ) =
22 = a1
2.1087 ( 0.8771 )
2 x22 1 1
( -0.4409 ) =
0.8426 ( -0.4803 )
1. and x 2. are orthogonal and normalized. We can easily check that the vectors x 1 1
Each eigen vector corresponds to a line and is attached to an eigen value. They are displayed by decreasing order of the eigen values. As the variance-covariance matrix is definite positive, the eigen values are positive or null. Their sum is equal to the trace of the matrix and it makes sense to express them as a percentage of the total trace. This value is called "Var. Perc.".
Technical References
51
4 Non-stationary Modeling
This page constitutes an add-on to the User Guide for Statistics / Non-stationary Modeling This technical reference describes the non-stationary variogram modeling approach, where both the Drift and the Covariance part of the Structure are directly derived in a calculation procedure. In the non-stationary case (the variable shows either a global trend or local drifts), the correct tool cannot be the variogram any more as we must deal with variables presenting much larger fluctuations. Generalized covariances are used instead. As they can be specified only when the drift hypotheses are given, a Non-stationary Model is constituted of both the drift and the generalized covariance parameters. The general framework used for the non-stationary case is known as the Intrinsic Random Functions of order k (IRF-k for short). In this scope, the structural analysis is split into two steps:
m m
determination of the degree of the polynomial drift. influence of the optimal generalized covariance compatible with the degree of the drift.
The procedure described hereafter only concerns the univariate aspect. Conversely, it is developed to enable the use of the external drift feature.
52
Non-stationary Modeling
Z( x) = m( x) =
al fl ( x )
(eq. 4.1-1)
fl(x) denotes the basic monomials al are the unknown coefficients K represents the number of monomials and is related to the degree of the polynomial through the dimension of the space The procedure consists in a cross-validation criterion assuming that the best (order of the) drift is the one which results in the smallest average error. The cross-validation is a generic name for the process which in turns considers one data point (called the target), removes it and estimates it from the remaining neighboring information. The cross-validation error is the difference between the known and the estimated values. When the theoretical variance of estimation is available, the previous error can be divided by the estimation standard deviation. The estimation m*(x) is obtained through a least squares procedure, the main lines of it are recalled here. If
=
Replacing m ( x ) by its expansion:
( Z m ( x ) )
2
(eq. 4.1-2)
2 l Z + l fm Z 2 a f a a f l l m l, m l
(eq. 4.1-3)
am f l f m m
In matrix notation:
f l Z
(eq. 4.1-4)
Technical References
53
( FTF )A = ( FTZ )
(eq. 4.1-5)
The principle in this drift identification phase consists in selecting data points as targets, fitting the polynomials for several order assumptions, based on their neighboring information and derives the minimum square errors for each assumption. The optimal drift assumption is the one which produces, on average, the smallest error variance. The drawback to this method is its lack of robustness against possible outliers. As a matter of fact, an outlier will produce large variances whatever the degree of the polynomial and will reduce the discrepancy between results. A more efficient criterion, for each target point, is to rank the least squared errors for the various polynomial orders. The first rank is assigned to the order producing the smallest error, the second rank to the second smallest one and so one. These ranks are finally averaged on the different target points and the smallest averaged rank corresponds to the optimal degree of the drift.
K(h) =
p b Kp ( h ) p
(eq. 4.1-1)
where Kp(h) corresponds to predefined basic structures. The idea consists in finding the coefficients bp but, this time, among a class of quadratic estimators.
= b p
Z A Z
(eq. 4.1-2)
using systematically all the information available. The principle of the method is based on the MINQUE theory (Rao) which has been rewritten in terms of generalized covariances. Let Z be a vector random variable following the usual decomposition
Z = X + U
(eq. 4.1-3)
Let us first review the MINQUE approach. The covariance matrix of Z, can be expanded on a basis of authorized basic models:
Cov ( Z, Z ) = 2 1 V 1 + + 2 r Vr
introducing the variance components 2 p . We can estimate them using a quadratic form
(eq. 4.1-4)
54
Non-stationary Modeling
2 = ZT A Z p p
where the following conditions are satisfied on the matrix Ap: 1. Invariance: ApX = 0 (X is the drift vector composed of columns of coordinates) 2. Unbiasedness: T r ( A p V q )
(eq. 4.1-5)
= pq
3. Optimality: ||Ap||2V = Tr(ApVApV) minimum where V is a covariance matrix used as a norm. Rao suggested defining V as a linear combination of the Vp:
V =
p Vp
2 2
(eq. 4.1-6)
The MINQUE is reached when the coefficients p coincide with the variance components p , but this is precisely what we are after. Using the vector which constitutes an increment of the data Z we can refer Ap by:
Sp T
where:
T X = 0
and check that the norm V is only involved through:
W = T V
If A and B designate real symmetric n*n matrices, we define the scalar product <A, B>n = Tr(AVBV) If A and B satisfy invariance conditions, then we can find respectively S and T, such that:
(eq. 4.1-7)
(eq. 4.1-8)
Then:
(eq. 4.1-9)
Technical References
55
which defines a scalar product on the (n-k)*(n-k) matrix if k designates the number of drift terms. With these notations, we can reformulate the MINQUE theory:
(eq. 4.1-10)
(eq. 4.1-11) l
(eq. 4.1-12)
(eq. 4.1-13)
then
(eq. 4.1-14) l
(eq. 4.1-15)
(eq. 4.1-16)
(eq. 4.1-17)
(eq. 4.1-18)
56
Non-stationary Modeling
If H designates the subspace spanned on the Hi, the optimality condition induces that Sp belongs to this space and can be written:
(eq. 4.1-19)
(eq. 4.1-20)
This system has solutions as soon as the matrix H(H(i,j) = <Hi,Hj>) is non singular. When the coefficients pi have been calculated, the matrices Sp and Ap are determined and finally the value of
p is obtained. b
These coefficients must then be replaced in the formulation of the norm V and therefore in W. This leads to new matrices Hi and to new estimates of the coefficients pi . The procedure is iterated until the estimates
It can be demonstrated however that the coefficients linked to a single basic structure covariance lead to positive results which produce authorized generalized covariances. The procedure resembles the one used in the moving neighbourhood case. All the possible combinations are tested and the ones which lead to non-authorized generalized covariances are dropped. In order to select the optimal generalized covariance, a cross-validation test is performed and the model which leads to the standardized error closest to 1 is finally retained.
Technical References
57
(eq. 4.2-1)
This establishes that this estimate is a linear combination of the neighboring data. The set of weights is given by:
(eq. 4.2-2)
As the residual from the least squares polynomial of order k coincides with a kriging estimation using a pure nugget effect in the scope of the intrinsic random functions of order k, and as the nugget effect is an authorized model for any degree k of the drift, then:
(eq. 4.2-3)
58
Non-stationary Modeling
Z0 ) .
1 ) .
We have found a convenient way to generate one set of weights which, given a set of points, constitutes an authorized linear combination of order k (ALC-k).
(eq. 4.2-1)
introducing the generalized covariance K(h) where K designates the value of this function K for the distance between points and . We assume that the generalized covariance K(h) that we are looking for is a linear combination of a given set of generic basic structures Kp(h), the coefficients bp (equivalent to sills) of which still need to be determined:
(eq. 4.2-2)
We use the theorem for each one of the measures previously established, that we denote by using the index "m":
Technical References
59
Var
m Z
m K m
(eq. 4.2-3)
= b p m K p m p
If we assume that each generic basic structure Kp(h) is entirely determined with a sill equal to 1, each quantity:
(eq. 4.2-4)
(eq. 4.2-5)
are known. Then the problem is to find the coefficients such that
(eq. 4.2-6)
for all the measures generated around each test data. This is a multivariate linear regression problem that we can solve by minimizing:
(eq. 4.2-7)
The term m is a normation weight introduced to reduce the influence of ALC-k with a large variance. Unfortunately this variance is equal to:
60
Non-stationary Modeling
(eq. 4.2-8)
which depends on the precise coefficients that we are looking for. This calls for an iterative procedure. Moreover we wish to obtain a generalized covariance as a linear combination of the basic structures. As each one of the basic structures individually is authorized, we are in fact looking for a set of weights which are positive or null. We can demonstrate that, in certain circumstances, some coefficients may be slightly negative. But in order to ensure a larger flexibility to this automatic procedure, we simply ignore this possibility. We should however perform regression under the positiveness constraints. Instead we prefer to calculate all the possible regressions with one nonzero coefficient only, then with two non-zero coefficients, and so on ... Each one of these regressions is called a subproblem. As mentioned before, each subproblem is treated using an iterative procedure in order to reach a correct normation weight. The principle is to initialize all the non-zero coefficients of the subproblem to 1. We can then derive an initial value for the normation weights ( m ) 0 . Using these initial weights, we can solve the regression subproblem and derive the new coefficients. We can therefore obtain the new value of the normation weights. This iteration is stopped when the coefficients bp remain unchanged between two consecutive iterations. We must still check that the solution is authorized as the resulting coefficients, although stable, may still be negative. The non-authorized solutions are discarded. Anyhow, it can easily be seen that the monovariate regressions always lead to authorized solutions. Let us assume that the generalized covariance is reduced to one basic structure K(h) = bK0(h) The single unknown is the coefficient , which is obtained by minimizing:
(eq. 4.2-9)
(eq. 4.2-10)
Technical References
61
(eq. 4.2-11)
positive. We can check that b* r 0. We have obtained several authorized sets of coefficients, each set being the optimal solution of the corresponding subproblem. We must now compare these results. The objective criterion is to compare the ratio between the experimental and the theoretical variance:
(eq. 4.2-12)
62
Non-stationary Modeling
E [ Z ( x ) ] = m ( x ) = a0 + alf l ( x )
l
(eq. 4.3-1)
when the fl denotes both standard monomials and external deterministic functions. When this new decomposition has been stated, the determination of the number of terms in the drift expansion as well as the corresponding generalized covariance is similar to the procedure explained in the previous paragraph. Nevertheless some additional remarks need to be mentioned. The inference (as well as the kriging procedure) would not work properly as soon as some of the basic drift functions and the data locations are linearly dependant. In the case of a standard polynomial drift these cases are directly linked to the geometry of the data points: a first order IRF will fail if all the neighboring data points are located on a line; a second order IRF will fail if they belong to any quadric such as a circle, an ellipse or a set of two lines. In the case of external drift(s), this condition involves the value of these deterministic functions at the data points and is not always easy to check. In particular, we can imagine the case where only the external drift is used and where the function is constant for all the samples of a (moving) neighborhood: this property with the universality condition will produce an instability in the inference of the model or in its use via the kriging procedure. Another concern is the degree that we can attribute to the IRF when the drift is represented by one or several external functions. As an illustration we could imagine using two external functions corresponding respectively to the first and second coordinates of the data. This would transform the target variable into a IRF 1 and would therefore authorize the fitting of generalized covariances such as K(h) = |h|3. As a general rule we consider that the presence of an external drift function does not modify the degree of the IRF which can only be determined using the standard monomials: this is a conservative position as we recall that the generalized covariance that can be used for an IRF(k), can always be used for an IRF(k+1).
Technical References
63
5 Quick Interpolations
This page constitute an add-on to the Users Guide for Interpolate / Interpolation / Quick Interpolation The term Quick Interpolation is used to characterize an estimation technique that does not require any explicit model of spatial structure. They usually correspond to very basic estimation algorithms widely spread in the literature. For simplicity purpose, only the univariate estimation techniques are proposed.
64
Quick Interpolations
Z =
Z
(eq. 5.1-1)
The weight attached to each information is inverse proportional to the distance from the data to the target, at a given power (p):
(eq. 5.1-2)
If the smallest distance is smaller than a given threshold, the value of the corresponding sample is simply copied at the target point:
Technical References
65
2 l Z f l l
which leads to the following linear system:
l f l al f l
minimum
(eq. 5.2-1)
l Z f
l
(eq. 5.2-2)
When the coefficients al of the polynomial expansion are obtained, the estimation is:
Z =
al Zf0
l l
(eq. 5.2-3)
66
Quick Interpolations
Technical References
67
Z = ( x, y ) of a geological stratigraphic layer, as such layers are generally nearly horizontal, it is wise to assume that the interpolator is such that:
if we interpolate the top
2 2 R 1 ( ) = and R2 ( ) = are minimum x y
l
(eq. 5.4-1)
if we consider the layer as an elastic beam that has been deformed under the action of geological stresses, it is known that shearing stresses in the layer are proportional to second order derivatives. At any point where the shearing stresses exceed a given threshold, rupture will occur. For this reason, it is wise to assume the following condition at any point where no discontinuity exists:
2
R3 ( ) = , x2
(eq. 5.4-2)
R ( ) = { R 1 ( ) + R 2 ( ) } + ( 1 ) { R 3 ( ) + R4 ( ) + R 5 ( ) }
where
(eq. 5.4-3)
R 5 ( ) has little influence on the result. For this reason, the term
68
Quick Interpolations
----- = ( i + 1, j ) ( i 1, j ) x ( i, j ) ----- = ( i, j + 1 ) ( i, j 1 ) y ( i, j ) = ( i + 1, j ) 2 ( i, j ) + ( i 1, j ) 2 x ( i, j ) = ( i, j + 1 ) 2 ( i, j ) + ( i, j 1 ) 2 y ( i, j )
2 2
- ---------= ( i + 1, j + 1 ) ( i 1, j + 1 ) ( i + 1, j 1 ) + ( i 1, j 1 ) x y ( i, j )
2
(eq. 5.4-4)
Due to this limited neighborhood for the constraints, we can minimize the global roughness in an iterative process, using the Gauss-Seidel Method.
Technical References
69
(fig. 5.5-1)
(eq. 5.5-1)
Z = Z ( i, j )
(eq. 5.5-2)
70
Quick Interpolations
Technical References
71
6 Grid Transformations
This page constitutes an add-on to the On-Line Help for: Interpolate / Interpolation / Grid Operator / Tools / Grid or Line Smoothing. Except for the Grid filters, located in the Tools / Grid or Line Smoothing window and discussed in the last section, all the Grid Transformations can be found in Interpolate / Interpolation / Grid Operator and are performed on two different variable types:
l
The real variables (sometimes called colored variables) which correspond to any numeric variable, no matter how many bits the information is coded on, The binary variables which correspond to selection variables.
Any binary variable can be considered as a real variable; the converse is obviously wrong. The specificity of these transformations is the use of two other sets of information:
l
The threshold interval: it consists of a pair of values defining a semi-open interval of the type [a,b[. This threshold interval is used as a cutoff in order to transform a real variable into its indicator (which is a binary variable). The structuring element: it consists of three parameters defining the extension of the neighborhood, expressed in terms of pixels. Each dimension is entered as the radius of the ball by which the target pixel is dilated: when the radius is null, the target pixel is considered alone; when the radius is equal to 1, the neighborhood extension is 3 pixels,...
An additional flag distinguishes the type of the structuring element: cross or block. The following scheme gives an example of a 2-D structuring element with radius of 1 along X (horizontal) and 2 along Y (vertical). The left side corresponds to a cross type and the right side to a block type.
(fig. 6.0-1)
72
Grid Transformations
When considering a target cell located on the edge of the grid, the structuring element is reduced to only nodes those which belong to the field: this produces an edge effect.
Technical References
73
(fig. 6.1-1)
The previous figure presents the two initial simulations on the upper part and the corresponding binary simulations on the bottom part. The initial simulations have been generated (using the Turning Band method) in order to reproduce: - a spherical variogram on the left side - a gaussian variogram on the right side Both variograms have the same scale factor (10 pixels) and the same variance. Each transformation will be presented using one of the previous simulations (either in its initial or binary form) on the left and the result of the transformation on the right.
74
Grid Transformations
In this paragraph, the types of the arguments and the results of the grid transformations are specified using the following coding:
m m m m l
v binary variable w real or colored variable s real or colored selection variable t threshold
v = real2binary(w) converts the real variable w into the binary variable v. The principle is that the output variable is set to 1 (true) as soon as the corresponding input variable is different from zero.
v = thresh(w,t) transforms the real variable w into its indicator v through the cutoff interval t. A sample is set to 1 if it belongs to the cutoff interval and to 0 otherwise.
v2 = erosion(s,v1) performs the erosion on the input binary image v1, using the structuring element s, storing the result in the binary image v2. A grain is transformed into a pore if there is at least one pore in its neighborhood, defined by the structuring element. The next figure shows an erosion with a cross structuring element (size 1).
(fig. 6.1-2)
Technical References
75
v2 = dilation(s,v1) v2 is the binary image resulting from the dilation of the binary image v1 using the structuring element s. A pore is replaced by a grain if there is at least one grain in its neighborhood, defined by the structuring element. The next figure shows an erosion with a cross structuring element (size 1).
(fig. 6.1-3) l
v2 = opening(s,v1) v2 is the binary image resulting from the opening of the binary image v1 using the structuring element s. It is equivalent to erosion followed by a dilation, using the same structuring element. The next figure shows an erosion with a cross structuring element (size 1).
76
Grid Transformations
(fig. 6.1-4) l
v2 = closing(s,v1) v2 is the binary image resulting from the closing of the binary image v1 using the structuring element s. It is equivalent to a dilation followed by an erosion, using the same structuring element. The next figure shows an erosion with a cross structuring element (size 1).
(fig. 6.1-5) l
v3 = intersect(v1,v2) v3 is the binary image resulting from the intersection of two binary images v1 and v2. A pixel is considered as a grain if it belongs to the grain in both initial images.
Technical References
77
v3 = union(v1,v2) v3 is the binary image resulting from the union of two binary images v1 and v2. A pixel is considered as a grain if it belongs to the grain in one of the initial images at least.
v2 = negation(v1) v2 is the binary image where the grains and the pores of the binary image v1 have been inverted
w2 = gradx(w1) w2 is the real image which corresponds to the partial derivative of the initial real image w1 along the X axis, obtained by comparing pixels at each side of the target node.
w 1 ( ix + 1, iy ) w 1 ( ix 1, iy ) w 2 ( ix, iy ) = ------------------------------------------------------------------------2 dx
l
(eq. 6.1-1)
w2 = grad_xm(w1) w2 is the real image which corresponds to the partial derivative of the initial real image w1 along the X axis, obtained by comparing the value at target with the previous adjacent pixel. Practically on a 2D grid:
(eq. 6.1-2)
w2 = grad_xp(w1) w2 is the real image which corresponds to the partial derivative of the initial real image w1 along the X axis, obtained by comparing the value at target with the next adjacent pixel. Practically, on a 2D grid:
(eq. 6.1-3)
78
Grid Transformations
(fig. 6.1-6) l
w2 = grady(w1) w2 is the real image which corresponds to the partial derivative of the initial real image w1 along the Y axis, obtained by comparing pixels at each side of the target node. Practically on a 2D grid:
(eq. 6.1-4)
w2 = grad_ym(w1) w2 is the real image which corresponds to the partial derivative of the initial real image w1 along the Y axis, obtained by comparing the value at target with the previous adjacent pixel. Practically on a 2D grid:
(eq. 6.1-5)
w2 = grad_yp(w1) w2 is the real image which corresponds to the partial derivative of the initial real image w1 along the Y axis, obtained by comparing the value at target with the next adjacent pixel. Practically on a 2D grid:
(eq. 6.1-6)
Technical References
79
Note - The upper line of the image is arbitrarily set to pore (edge effect).
The next figure represents the gradient along the Y axis of the initial (real) simulation.
(fig. 6.1-7) l
w2 = gradz(w1) w2 is the real image which corresponds to the partial derivative of the initial real image w1 along the Z axis, obtained by comparing pixels at each side of the target node. Practically on a 2D grid:
(eq. 6.1-7)
w2 = grad_zm(w1) w2 is the real image which corresponds to the partial derivative of the initial real image w1 along the Z axis, obtained by comparing the value at target with the previous adjacent pixel. Practically on a 2D grid:
(eq. 6.1-8)
w2 = grad_zp(w1) w2 is the real image which corresponds to the partial derivative of the initial real image w1 along the Z axis, obtained by comparing the value at target with the next adjacent pixel. Practically on a 2D grid:
80
Grid Transformations
(eq. 6.1-9)
w2 = laplacian(w1) w2 is the real image which corresponds to the laplacian of the initial image w1. The next figure represents the laplacian of the initial (real) simulation. Practically on a 2D grid:
(eq. 6.1-10)
(fig. 6.1-8) l
w4 = divergence(w1,w2,w3) w4 is the real image which corresponds to the divergence of a 3-D field, whose components are expressed respectively by w1 along X, w2 along Y and w3 along Z. Practically on a 3D grid:
Technical References
81
w 1 ( ix + 1, iy, iz ) w 1 ( ix, iy, iz ) w 4 ( ix, iy, iz ) = -------------------------------------------------------------------------------+ dx w 2 ( ix, iy + 1, iz ) w2 ( ix, iy, iz ) -------------------------------------------------------------------------------- + dy w 3 ( ix, iy, iz + 1 ) w 3 ( ix, iy, iz ) -------------------------------------------------------------------------------dz
l
(eq. 6.1-11)
w4 = rotx(w1,w2,w3) w4 is the real image which corresponds to the component along X of the rotational of 3D field, whose components are expressed respectively by w1 along X, w2 along Y and w3 along Z. Practically on a 3D grid:
w 2 ( ix, iy + 1, iz ) w 2 ( ix, iy, iz ) w 4 ( ix, iy, iz ) = -------------------------------------------------------------------------------- dy w 3 ( ix, iy, iz + 1 ) w 3 ( ix, iy, iz ) -------------------------------------------------------------------------------dz
l
(eq. 6.1-12)
w4 = roty(w1,w2,w3) w4 is the real image which corresponds to the component along Y of the rotational of 3D field, whose components are expressed respectively by w1 along X, w2 along Y and w3 along Z. Practically on a 3D grid:
w 3 ( ix, iy, iz + 1 ) w 3 ( ix, iy, iz ) w 4 ( ix, iy, iz ) = -------------------------------------------------------------------------------- dy w 1 ( ix + 1, iy, iz ) w 1 ( ix, iy, iz ) -------------------------------------------------------------------------------dx
l
(eq. 6.1-13)
w4 = rotz(w1,w2,w3) w4 is the real image which corresponds to the component along Z of the rotational of 3D field, whose components are expressed respectively by w1 along X, w2 along Y and w3 along Z. Practically on a 3D grid:
82
Grid Transformations
w 2 ( ix, iy + 1, iz ) w 2 ( ix, iy, iz ) w 4 ( ix, iy, iz ) = -------------------------------------------------------------------------------dy w 1 ( ix + 1, iy, iz ) w 1 ( ix, iy, iz ) -------------------------------------------------------------------------------dx
l
(eq. 6.1-14)
w2=gradient(w1) w2 is the real image containing the modulus of the 2D gradient of w1. Practically on a 2D grid:
2 w 1 ( ix, iy + 1 ) w 1 ( ix, iy ) 2 1 ( ix + 1, iy ) w 1 ( ix, iy ) w ---------------------------------------------------------------- + --------------------------------------------------------------- dx dy
(eq. 6.1-15)
w 2 ( ix, iy ) =
(fig. 6.1-9) l
w2=azimuth2d(w1) w2 is the real image containing the azimuth (in radian) of the 2D gradient of w1. Practically on a 2D grid:
Technical References
83
(fig. 6.1-10) l
w = labelling_cross(v) w is the real image which contains the ranks (or labels) attached to each grain component that can be distinguished in the binary image v. A grain component is the union of all the grain pixels that can be connected using a grain path. Here two grains are connected as soon as they share a common face. The labels are strictly positive quantities such that two pixels belong to the same grain component if and only if they have the same label. The grain component labels are ordered so that the largest component receives the label 1, the second largest the label 2, and so on. The pore is given the label 0. In the following figure, only the 14 first largest components are represented separately (using different colors); all the smallest ones are displayed using the same pale grey color. A printout of the grain component dimensions is provided: for each component dimension, sorted in decreasing order, the program gives the count of occurrences and the total count of pixels involved.
84
Grid Transformations
(fig. 6.1-11) l
w = labelcond_cross(v1,v2) This function is similar to the labelling_cross function, but restricted to v2.
w = labelling_block(v) This function is similar to the labelling_cross function, but, this time, two grains are connected as soon as they share a common face or vertex. Therefore the connectivity probability is larger here which leads to fewer but larger components.
(fig. 6.1-12)
Technical References
85
w = labelcond_block(v1,v2) This function is similar to the labelling_block function, but restricted to v2.
w2 = moving_average(s,w1) w2 is a real image where each pixel is obtained as the average of the real image w1 performed over a moving neighborhood centered on the target pixel, whose dimensions are given by the structuring element s. The next figure represents the moving average transformation applied to the initial simulation using the smallest cross structuring element.
(fig. 6.1-13) l
w2=moving_average_cond(s,w,wf) Performs the same operation as the moving_average function, but the neighborhood of a target cell is reduced to the peripheral cells (included in the structuring element s) where the secondary variable wf has the same value as in the target cell.
w2 = moving_median(s,w1) w2 is a real image where each pixel is obtained as the median of the real image w1 performed over a moving neighborhood centered on the target pixel, whose dimensions are given by the structuring element s. The next figure represents the moving median transformation applied to the initial simulation using the reference structuring element.
86
Grid Transformations
(fig. 6.1-14) l
w2=moving_median_cond(s,w,wf) Performs the same operation as the moving_median function, but the neighborhood of a target cell is reduced to the peripheral cells (included in the structuring element s) where the secondary variable wf has the same value as in the target cell.
w2=fill_average(w1) When w1 is an image containing several holes (non informed areas), you may wish to complete the grid before performing other operations. A convenient solution is to use the fill_average option which will replace any unknown grid value by the average of the first non-empty rings located around the target node .
(fig. 6.1-15)
Technical References
87
v=imagestat(v) This operation provides an easy way to get basic statistics on a binary image. The output binary image is equal to the input binary image.
w2=shadowing(w1,a,b) the resulting variable w2 corresponds to the image of the input variable w1 considered as a relief and represented with the shadow created by a light source. The source location is characterized by its longitude (a) and its latitude (b). The longitude angle (a) is counted from the north whereas the latitude is positive when located above the ground level. The following image shows the shadowed image with a light source located at 10 degrees longitude and 20 degrees latitude.
(fig. 6.1-16) l
w2=integrate(w1) This operation considers the only active grid nodes where the input variable w1 is defined. The output variable returns the rank of the active node. Moreover some statistics are printed out (in the message area) where the count of active nodes is given together with the cumulated and average quantity of the variable or the positive variable (where only its positive values are taken into account). The following picture shows the resulting variable represented with a grey color map (black for low values and white for large values).
88
Grid Transformations
(fig. 6.1-17) l
v=dynprogx(w1) This function creates a binary image (selection) where one pixel is valid per YOZ plane, which corresponds to the continuous path of the maximum value between the first and last YOZ planes of the 3-D block. In the next figure, remember that the large values correspond to the lighter color of the left side image.
(fig. 6.1-18) l
v=dynprogy(w1) This function creates a binary image (selection) where one pixel is valid per XOZ plane, which corresponds to the continuous path of the maximum value between the first and last XOZ planes of the 3-D block. In the next figure, remember that the large values correspond to the lighter color of the left side image.
Technical References
89
(fig. 6.1-19) l
v=dynprogz(w1) This function creates a binary image (selection) where one pixel is valid per XOY plane, which corresponds to the continuous path of the maximum value between the first and last XOY planes of the 3-D block. In the next figure, remember that the large values correspond to the lighter color of the left side image.
v=maxplanex(w) This function creates a binary image (selection) where one pixel is valid per YOZ plane, which corresponds to the largest value of the function in this plane. In the next figure, remember that the large values correspond to the lighter color of the left side image.
(fig. 6.1-20)
90
Grid Transformations
v=maxplaney(w) This function creates a binary image (selection) where one pixel is valid per XOZ plane, which corresponds to the largest value of the function in this plane. In the next figure, remember that the large values correspond to the lighter color of the left side image.
(fig. 6.1-21) l
v=maxplanez(w) This function creates a binary image (selection) where one pixel is valid per XOY plane, which corresponds to the largest value of the function in this plane. In the next figure, remember that the large values correspond to the lighter color of the left side image
Technical References
91
6.2 Filters
A last type of transformation corresponds to the filters. They can be used on data regularly spaced of any dimension: therefore, they can be applied on grids or on points sampled along a line (in this case, we consider that the sampled are regularly spaced not paying attention to their actual coordinates). The three elementary filters provided in Isatis are described hereafter.
(eq. 6.2-1)
is automatically set to 0.5. Nevertheless, we can ask to perform a two-passes procedure where a second pass is performed with = -0.5.
The next picture shows an illustration of the low-pass filtering procedure performed on a 2D grid of 100 X 100 nodes. The top figure presents a simulated variable (spherical variogram with a range of 10) after thresholding (positive values in white and negative values in black). The bottom figure shows the variable after 50 iterations of the two_passes procedure.
92
Grid Transformations
(fig. 6.2-1)
Note - The filter is applied in a given direction at a node only if its neighborhood is complete
otherwise the initial value is left unchanged. Therefore all the nodes can be treated and the output grid is complete.
Technical References
93
value over its neighborhood (whose extension radius "n" is given by the user) according to the formulae:
Z ( i ) Median [ Z ( i n ), , Z ( i ), , Z ( i + 1 ) ]
(eq. 6.2-1)
Note - The final size of the neighborhood is equal to 2n+1 nodes. The neighborhood is truncated
when it intersects the edge so that all the nodes can be treated and the output grid is complete. The next picture shows an illustration of the median filtering procedure performed on a 2D grid of 100 X 100 nodes. The top figure presents a simulated variable (spherical variogram with a range of 10) after thresholding (positive values in white and negative values in black). The bottom figure shows the variable after 5 iterations of the median filter where n=2
94
Grid Transformations
(fig. 6.2-1)
An additional feature consists in constraining the first two transformations using an auxiliary cutoff variable: the deformation for each pixel (distance between the initial value and the modified value) may not exceed an amplitude given by the cutoff variable. Moreover when the cutoff variable lies below a given threshold, no deformation is performed. This allows the user to filter the result of a kriging estimation performed on a grid, with respect to the estimation standard deviation
Technical References
95
Z( i) Z(i 1) Z ( i ) -----------------------------------
(eq. 6.2-1)
where
Note - This procedure induces an edge effect as the last value along each ID row (in the direction
of calculation) is not processed and is left undefined in the output grid. The procedure can be iterated to provide higher order incrementations The next picture shows an illustration of the incrementing procedure performed on a 2D grid of 100 X 100 nodes. The top figure presents a simulated variable (spherical variogram with a range of 10) after thresholding (positive values in white and negative values in black). The bottom left figure represents the gradient (iterated once) along the X direction whereas the bottom right figure is the gradient along the Y direction .
96
Grid Transformations
(fig. 6.2-1)
Technical References
97
7 Linear Estimation
This page constitutes an add-on to the Users Guide for Interpolate / Estimation / (Co-)Kriging (unless specified). This technical reference presents the outline of the main kriging applications. In fact, by the generic term "kriging", we designate all the procedures based on the Minimum Variance Unbiased Linear Estimator, for one or several variables. The following cases are presented:
m m m m m m m m m m m m m m m m m m
ordinary kriging, simple kriging, kriging in the IRF-k case, drift estimation, estimation of a drift coefficient, kriging with external drift, unique neighborhood case, filtering model components, factorial kriging, block kriging, polygon kriging, gradient estimation, kriging several variables linked through partial derivatives, kriging with inequalities, kriging with measurement error, lognormal kriging, cokriging, extended collocated cokriging.
98
Linear Estimation
Z the random variable. We define the kriging estimate, denoted Z*, as a linear combination of the neighboring information Z , introducing the corresponding weights Z =
(eq. 7.1-1)
For a better legibility, we will omit the summation symbol when possible using the Einstein notation. We consider the estimation error, i.e. the difference between the estimation and the true value Z* - Z0. We impose the estimator at the target (denoted "0") to be:
l
unbiased:
E [ Z Z 0 ] = E [ Z Z 0 ] = 0
(which assumes that the expectation of the linear combination exists).
l
(eq. 7.1-2)
(eq. 7.1-3)
E[Z] = m
Then equation (eq. 7.1-2) can be expanded:
(eq. 7.1-4)
E [ Z Z 0 ] = m 1 = 0 = 1
(eq. 7.1-5)
Technical References
99
= Var [ Z Z 0 ] = b C 2 C 0 + C 00
which should be minimum under the constraints given in (eq. 7.1-5) . Introducing the Lagrange multiplier
minimum
(eq. 7.1-6)
= C 2 C 0 + C 00 + 2 1
and .
-------= 0 C + = C a 0 ----- = 0 = 1
(eq. 7.1-8)
C + = C 0 = 1 2 = C 00 C 0
Using matrix notation:
(eq. 7.1-9)
C 1 = C 0 1 1 0
and
C = C 00 0 1
(eq. 7.1-10)
In the intrinsic case, we know that we can use the variogram that:
(h ) = C( 0) C( h)
We can then rewrite the kriging system:
(eq. 7.1-11)
100
Linear Estimation
+ = 0 = 1 2 = 00 0
(eq. 7.1-12)
In the intrinsic case, there are two ways of expressing kriging equations: either in covariance terms or in variogram terms. In view of the numerical solution of these equations, the formulation in covariance terms should be preferred because it endows the kriging matrix with the virtues of definite positiveness and involves an easier practical inversion.
Technical References
101
(eq. 7.2-1)
In matrix notation:
( C ) ( ) = ( C 0 )
and
2 = C 00 ( ) ( C 0 )
(eq. 7.2-2)
Z* 0 =
Z + 1 m
(eq. 7.2-3)
102
Linear Estimation
E [ Z X ] = a l f (l x )
l where f ( are the basic monomials and al are the unknown coefficients. x)
(eq. 7.3-1)
Before applying the kriging conditions, we must make sure that the mean and the variance of the kriging error exist. We need this error to be an authorized linear combination (ALC) for the degree k of the polynomial to be filtered:
l = f l for l k Z is an ALC-k f 0
(eq. 7.3-2)
If we now consider the kriging error, the combination consists of the neighboring points the corresponding weights
Z with
l k
(eq. 7.3-3)
They are called the "Existence Equations". If we now consider the unbiasedness condition (eq. 7.1-2):
l a f l = a (f l f l ) E [ Z * Z0 ] = E [ Z Z 0 ] = al f l 0 l 0
(eq. 7.3-4)
Due to (eq. 7.3-3), the expectation of the estimation error is always zero. The optimality condition (eq. 7.1-3) leads to:
2 = Var [ Z * Z 0 ] = K 2 K 0 + K 00
minimum
(eq. 7.3-5)
where K(h) is the new structural tool called the "generalized covariance". This variance must be minimized under the existence equations. Introducing as many Lagrange parameters existence equations, we must then minimize the quantity:
l fl ) = K 2 K 0 + K 00 + 2 l ( f 0
(eq. 7.3-6)
l as there are
and l
Technical References
103
l = K - = 0 K + l f -------0 l = fl -------= 0 f 0 1
We finally obtain the (IRF-k) kriging system:
l K + l f = K 0 l l = f0 f l 2 = K 00 K 0 l f 0
(eq. 7.3-7)
l k
l k
(eq. 7.3-8)
In matrix notation:
l K0 K f = l l f0 f 0 l
and
T K 0 2 = K 00 l f0 l
(eq. 7.3-9)
104
Linear Estimation
(eq. 7.4-1)
m ( x ) = a l f l ( x ) is the drift
We wish to estimate the value of the drift at the target point by kriging:
m ( x 0 ) = Z
The unbiasedness condition implies that:
l a fl = 0 E [ m m 0 ] = a l f l 0
(eq. 7.4-2)
a l
(eq. 7.4-3)
therefore
l = fl f 0
Var [ m m 0 ] = C
Finally the kriging system is derived:
minimum
(eq. 7.4-4)
C + f l = 0 l l l f = f0 l 2 = l f
In matrix notation:
(eq. 7.4-5)
0 l C f = l l f 0 l f0
and
(eq. 7.4-6)
Technical References
105
2 = l l f0
0
(eq. 7.4-7)
106
Linear Estimation
(eq. 7.5-1)
We wish to estimate the value of one of the drift components (say the one corresponding to the basic drift function number l0) at the target point by kriging:
al* = a * l ( x 0 ) = Z
0 (eq. 7.5-2)
(eq. 7.5-3)
for for
l l0
(eq. 7.5-4)
l = l0
Var [ a l a l ] = C
0 0
minimum
(eq. 7.5-5)
C + f l = 0 l l f = 0 f l0 = 1
(eq. 7.5-6)
Technical References
107
Z(x) is
Here, the basic hypothesis is that the expectation of the variable can be written:
E [ Z ( x ) ] = a0 + a1 S ( x )
where S(x) is a known variable (background) and where a0 and a1 are unknown.
(eq. 7.6-1)
Once again, before applying the kriging conditions, we must make sure that the mean and the variance of the kriging error exist. We need this error to be a linear combination authorized for the drift to be filtered. This leads to the equations:
= 1 S = S0
These existence equations ensure the unbiasedness of the system. This optimality constraint leads to the traditional equations:
(eq. 7.6-2)
Var [ Z Z 0 ] = K 2 K 0 + K 00
where K(h) is then a generalized covariance. Introducing the Lagrange parameters
minimum
(eq. 7.6-3)
= K 2 K 0 + K 00 + 2 0 ( 1 ) + 2 1 ( S S 0 )
against the unknowns , 0 and 1 :
108
Linear Estimation
(eq. 7.6-5)
K + 0 + 1 S = K 0 = 1 = S0 S
In matrix notation:
(eq. 7.6-6)
K 1 S K 0 1 0 0 0 = 1 S 0 0 1 S0
and
(eq. 7.6-7)
2 = K 00 0 1
K0 1 S0
(eq. 7.6-8)
Technical References
109
(eq. 7.7-1)
The Kriging conditions of unbiasedness and optimality lead to the following linear Kriging System:
l C C f 0 = l l f 0 l f0
(eq. 7.7-2)
2
with the following notations:
C 0 = C 00 l l f0
(eq. 7.7-3)
,
0 C
l f
Indices relative to data points belonging to the neighborhood of the target point Index which refers to the target point The value of the covariance part of the structural model expressed for the distance between the data points The value of the drift function ranked "l" applied to the data point The value of the modified covariance part of the structural model expressed for the distance between the point and the target point. The value of the drift function ranked "l" applied to the target point The value of the modified covariance part of the structural model (iterated twice) expressed between the target point and itself.
C 0
l f0
00 C
110
Linear Estimation
The terms
punctual
= C C = 0 C = C C ( dv ) v
drift
block average
vvC ( dv , dv )
C = -----C x
2C = --------C x 2
AX = B
where: A X B is the left-hand side kriging matrix
(eq. 7.7-4)
is the vector of kriging weights (including the possible Lagrange multipliers) is the right-hand side kriging vector stands for the matrix product will designate the scalar product
AB
*
The left-hand side matrix depends on the mutual location of the data points present in the neighborhood of the target point. The right-hand side depends on the location of the data points of the neighborhood with regard to the location of the target point. The choice of the calculation option only influences the right-hand side and leaves the left-hand side matrix unchanged.
In the Moving Neighborhood case, the data points belonging to the neighborhood vary with the location of the target point. Then the left-hand matrix A, as well as the right-hand side vector B must be established each time and the vector of kriging weights X is obtained by solving the linear kriging system. The estimation is derived by calculating the product of the first part of the vector
Technical References
111
X (excluding the Lagrange multipliers) by the vector of the variable value measured at the neighboring data samples Z, that we can write in matrix notation as:
Z = X t * Z
(eq. 7.7-5)
is the vector of the variable value complemented by as many zero values as there are drift where Z equations (and therefore Lagrange multipliers) and designates the scalar product.
Finally the variance of the estimation error is derived by calculating another scalar product:
2 = C 00 X t * B
(eq. 7.7-6)
In the Unique Neighborhood case, the neighboring data points remain the same whatever the target point. Therefore the right-hand side matrix is unchanged and it seems reasonable to invert it once for all A-1. For each target point, the right-hand side vector must be established, but this time the vector of kriging weights X is obtained by a simple scalar product:
X = A 1 B
Then, the rest of the procedure is similar to the Moving Neighborhood case:
(eq. 7.7-7)
Z = X t * Z 00 X t * B 2 = C
(eq. 7.7-8)
(eq. 7.7-9)
If the variance of the estimation error is not required, the vector of kriging weights does not even have to be established. As a matter of fact, we can invert the following system:
AC = Z
(eq. 7.7-10)
The estimation is immediately obtained by calculating the scalar product (usually referred as the dual kriging system):
Z = C t * B
(eq. 7.7-11)
112
Linear Estimation
Z = m + Y1 + Y2
(eq. 7.8-1)
where Y1 is centered (mean is zero), characterized by the variogram 1 and Y2 by 2 . If the two variables are independent, it is easy to see that the variogram of the variable Z is given by:
= 1 + 2
(eq. 7.8-2)
Instead of estimating Z , we may be interested in estimating one of the two components, the estimation of the mean has been covered in the previous paragraph. We are going to describe the estimation of one scale component (say the first one):
Y 1 =
(eq. 7.8-3)
Here again, we will have to distinguish whether the mean is a known quantity or not. If the mean is a known constant, then it is obvious to see that the unbiasedness of the estimator is fulfilled automatically without implying additional constraints on the kriging weights. If the mean is constant but unknown, the unbiasedness condition leads to the equation:
= 0
(eq. 7.8-4)
Note that the formalism can be extended to the scope of IRF-k (i.e. defining the set of monomials fl(x) which compose the drift) and impose that:
fl ( x )
= 0
(eq. 7.8-5)
Nevertheless the rest of this paragraph will be developed in the intrinsic case of order 0 and we can establish the optimality condition:
1] = 1 1 Var [ Y 1 Y 0 0 00 + 2
minimum
(eq. 7.8-6)
Technical References
113
+ = 1 0 = 0
(eq. 7.8-7)
1 inThe estimation of the second scale component Y2*, will be obtained by simply changing 0 2 in the right-hand side of the kriging system, keeping the left-hand side unchanged. to 0
Similarly, rather than extracting a scale component, we can also be interested in filtering a scale component. Usually this happens when the available data measure the variable together with an acquisition noise. This noise is considered as independent from the variable and characterized by its own scale component, the nugget effect. The technique is applied to produce an estimate of the variable, filtering out the effect of this noise, hence the name. In Isatis instead of selecting one scale component to be estimated, the user has to filter out components. Because of the linearity of the kriging system, we can easily check that:
Z = m + Y 1 + Y 2
(eq. 7.8-8)
This technique is obviously not limited to two components per variable, nor to one single variable. We can even perform components filtering using the cokriging technique.
114
Linear Estimation
, P .
For each structure p , we introduce a set of orthogonal variables Yp1,...,YpN (means 0 and variances 1), mutually independent and characterized by the same variogram and write:
P N
Zi = mi +
ik Y p k ap p=1 k =1
(eq. 7.9-1)
Because of the mutual independence, we can easily derive the simple and cross-variograms of the different variables:
P N
Zi, Zj =
ik a jk p p ap p =1 k =1 N
(eq. 7.9-2)
Zi, Zj =
ij p bp p=1
(eq. 7.9-3)
These coefficients correspond to the sills matrices (Bp), symmetrical, definite positive. Note that the decomposition of the Zi is not unique and thus the Ypi have no physical meaning. For a given scale component
"p", we usually derive the Ypi from the decomposition of the (Bp)
matrix into a basis of orthogonal eigen vectors. Each Ypi then corresponds to an eigen factor. The Ypi are finally sorted by decreasing eigen value (percentage of variance of the scale component). The principal task of the Factorial Analysis is to estimate, through the traditional cokriging, a given factor for a given scale component. Two remarks should be made:
Technical References
115
As the factors are mutually independent, we can recover the kriging estimates of the variables by applying the linear decomposition on the estimated factors:
P N
Z i = m i +
ik ( Y p ) k ap p=1 k =1
(eq. 7.9-4)
The estimation of the mean is the multivariate extension of the drift estimation (previous paragraphs).
l
For a given scale component, some eigen values may happen to be equal to 0 or almost null. This means that the contribution of these factors to the estimator (or to the simulated value in the simulation process) is null.
116
Linear Estimation
K 0 by K v which corresponds to the integral of the covariance function between the data
point and a point which describes the volume v :
1K v = ---K x dx v
v
(eq. 7.10-1)
The integral must be expanded over the number of dimensions of the space in which v is defined.
l
f l 0 by f l v which correspond to the mean values of the drift functions over the volume: 1- l l = ---fv f dx v x
v
(eq. 7.10-2)
K + f l = K l v l f l = f l v
The block kriging variance is given by
l 2 = K vv K v l f v
(eq. 7.10-3)
(eq. 7.10-4)
It requires the calculation of the term Kvv instead K00 of the term
1K vv = ------v2
Kxy dx dx
vv
(eq. 7.10-5)
Technical References
117
For each block v, the Kvv integral needs to be calculated once, whereas
K v needs to be calculated
as many times as there are points in the block neighborhood. Therefore these integral calculations have to be optimized. Formal expressions of these integrals exist for a few basic structures. Unfortunately, this is not true for most of them, and moreover these formal expressions sometimes lead to time consuming calculations. Furthermore, the same type of numerical integration MUST be used for the Kvv and the
In the regular discretization case, the block is partitioned into equal cells and the target is replaced by the union of the cell centers ci.This allows the calculation of the K v terms:
N
K v
1 = --K N ci
i=1
(eq. 7.10-6)
where N is the number of cells in the blocks. The double integral of the Kvv calculation is replaced by a double summation:
1K vv = ----K N 2 ci, cj
N N
(eq. 7.10-7)
Applying in this case only the regular discretization sometimes lead to over-estimating the nugget effect. A random discretization is therefore substituted, where the first point of the discretization describes the centers of the previous regular cells whereas the second point is randomly located within its cell. In this case, there is almost no chance that a point ci coincides with the point cj and the function K(h) is never called for a zero-distance. The nugget effect of the structure therefore vanishes as soon as the covariance is integrated. This effect is recommended as soon as the dimension of the block is much larger than the dimension of the sample, which is usually the case.
Note - The drawback of this method is linked to its random aspect. For each calculation of a Kvv
term the set of points requires a set of random values to be drawn which will vary from one trial to another. This is why it is recommended that the user exercises this calculation to determine the optimum as a trade-off between accuracy and stability of the result on the one hand, and computation time on the other : this possibility is provided in the Neighborhood procedure.
118
Linear Estimation
1 K v= ---------i wi
wi K ci
i=1 N N
(eq. 7.11-1)
1 K vv = --------------------i j wi w j
w i w j K ci cj
i=1 i=1
(eq. 7.11-2)
where each weight wi corresponds to the surface of the intersection between the cell vi centered in ci and the polygon. A random discretization is also performed for the computation of the Kvv term .
Technical References
119
- . There are From a mathematical standpoint, it is necessary to clearly define what is meant.by ----two concepts involved:
l
Z u
One is the ordinary concept of a two-sided directional derivative of a fixed function z(x), defined as the limit, if it exists, of:
(eq. 7.12-1)
usual notation, we have used a lower-case letter "z" to emphasize the difference from the random field Z(x) .
l
The other concept is that of a derivative of the random field square sense as the random variable
Z ( x + ru ) Z ( x ) Z - ----lim E --------------------------------------r u r0
= 0
(eq. 7.12-2)
It can be shown that if Z(x) has a stationary and isotropic covariance K(h) , then Z(x) is differentiable in the mean square sense if and only if K(h) is twice differentiable at h = 0. Then K(h) exists for every h and -K(h) is the covariance of Z(x). Unfortunately, common covariance models (like the spherical, the exponential, ...) are not twice differentiable. Strictly speaking, it is then impossible to estimate
not defined. In practice however, we cannot let this theoretical difficulty rule out the estimation of
120
Linear Estimation
Z ----- does exist we not that, by linearity of kriging systems, its u Z Z Z - satisfies : ----- = -------kriging estimator ---- u u u
gradients. Considering the case when
Z ----- is simply obtained by differentiating the rightu Z - as our gradient estimate even when the hand side of the point system. The idea is to accept -------u
This already tells us that the kriging system of covariance (or variogram or generalized covariance) is not twice differentiable. The only difficulty now left is that Z*(x) itself may have singularities. One way to avoid the problem is to use the symmetric formula :
(eq. 7.12-3)
The notation r 0 + means that r decreases to zero from above, i.e. takes on positive values only. This formula may be best justified in terms of one-sided directional derivatives. We now turn to the
Z ----- . For the sake of simplicity the results will be obtained as u if Z had no nugget effect. If not so, it is clear that what we estimate then is not the derivative of Z , which would not make sense, but the derivative of the continuous part of the phenomenon Z.
derivation of the kriging equations of The gradient estimation kriging system is then:
(eq. 7.12-4)
Technical References
121
Cov ( Z, Z ) z z ---- ---- Cov x, x z z ---- ---Cov y, y z ---- Cov Z, x z ---- Cov Z, y z z -, ---- Cov --- x y
2 -------x 2 2 -------y 2 z ---- = Cov x, Z z ---- = Cov y, Z z z -, ---- = C ov --- y x ----x ----y 2 ---------x y
We immediately see that this requires the mathematical function to be at least twice differentiable, which discards basic structures such as the nugget effect, the spherical variogram, the linear variogram which are not differentiable at the origin (the function must be extended by symmetry around the vertical axis for negative distances). To overcome the problem, we will replace the (punctual) gradient by a dip which represents the average slope integrated over a small surface (ball) centered on the data point.
122
Linear Estimation
- G x = ---Z ( x u , y v ) p ( u , v ) d u d v x B
(eq. 7.13-1)
where p(u,v) stands for the convolution weighting function. The integral and the derivation signs can be inverted and this leads to the interesting differentiability feature as soon as p is differentiable. Therefore, we consider the gaussian weighting function:
(eq. 7.13-2)
Where a is the radius of the integration ball B on which the dip measurement is integrated. The structural analysis should therefore be performed with these constraints in mind. Moreover, this implies that if the depth is an IRF-2, then its two gradient components are IRF-0 ; if the depth is an IRF-1, then its two gradient components are stationary. This property reinforces the difficulty of the inference. The principle in this software is to perform the structural analysis on the depth variable and to derive (without any check) the structures of the gradient components.
Note - The multivariate structure does not belong to the class of linear coregionalization models.
There are also some constraints on the drift equations. In fact if we write the cokriging system of depth and gradient.
Z =
- ------- Z + x + y
(eq. 7.13-3)
E [ Z Z 0 ] = 0 al
l l l ff + f l + -------- x y = 0
(eq. 7.13-4)
(eq. 7.13-5)
f l
fl
(eq. 7.13-6)
Technical References
123
Finally the cokriging system can be expressed as follows, assuming that the depth variable is an IRF-1.
----x
-----1 x y y
----x
(eq. 7.13-7)
0 0 1 = -----y 1 0 0 0 0 x0 0 0 0 x y0 0 0 0 y
The same type of cokriging system and the same numerical recipe is used when cokriging two variables Z and Y such that:
l
Z = Y
Y Y - + ----Z = a ----x y
124
Linear Estimation
Note - The Gibbs Sampler is an iterative algorithm which consist in starting with an authorized vector of gaussian values consistent with the inequality constraints. Each value is then modified in turn using a kriging procedure and adding a random value. In Isatis the parameters attached to this algorithm are fixed; a unique neighborhood is compulsory for the simple kriging step.
The simulations can only be performed in the gaussian space. The user has previously to transform the hard data into a gaussian variable and keep the anamorphosis attached to this transformation. The intervals represented by 2 variables have also to be transformed in the gaussian space by the same anamorphosis function. After the simulation, the program has just to calculate the average value of the realizations (after back transformation in the raw space) at each soft data point. These average values are called the conditional expectation. This conditional expectation is in fact the most probable value of the variable at the soft data locations. The standard deviation of these realizations is also calculated and stored. Then, the final step is to krige the target variable using both the hard data and the conditional expectation values.
Technical References
125
Z we are given Z + e where e is a random error satisfying the fol E( e) = 0 Cov ( e , e ) = 0 Var ( e ) = V Cov ( e , Z ) = 0 if
(eq. 7.15-1)
* = Z can be written Z 0
( Z + e ) and
the variance
Var [ Z 0 Z 0 ] =
K + ( ) 2 V 2 K0 + K00
,
(eq. 7.15-2)
Then the kriging system of Z0 remains the same except that V is now added to the diagonal terms
126
Linear Estimation
nearest distance between data points. This is the reason why one could conveniently replace this nugget effect by a transition scheme (say a spherical variogram) with a very short range. But the "nugget effect" (as used in the modeling phase) can also be due to another factor: the measurement error. In this case, the discontinuity is real and is due to errors of the type e . This time, the discontinuity remains whatever the size of the structure investigation. If the same type of measurement error is attributed to all data, the estimate is the same whether:
l
you do not use any nugget effect in your model and you provide the same V for each data, or you define a nugget effect component in your model whose sill C is precisely equal to V .
Unlike the estimate itself, the kriging variance differs depending on which option is chosen. Indeed, the measurement error V is considered as an artefact and is not a part of the phenomenon of interest. Therefore, a kriging with a variance of measurement error equal for each data and no nugget effect in the model will lead to smaller kriging variances than the estimation with a nugget component equal to V . The use of data error variances V really makes sense when the data is of different qualities. Many situations may occur. For example, the data may come from several surveys: old ones and new ones. Or the measurement techniques may be different: depth measured at wells or by seismic, porosities from cores or from log interpretation, etc ... In such cases error variances may be computed separately for each sub-population and, if we are lucky, the better quality data will allow identification of the underlying structure (possibly including a nugget effect component), while the variogram attached to the poorer quality data will show the same previous structure incremented by a nugget effect corresponding to the specific measurement error variance V . In other cases, it could be possible to evaluate directly the precision of each measurement and derive V : if we are told that the absolute error on Z is may consider that,
Z = 2 and take: V = ( Z 2 ) 2 .
Another use of this technique, is in the post processing of the macro kriging where we calculate "equivalent samples" with measurement error variances. These variances are in fact calculated from a fitted model depending on the number of initial samples inside pseudo blocks.
Technical References
127
Z = exp ( Y )
and transformed into:
(eq. 7.16-1)
Y = ln ( Z + )
where
(eq. 7.16-2)
is the shift which makes Z a positive variable and is supposed to be normally distributed.
In this paragraph, we refer to the value of the mean of the raw punctual variable (denoted MZ) and the mean and dispersion variance of the log-variable (denoted mY and S2Y), with the theoretical relationship:
2 sY - M Z = exp m Y + --- 2
(eq. 7.16-3)
Using the variogram of the Y variable (denoted as Y ), we can estimate the value of Y* in any point of the space as a linear combination of the
Y =
Y + 1 mY
either in the strict stationary case (simple kriging) or in the intrinsic case (ordinary kriging) then honoring the condition
The derivation of the estimate and the corresponding variance of estimation on the raw scale is less trivial than simply taking the antilog (exponential) of the log-scale quantities. The following formulae consider the cases of Simple or Ordinary Kriging, for point or block estimations. For block estimation, values for block v are supposed to be lognormally distributed according to the formula:
128
Linear Estimation
1 - Y ( x ) dx + b Z v exp a -v v
(eq. 7.16-5)
where values of coefficients a and b are calculated in order to honor the appropriate mean and variance for Zv, i.e.:
E ( Zv ) = E ( Z ) Z Var ( Z v ) = Var ( Z ) v ,v
Introducing the variogram Y instead, it can be shown that:
(eq. 7.16-6)
1 2 + ln ---- e Y ( x y ) dx dy sY 2 v v a 2 = --------------------------------------------------------------------2 Y sY v, v
(eq. 7.16-7)
1 2 + a2 Y ] - [ ( 1 a2 ) sY b = ( 1 a ) m Y + -v, v 2
Y v ,v -------- = 0. The same formulae include the punctual case with a = 1 and b = 2
(eq. 7.16-8)
1 -- Y ( x ) dx with a vv
tractable estimation variance (no change of support model isrequired).The relative standard deviation of estimation
, which corresponds to
1 -2 Z = exp Y + -2 Y 2 = e Y(1 e
s2
2 Y
(eq. 7.16-1)
(eq. 7.16-2)
Technical References
129
Ordinary Kriging
1 -2 + Z = exp Y + -2 Y 2 = e Y [1 + e
s2
2 + ) ( Y
(eq. 7.16-3)
( e 2 ) ]
(eq. 7.16-4)
1 2+b - a 2 Y Z = exp aY + -2 2 = e
Ordinary Kriging
2 Y ) a2 ( sY , [ 1
(eq. 7.16-1)
2 a 2 Y
(eq. 7.16-2)
1 2 + b + a2 - a 2 Y Z = exp aY + -2 2 = e
2 Y ) a2 ( sY , [ 1
(eq. 7.16-3)
+e
2 + ) a2 ( Y
( e a
2)]
(eq. 7.16-4)
130
Linear Estimation
7.17 Cokriging
This time, we consider two random variables Z1 and Z2 characterized by:
l l l
the simple variogram of Z1 denoted 11 the simple variogram of Z2 denoted 22 the cross-variogram of Z2 and Z2 denoted 12
E [ Z1 ] = m1
and
E [ Z 2 ] = m2
Let us now estimate the first variable at a target point denoted "0", as a linear combination of the neighboring information concerning both variables and using respectively the weights
Z 1 + Z 2 Z 1 = 1 2
1 and 2 :
(eq. 7.17-1)
The first variable is also called the main variable.We still apply the unbiasedness condition (eq. 7.12)
1] = 0 E [ Z 1 Z 0
(eq. 7.17-2)
= 0
m 1, m 2
(eq. 7.17-3)
= 1 1 = 0 2
(eq. 7.17-4)
Let us consider the optimality condition (eq. 7.1-3) and minimize the variance of the estimation error:
1 ] = 11 2 12 22 + Var [ Z 1 Z 0 1 1 1 2 2 2
*
11 + 2 12 11 2 1 2 0 0 00
(eq. 7.17-5)
Technical References
131
(eq. 7.17-6)
In matrix notations:
11 12
12
22
1 0 1
11 0
(eq. 7.17-7)
1 0
with the estimation variance:
0 1
12 0 1 2 = 0 0 0 1 1 0 0 2 0
11 + 12 ( 1 ) 2 = 11 + 1 2 0 00 0
(eq. 7.17-8)
Note - If instead of Z1*, we want to estimate Z2*, the matrix is unchanged and only the right-hand
side is modified:
11 0 12 0
(eq. 7.17-9)
22 12 0 0
1 0
and the corresponding estimation variance:
1 0
12 + 22 + ( 1 ) 2 = 22 + 1 2 2 0 00 0
(eq. 7.17-10)
Let us first remark that both variables Z1 and Z2 do not have to be systematically defined at all the data points. The only constraint is that when estimating Z1, the number of data where Z2 is defined is strictly positive.
132
Linear Estimation
This system can easily be generalized to more than two variables. The only constraint lies in the "multivariate structure" which ensures that the system is regular if it comes from a linear coregionalization model.
Technical References
133
not using any Y information: obviously this does not offer any interest, using all the Y information contained within the neighborhood: this may lead to an untractable solution because of too many information, the initial solution (as mentioned in Xu, W., Tran, T. T., Srivastava, R. M., and Journel, A. G. 1992, Integrating seismic data in reservoir modeling: The collocated cokriging alternative. SPE paper 24742, 67Th Annual Technical Conference and exhibition, p.833-842) consists in using the single value located at the target grid node location: hence the term collocated. Its contribu-
134
Linear Estimation
tion to the kriging estimate relies on the cross-correlation between the two variables at zero distance. But, in the Intrinsic case, the weights attached to the secondary variable must add up to zero and therefore, if only one data value is used, its single weight (or influence) will be zero.
l
the solution used in Isatis is to use the Y variable at the target location and at all the locations where the Z variable is defined (Multi Collocated Cokriging). This neighborhood search has given the more reliable and stable results so far.
In general collocated cokriging is less precise than a full cokriging - making use of the auxiliary variable at all target points when estimating each of these. Exception are models where the cross variogram (or covariance) between the two variables is proportional to the variogram (or covariance) of the auxiliary variable. In this case collocated cokriging coincides with full cokriging, but is also strictly equivalent to the simple method consisting in kriging the residual of the linear regression of the target variable on the auxiliary variable. The user interested by the different approaches to Collocated Cokriging can refer to Rivoirard J., Which Models for Collocated Cokriging?, In Math. Geology, Vol. 33, No 2, 2001, pp. 117-131.
Technical References
135
for variable transformation into the gaussian space useful in the simulation processes (normal score transformation), for histogram modeling and a further use in non linear techniques (D.K., U.C., Global Support Correction, grade-tonnage curves, ...), for variogram transformation.
For information on the theory of Non Linear Geostatistics see Rivoirard J., Introduction to Disjunctive Kriging and Non-linear Geostatistics (Oxford: Clarendon, 1994, 181p).
136
( Y) =
i Hi ( Y )
i=0
(eq. 8.1-1)
where the Hi(Y) are called the Hermite Polynomials. In practice, this polynomial expansion is stopped to a given order. Instead of being strictly increasing, the function
consequently shows
maxima and minima outside an interval of interest, that is for very low probability of Y, for instance outside [-2.5, 3.] in (fig. 8.1-1) (horizontal axis for the gaussian variable and the vertical axis for the Raw Variable)
Technical References
137
(fig. 8.1-1)
The modeling of the anamorphosis starts with the discrete version of the curve on the true data set (fig. 8.1-2). The only available parameters are 2 control points (A and B in (fig. 8.1-2)) which possibly allow the user to modify the behaviour of the model (fig. 8.1-2) on the edges. But this opportunity is in practice important only when the number of samples is small. The other parameters available are the Authorized Interval on the Raw Variable (defined between a minimum value Zamin and a maximum one Zamax) and the order of the Hermite Polynomial Expansion (number of polynomials). The default values for the authorized interval are the minimum and the maximum of the data set. In this configuration, the 2 control points do not modify the experimental anamorphosis previously calculated.
138
(fig. 8.1-2)
After the definition of this discretized anamorphosis, the program calculates the
coefficients of
the expansion in Hermite Polynomials. It draws the curve and calculates the Practical Interval of Definition and the Absolute Interval of Definition:
l
the bounds of the Practical Interval of Definition are delimited by the two points [Ypmin, Zpmin] and [Ypmax, Zpmax] (fig. 8.1-3). The two calculated points are the points where the curve crosses the upper and lower authorized limits on raw data (Zamin and Zamax) or the points where the curve is no longer increasing with Y. the bounds of the Absolute Interval of Definition are delimited by the two points [Yamin, Zamin] and [Yamax, Zamax] (fig. 8.1-3). These two points are the intersections of the curve with the horizontal lines defined by the Authorized Interval on the Raw variable. The values generated using the anamorphosis function will never be outside this Absolute Interval of Definition.
The Figure 3 explains how the anamorphosis will be truncated later during use
Technical References
139
(fig. 8.1-3)
Condition on Y
Result on Z
140
Condition on Y
Result on Z
NH 1
Z =
i=0
i Hi ( Y )
Z =
with
2 d v
( Y +
2 u ) g ( u ) du 1 d v
(eq. 8.1-1)
2 = C(0) 2 dv sk
and
as a consequence
Linear Interpolator Inversion The inversion is just performed using a linear interpolation of the anamorphosis after discretization. This interpolation also takes into account the previous intervals of definition of the anamorphosis function:
Condition on Z
Result on Y
Z < Z amin
Y = Y amin
Technical References
141
Condition on Z
Result on Y
Z amin Z Z pmin Z pmin < Z < Z pmax Z pmax Z Z amax Z > Z amax
i=0
i Hi ( Y )
Frequency Inversion The program just sorts the raw values. A cumulative frequency is then calculated for each sample FCi from the smallest value adding the frequency of each sample:
FC i = FC i 1 + W i
(eq. 8.1-1)
The frequency Wi is given by the user (The Weight Variable) or calculated as Wi = 1/N. Note that two samples with the same value will get different cumulative frequencies. The program has finally to calculate the gaussian value:
Y i = ( G 1 ( FC i ) + G 1 ( FC i 1 ) ) 2
(eq. 8.1-2)
In this way, two equal raw data have different gaussian values. The resulting variable is "more" gaussian. This inversion method is generally recommended in Isatis.
l
Empirical Inversion The empirical inversion calculates for each raw value the attached empirical frequency and calculates the corresponding gaussian value. This time, two equal raw values will have the same gaussian transformed value.
Note - It is important to note that even if the gaussian transformed values can be calculated without any anamorphosis model, if the user performs this operation for a simulation (for example), he will have to back-transform these gaussian simulated values and this time the anamorphosis model will be necessary. So it is very important to check during this step that this back
transformation Y Z will not be a problem, particularly from an interval of definition point of view. Indeed, one has to keep in mind the fact that a simulation generates gaussian values on an
142
interval often larger than the interval of definition of the initial data: so the Practical Interval should be carefully checked if the model has to be used later, after a simulation process.
Technical References
143
i coefficients
Z = (Y) =
i Hi ( Y )
i=0
(eq. 8.2-1)
Zv = r ( Yv ) =
i ri Hi ( Yv )
i=0
(eq. 8.2-2)
A simple support correction coefficient can allow the user to get this new anamorphosis and at the same time a model of the histogram of the blocks. In fact this coefficient "r" is determined from the variance of the blocks:
varZ v =
We also have for the points:
i2 r 2 i
i=1
(eq. 8.2-3)
. varZ
i2
i=1
(eq. 8.2-4)
The only problem in the calculation of the coefficient "r" is that we need the anamorphosis model
( i ) and a variogram model. And unfortunately the variance of the points can be calculated with
the anamorphosis (see above) or can be considered as the sill of the variogram (in a strict stationary case). In Isatis we calculate the block variance in the following way:
144
varZ =
i2
i= 1
(eq. 8.2-5)
varZ v = varZ ( v, v )
where
(eq. 8.2-6)
When the sill of the punctual variogram is different from var Z, the value of ized by the ratio: (var Z / variogram sill).
The anamorphosis of the blocks can be stored; the size of the block support is kept for further use (Uniform Conditioning, Disjunctive Kriging, etc...). As in the case of "punctual" anamorphosis, this block anamorphosis can be used to transform block values into gaussian ones and conversely. But the user can also get the grade-tonnage curves of the histogram attached to this block anamorphosis.
( Y ) has been modelled, the different quantities available for a given cut-
T ( zc ) = 1 G ( yc ) y c = 1 ( zc ) ( y ) g ( y ) dy y
c
with
Q ( zc ) =
Q ( zc ) m ( z c ) = ------------T ( zc )
Obviously these quantities can be calculated for the punctual anamorphosis but also with a given block support. In this way, the user can have access to global recoverable reserves.
Technical References
145
Note - These two parameters can be calculated in "Interpolate / Estimation / (Co-)kriging", "Test
Window" option "Print Complete Information", when kriging a block with the future configuration of the samples... These two values are called in the kriging output: Variance of Z* (Estimated Z) and Covariance between Z and Z*. The used formulae are in this case:
VarZ v =
i2 s 2i
i=1
(eq. 8.2-1)
cov ( Z v, Z v ) =
i2 r i s i i
i=1
(eq. 8.2-2)
This time, the different quantities for a given cutoff "zc" are :
l
T ( zc ) = 1 G ( yc )
1 ( z ) yc = s c
with
Q ( zc ) =
yr ( y ) g ( y ) dy
c
Q ( zc ) m ( z c ) = ------------T ( zc )
146
Isatis gives the values of the two gaussian correlation coefficients: "s" and " " in the "Calculate" window for information.
Note - In the case where the future block estimates have no conditional bias, then s = r , and
the estimated recoverable reserves are the same as in the case of larger virtual blocks that would be perfectly known ("equivalent blocks", having a variance equal to the variance of the future estimates).
Technical References
147
C(h) =
where:
l l
i2 i ( h )
i=1
(eq. 8.3-1)
This relationship is valid if the pair of variables (Y(x), Y(x+h)) can be considered as bivariate normal. From the relationship on covariances, we can derive the relationship on variograms. The use of that relationship is triple:
l
One can calculate the covariances (or variograms) on gaussian transformed values and raw values and check if the relationship holds in order to confirm the binormality of (Y(x), Y(x+h)) pairs One can calculate the gaussian variogram on the gaussian transformed values and deduce the raw variogram This is interesting because the variogram of the gaussian variable is often more clearly structured and easy to fit than the raw variogram derived from the raw values.
One can calculate the gaussian variogram from the raw variogram. That transformation is not as immediate as the previous one, as each lag the relationship needs to be inverted (the secant method can be used for instance). This use of the relationship between gaussian and raw covariance is compulsory to achieve disjunctive kriging on gaussian transformed values after change of support. It means that it calculates the gaussian covariance for the block support v from an analogous relationship
Cv ( h ) =
i2 r 2 i vi ( h )
i=1
(eq. 8.3-2)
148
In each case, the relationship has to be applied using a discretization of the space (namely h values).
Technical References
149
Background information about the following non linear estimation techniques is presented hereafter: 1. Indicator Kriging, 2. Probability from Conditional Expectation, 3. Disjunctive Kriging, 4. Uniform Conditioning, 5. Service Variables, 6. Confidence Intervals. For a general presentation of non linear geostatistics, the reader should refer to Rivoirard J., Introduction to Disjunctive Kriging and Non-linear Geostatistics (Oxford: Clarendon, 1994, 181p).
150
1 Ind ( Z z c ) = 1 { Z z c } = 0
if if
Z zc Z < zc
(eq. 9.1-1)
No specific problem occurs when processing indicators instead of real variable(s), through the kriging algorithm. Nevertheless in case of multi-indicators, we must provide a multivariate model which is not always easy to establish. Instead, we can imagine using a generic model (obtained say for the indicator of the median value) and tune its sill for all the indicators of interest; moreover, if we are only interested in the estimation (rather than in its variance) we do not even have to bother about the tuning. Indicator variables being necessarily correlated, indicator kriging is only an approximation of indicator cokriging (which takes into account the other indicators when estimating one particular indicator), except when all simple and cross structures are proportional (autokrigeability). Hence, the only work consists in finding the kriging weights and applying them to each set of indicators to obtain an estimated indicator. This approach is used in the window: "Interpolate / Estimation / Bundled Indicator Kriging". When the user prefers to fit a multivariate model two options are given in Isatis. In any case, the user must first use the window "Statistics / Indicator Pre Processing" to create in the data file the indicators and also to create the variables in the output grid file for kriging. When the indicators have been created the user can fit one multivariate model using the standard multivariate approach ("Statistics / Exploratory Data Analysis" and "Statistics / Variogram Fitting") or fit each indicator separately and use "Statistics / Univariate to Multivariate Variogram" to get the multivariate model. The standard "Interpolate / Estimation / (Co-)Kriging" window will then be used to get the kriged indicators. In all the cases, the final problem comes in the interpretation of these results: in order to consider the kriged indicators as conditional cumulative distribution functions (ccdf), we have to ensure that the following constraints are fulfilled:
l
Definition
[ Ind ( Z z c ) ] [ 0, 1 ]
(eq. 9.1-2)
Technical References
151
Inequality
[ Ind ( Z z 1 ) ] [ Ind ( Z z 2 ) ]
if
z1 < z2
(eq. 9.1-3)
The results may fail to verify these constraints (for example, because of negative weights) and therefore the results need to be corrected. The correction used in Isatis in "Statistics / Indicator Post Processing" has been exhaustively described in the GSLIB User's Guide (by Deutsch and Journel; p 77-81): it consists of the average of an upward and a downward correction of the cdf. The kriged indicators are primarily used to generate conditional probabilities but the user may wish to transform these results into the probability of exceeding fixed cutoffs, the average value above or below these cutoffs, accounting for a possible change of support. These transformations of the indicator (co-)kriging results, have been also inspired by the GSLIB methods and we strongly encourage the user to refer to the paragraph (v.1.6) "Going Beyond a Discrete cdf" to understand the set of "recipes" and the corresponding parameters.
152
Z ( x ) = [ Y ( x ) + ( x ) W ( x ) ]
where: - Y*and
(eq. 9.2-1)
ciated kriging standard deviation, - W(x) is a normalized gaussian random function, spatially independent from Y*. The probability for Z to exceed a given threshold s is directly derived from the preceding equation:
P [ Z ( x ) > s ] = P [ Y ( x ) + ( x ) W ( ( x ) > 1 ( s ) ) ]
(eq. 9.2-2)
1 G ( 1 ( s ) ) .
Technical References
153
Y = 1 ( Z ) H n ( Y )
(eq. 9.3-1)
These polynomials will be used for the kriging step. For each panel we krige the polynomials:
H n DK =
with the kriging system:
Hn ( Y )
(eq. 9.3-2)
+
where
r 2n ( v , v )
1 - r n ( v , vi ) n = -- N i
for all
(eq. 9.3-3)
is the block gaussian covariance model. Using these kriged polynomials, we can eas, v
Tonnage
T ( z c ) = 1 G ( yc )
l
n =1
H n 1 ( y c ) g ( yc ) ------------------------------------ H n K n
(eq. 9.3-4)
Metal Quantity
Q ( zc ) =
with:
Hn K i ( y ) Hj ( y ) g ( y ) dy
j=0 i=0
(eq. 9.3-5)
154
1 ( z ) yc = v c
(eq. 9.3-6)
For these calculations, the program needs an anamorphosis modeled on the block support and a variogram model. This variogram model is obtained in several steps:
l l l
modeling the Raw Punctual Variogram. regularization of this variogram on the block support. transformation of this regularized variogram in the corresponding gaussian variogram using the block anamorphosis. modeling this last discretized variogram.
It is important to notice that the kriging step is performed without universality conditions. The weights of the polynomials are decreasing quickly with the order: this means that in practice the number of kriged polynomials does not need to be important, only 6 or 7 polynomials are generally enough. But conversely, the fact that we are without universality conditions, can lead to strange results in under sampled zones (attraction to the mean).
Technical References
155
Zv = r ( Yv ) =
i r i Hi ( Yv )
i=0 N V i S i Hi ( Y * i=0
(eq. 9.4-1)
* = ( Y* ) = ZV S V
(eq. 9.4-2)
We get:
1 * Y* V = S ( ZV ) 1 ( z ) yc = r c
(eq. 9.4-3)
(eq. 9.4-4)
and;
Tonnage
S y c -Y r V T ( z c ) = 1 G ---------------------- 2 s - 1 r
156
Metal Quantity
Q( z) =
i=0
S -- r Hi ( YV )
j=0
j r j
+
c
H j ( y ) H i ( y ) g ( y ) dy
Like for the global recoverable reserves, the calculations can be performed using an information effect assumption. When fitting the anamorphosis function and using the support effect option, the user will toggle on the information effect button. In the specific case of the uniform conditioning, the user will have to fit the anamorphosis function of the blocks and the anamorphosis function of the kriged panels. In the first case, the fit will have to be performed using the Information Effect option switched ON. But while the user has to enter the variance of the kriged blocks with the ultimate information in the case of the small units as well as the covariance between the true blocks and the kriged blocks, only the variance of the kriged panels with the current available information will need to be entered for the panels. We have for the blocks:
varZ * v=
i2 s 2i
i=1
(eq. 9.4-5)
cov ( Z * v , Zv ) =
We have also for the panels:
i2 r i si i
i=1
(eq. 9.4-6)
varZ * V =
i2 S 2i
i=1
(eq. 9.4-7)
*, Z ) = cov ( Z v V
i2 si S i t i
i=1
(eq. 9.4-8)
We make the assumption that the gaussian variables: Yv and Y*V are independent conditionally to Y*V and we can write:
* ) = cor ( Y , Y * ) cor ( Y *, Y * ) cor ( Y v, Y V V v v v
(eq. 9.4-9)
It has to be noted that Z*V is almost assumed to be without conditional bias. In this case:
Technical References
157
* Z* ] = E [ Z Z* ] = Z* E [ Zv V V V V
(eq. 9.4-10)
and so:
* cov ( Z v, Z * V ) = var ( Z V )
(eq. 9.4-12)
So:
cor ( Y v, Y * V ) = Sr
and then we get:
(eq. 9.4-13)
S r = t S t = ----r
We have also:
1 ( Z ) Y V = S V 1 ( z ) yc = s c
(eq. 9.4-14)
(eq. 9.4-15)
(eq. 9.4-16)
(eq. 9.4-17)
and:
Tonnage
y c tY * V T ( z c ) = 1 G --------------------- 1 t2 Q ( z ) = t i H i ( Y * V )
i=0 N
Metal Quantity
j=0
j rj j
+
c
H j ( y ) H i ( y ) g ( y ) dy
158
E [ Iz (v
where:
m
) z
Z ( x ) ] = E [ IY ( v
) y
y rY ( x ) Y ( x ) ] = 1 G ----------------------- 2 1r
(eq. 9.5-1)
m m
r is the coefficient of change of support for the block v y is the gaussian equivalent of the cut-off z : z = v ( y ) =
n rn Hn ( y )
(eq. 9.5-3)
v denotes the block containing x G is the c.d.f. for the gaussian distribution
E [ Z ( v ) Iz ( v
) z
Z ( x ) ] = E [ v ( Y ( v ) ) IY( v
) y
Y( x ) ]
(eq. 9.5-4)
Once the block ore and metal above cut-off have been calculated at data locations, the same quantities can be estimated by kriging at the target points. It only requires fitting variogram models on both variables.
Technical References
159
The advantage of this method, besides its simplicity, is that it does not require strict stationarity. By using ordinary kriging the attraction towards the mean that occurs in simple kriging is avoided.
160
+
with:
r 2 V V
= r V
for all
(eq. 9.6-1)
K = YV
(eq. 9.6-2)
and:
2 = 1 K r V
(eq. 9.6-3)
Knowing these two values we can derive any confidence interval on the kriged gaussian values from the gaussian density function. For instance, for a 95% confidence level, we have:
K 2 < Y < Y K + 2 } = 95 % Pr { Y V K V V K
(eq. 9.6-4)
which is equivalent for the raw values by using the anamorphosis to:
K 2 ) < ( Y ) < ( Y K + 2 ) } = 95 % Pr { r ( Y V K V r V K
(eq. 9.6-5)
(eq. 9.6-7)
Simulations
Technical References
163
Interpolate / Non-Conditional Simulations / Random Function /Turning Bands Interpolate / Conditional Simulations / Turning Bands
For the theoretical background, the user should refer to Matheron G., The intrinsic random functions and their application (In Adv. App. Prob. Vol.5, pp. 439-468, 1973).
164
10.1 Principle
The Turning Band method is a stereological device designed to reduce a multidimensional simulation to unidimensional ones: if C3 stands for the (polar) covariance to be produced in ficient to simulate a stationary unidimensional random function with X covariance:
, it is suf-
C 1 ( h ) = ---[ rC 3 ( r ) ] r
(eq. 10.1-1)
Technical References
165
Y1 + + Yn Y ( n ) = ----------------------------n
(eq. 10.2-1)
tends to become Multigaussian with covariance C as n becomes very large, according to the Central Limit Theorem. Several algorithms are available to simulate the elementary random functions Yi with a given covariance C. The user will find much more information in Lantujoul C., Geostatistical Simulation (Springer Berlin, 2002. 256p). The choice of the method to generate the random function X is theoretically free. However in Isatis, this or that method will be used preferably to optimize the generation of this or that specific model of covariance. The selection of the method is automatic.
l
Spectral Method The Spectral Method generates a distribution the covariance of which is expressed as the Fourier transform of a positive distribution. This method is rather general and is implemented in Isatis where the covariance is regular at the origin. This is the case for the Gaussian, Cardinal Sine, J-Bessel or Cauchy models of covariance. Any covariance is a positive definite function which can be written as the Fourier transform of a positive spectral measure:
(eq. 10.2-2)
Y(x) =
where:
(eq. 10.2-3)
166
m m l
Dilution Method The Dilution Method generates a numerical function F and partitions into R intervals with constant length. Each interval is randomly valuated with F or -F. This method is suitable to simulate covariances with bounded ranges. In Isatis, it is used to generate Spherical or Cubic models of covariance. When the covariance corresponds to a geometrical covariogram i.e.:
(eq. 10.2-4)
(eq. 10.2-5)
where:
m m m l
Migration Method The Migration Method generates a Poisson process that partitions into R independent exponential intervals which are valuated accordingly to the model of covariance to be simulated. In Isatis it is used for:
m
the exponential model: each interval is split into two halves which are alternatively valuated with +1 and -1; the Stable and Gamma models: the intervals are valuated accordingly to an exponential law; the generalized Covariance models: the intervals are valuated with the sum of gaussian processes.
m m
The simulation of the covariance is then obtained by summation with projection of the simulations on a given number of lines of the covariance . Each line is called in fact "turning band" and the problem of the optimal count of Turning Bands remains, although Ch. Lantuejoul provides some hints in Lantujoul C., Non Conditional Simulation of Stationary Isotropic Multigaussian Random Functions (In M. Armstrong & P.A. Dowd eds., Geostatistical Simulations, Kluwer Dordrecht, 1994, pp.147-167).
Technical References
167
168
10.3 Conditioning
If we consider the kriging estimation of Z(x) using the value of the variable at the data points z ( x ) , in each point, we can write the following decomposition: Z(x) = Z(x)K + [Z(x) - Z(x)K]
(eq. 10.3-1)
In the Gaussian framework, the residual [Z(x)-Z(x)K] is not correlated with any data value. It is therefore independent from any linear combination of these data values, such as the kriging estimate. Finally the estimate and the residual are two independent random functions, not necessarily stationary: for example at a data point, the residual is zero. If we consider a non-conditional simulation Zs(x) of the same random function, known over the whole domain of interest and its kriging estimation based on the value of this simulation at the data points, we can write similarly: ZSC(x) = Z(x)K + [ZS(x) - ZS(x)K] where estimate and residual are independent, with the same structure. By combining the simulated residual to the initial kriging estimation, we obtain: ZSC(x) = ZS(x) + [Z(x) - ZS(x)K]
(eq. 10.3-3) (eq. 10.3-2)
which is another random function, conditional this time as it honors the data values at the data points.
Note - This conditioning method is not concerned about how the non-conditional simulation Zs(x)
has been obtained. As non correlation is equivalent to independence in the gaussian context, a simulation of a gaussian random function with nested structures can be obtained by adding independent simulations of the elementary structures. For the same reason, combining linearly independent gaussian random functions with elementary structures gives, under a linear model of coregionalization, a multivariate simulation of different variables.
Technical References
169
Interpolate / Non-Conditional Simulations / Random Function / Truncated Gaussian Interpolate / Conditional Simulations / Truncated Gaussian
This model could be considered as a discrete version of the multigaussian one, for more theoretical explanations, the user should refer to Galli A. et al., The Pros and Cons of the Truncated Gaussian Method (In Geostatistical Simulations, M. Armstrong & P.A. Dowd eds, Kluwer, p 217, 1994). The simulation method must produce a discrete variable (each value represents lithofacies) and be controlled by a limited number of parameters that can be inferred from the usual data available (core drills). The leading idea comes from the two following observations:
m
The lithofacies constitute a partition of the space: at a given point (cell of a grid) we may only have one lithofacies. The different lithofacies can be ordered: for example using the quantity of clay as a criterion, which in fact, characterizes the quality of the reservoir. The Spatial Distribution of these lithofacies is different in the horizontal and in the vertical: along the vertical axis, it reproduces the sedimental process. Whereas, horizontally, it characterizes the homogeneity of the field.
If we consider a continuous random function Y(X) and in the case of two lithofacies A and its complementary A, we can write that:
x A Y ( x ) Sa x A Y ( x ) > Sa
(eq. 11.0-1)
(eq. 11.0-2)
where Sa is the threshold corresponding to the gaussian transform of the proportion pa of the facies A : pa = G(Sa), G : being the cumulated density function of a gaussian distribution.
170
The thresholds are derived from the proportion of the different facies. The problem is to find the gaussian random variable Y which corresponds to the indicators of the different facies that we observe at the data points. When this random variable is found, we must simply truncate the gaussian values to the thresholds that characterize each facies, to obtain the simulation. Unfortunately the transformation which goes from the indicator of a facies to the gaussian value is not bijective. Therefore, we cannot convert each facies at the data point into its gaussian equivalent. On the other hand, we can derive the covariance of the truncated gaussian ( h ) from the covariance of the indicators of the different facies CA(h). In the case of two facies, we have:
H2 n 1 (S) n - (h) C A ( h ) = g ( s a ) 2 --------------------n ! 1
(eq. 11.0-3)
where:
l l l
g is the Gauss density function Hn is the Hermite polynomial or order n Sa is the threshold for the facies A
Therefore we can fit the underlying covariance ( h ) through its impact in the covariance of the indicator of the facies A. For the domain of application of the Truncated Gaussian Method (fluvio deltac environment) where the behavior along the vertical and the horizontal is quite different, we have chosen a factorized covariance for ( h ) :
( h x, h z ) = x ( h x ) z ( hz )
(eq. 11.0-4)
It expresses that, knowing the value of the gaussian variable at a point P, there is independence between:
l l
the points belonging to the horizontal plane which contains P, the points belonging to the vertical line which contains P.
Moreover, the choice of exponential basic structures for both x and z yields to interesting screen effect properties which drastically improve the time consumption of the algorithm. The Conditional Simulation is finally performed using the random function Y(x) characterized by
( h ) its structure , and such that at a data point where the facies is known, the value of the gauss-
Technical References
171
ian variable must respect the thresholds that correspond to this facies. Finally, the gaussian realization is converted back into facies by truncation. Implementation:
l l
172
Technical References
173
12 Plurigaussian Simulations
Add-on to the On-Line Help for: Interpolate / Conditional Simulations / Plurigaussian. This documentation is meant to explain the technical procedure involved in the Plurigaussian simulations. It partly refers to Armstrong M., Galli A., Le Loc'h G., Geffroy F., Eschard R, Plurigaussian Simulations in Geosciences, Springer Berlin, 2003. 149p).
174
Plurigaussian Simulations
12.1 Principle
The principle of the categorical simulations is to obtain a variable on a set of target locations (usually the nodes of a regular grid), each category being represented by an integer value called lithotype. With no restriction, we will consider that the lithotype values are the consecutive integers ranging from 1 to NLIT (where NLIT stands for the number of lithotypes to be simulated). One plurigaussian simulation is obtained as the posterior coding of the combination of several underlying stationary Gaussian Random Functions (GRF). In Isatis, the number of these GRF is limited to 2 (denoted Y1 and Y2) and characterized by their individual structure. These two GRF are usually independent but they can also be correlated (with a correlation coefficient the following scheme. Let W1 and W2 be two independent GRF, then we set:
) according to
Y1 = W1 Y2 = W1 + 1 2 W2
(eq. 12.1-1)
(eq. 12.1-2)
In the rest of this chapter, we will consider (except when stated explicitly) that the two GRF are independent. The different lithotypes constitute a partition of the 2D gaussian space. Each lithotype (denoted Fi ) is attached to a domain
Di :
x Fi ( Y 1 ( x ), Y 2 ( x ) ) D i
(eq. 12.1-3)
In Isatis we have decided to realize a partition of the 2D gaussian space into rectangles with sides parallel to the main axes. The projections of these rectangles on the gaussian axes define the thresholds attached to each lithotype and each GRF (denoted t ji and s ji respectively for the lower and upper bounds of the GRF "j" for the lithotype "i"). Therefore the previous proposition can be stated as:
i t i Y1 ( x ) s1 x Fi 1 i Y (x) s i t2 2 2
(eq. 12.1-4)
The 2D gaussian space, with a rectangle representing each lithotype, is usually referred to as the lithotype rule and corresponds to the next figure (7 lithotypes example):
Technical References
175
(fig. 12.1-1)
i , s i , t i , s i are related to the proportions of the For each lithotype, the thresholds on both GRF t 1 1 2 2
lithotypes:
i si s1 2
P F ( x ) = E [ 1 F ( x ) ] = P [ ( Y 1 ( x ), Y 2 ( x ) ) D i ] =
i i
g ( u, v ) du dv t t
i i 1 2 (eq. 12.1-5)
where g ( u, v ) is the bivariate gaussian density function with 0. mean, variance 1., and relation matrix:
as cor-
= 1 1
When the correlation between the two GRF is 0., the previous equation can be factorized:
i i s1 s2 i ) G( t i )) (G(s i ) G(t i ) ) P F ( x ) = g ( u ) du g ( v ) dv = ( G ( s 1 1 2 2 i i i t t 1 2
(eq. 12.1-6)
(eq. 12.1-7)
In the non-stationary case, the only difference is that the thresholds are not constant anymore. Instead they vary as a function of the target point. For example, a point "x" belongs to the lithotype Fi if:
176
Plurigaussian Simulations
(eq. 12.1-8)
Technical References
177
12.2 Variography
We assume at this stage that the proportions of each lithotype are unknown at any point in space and that the lithotype rule is chosen. We must now determine the structure of the two GRF by trial and error, comparing the experimental variograms to their expressions in the model. For the experimental quantities, we can compute all the simple variograms of the indicators for all lithotypes:
1 F ( x, x + h ) = -----i 2N
as well as the cross-variograms:
x x
[ 1F ( x ) 1F ( x ) ]2
=h i i (eq. 12.2-1)
1 F , F ( x, x + h ) = -----i j 2N
x x =h
[ 1F ( x ) 1F ( x ) ] [ 1F ( x ) 1F ( x ) ]
i i j j (eq. 12.2-2)
In general, the previous expressions are not allowed as the function is not stationary nor ergodic. However, as the underlying GRF are stationary, we will still use the previous equations. In order to match the expression of the experimental simple variogram, we can write the simple variogram model expression as follows:
1 - Var [ 1 F ( x ) 1 F ( x + h ) ] = 1 -- E [ 1F ( x ) 1F ( x + h ) ] 2 F ( x, x + h ) = -i i i i i 2 2
which expands as follows:
(eq. 12.2-3)
F ( x, x + h ) =
i
1 -- { E [ 1F ( x ) ] + E [ 1F ( x + h ) ] 2 E [ 1F ( x ) 1 F ( x + h ) ] } = i i i i 2
i (x) si (x) s i ( x + h) s i (x + h) s1 2 1 2 1 -- PF ( x ) + PF ( x + h ) 2 g ( u 1, u 2, v 1, v 2 ) du 1 du 2 dv 1 dv2 i 2 i i (x) t i (x) t i (x + h) t i ( x + h) t1 2 1 2
(eq. 12.2-4)
178
Plurigaussian Simulations
1 =
C1 ( h ) C1 ( h )
C1( h ) C2( h )
1
C1( h ) C1( h )
1
(eq. 12.2-5)
C1 ( h ) C2 ( h )
introducing the covariance values of the underlying GRF at distance h: the cross-variogram can be written:
C 1 ( h ), C 2 ( h ) . Similarly,
1 - E { [ 1F ( x ) 1F ( x + h ) ] [ 1F ( x ) 1F ( x + h ) ] } F , F ( x, x + h ) = -i j
(eq. 12.2-6)
which expands as follows because we cannot have different lithotypes at the same point:
- { E [ 1 F ( x ) 1F ( x + h ) ] + E [ 1 F ( x ) 1 F ( x + h ) ] } F , F ( x, x + h ) = -i j i i j j
1 2
(eq. 12.2-7)
and:
F , F ( x, x + h ) =
i j
i i j j s1 ( x ) s2 ( x ) s1 ( x + h ) s2 ( x + h )
i ( x + h) s i (x + h) sj (x) s j ( x) s1 1 2 2
g ( u 1, u 2, v 1, v 2 ) du 1 du 2 dv 1 dv 2 i ( x + h) t i ( x + h ) t j ( x ) t j ( x) t1 2 1 2
(eq. 12.2-8)
Technical References
179
i si si si s1 2 1 2
Stat ( h ) = P F F
i i
Stat ( h ) = F
i
12.2.2 Optimization
Both simple and cross-variograms use the same quadruple gaussian integral I:
i (x) si (x) sj (x + h) s j (x + h) s1 2 1 2
I( h) =
g ( u 1, u 2, v 1, v 2 ) du 1 du 2 dv 1 dv 2
This quantity can be optimized according to the calculation environment. We can interchange the integrals and rewrite the previous formula:
i (x) sj (x + h) s j (x) s j (x + h) s1 2 1 2
I( h) =
g ( u 1, u 2, v 1, v 2 ) du 1 du 2 dv 1 dv 2
(eq. 12.2-2)
i (x) j t1 t (x + h) t i (x) t j ( x + h) 1 2 2
i (x) s j (x + h) j (x) sj (x + h) s1 s2 1 2 I( h) = g ( u, v ) du dv g ( u, v ) du dv 1 2 i i j (x + h) j ( x + h) t ( x ) t t ( x ) t 1 1 2 2
(eq. 12.2-3)
with:
180
Plurigaussian Simulations
1 =
1 C1( h )
C1 ( h ) 1
and
2 =
1 C2( h )
C2 ( h ) 1
(eq. 12.2-4)
Similarly, each integral can be optimized in the case where C1(h) or C2(h) is null. For example:
i (x) sj (x + h) s1 1 j ( x + h) i (x) s1 s1 g ( u, v ) du dv = g ( u ) du g ( u ) du 1 i (x) t j (x + h) t1 i (x) j ( x + h) 1 t1 t 1
(eq. 12.2-5)
and each integral can be calculated directly using the Gauss integral function :
i ( x) s1
i ( x) ) G(t i ( x) ) g ( u ) du = G ( s 1 1
12.2.3 Calculations
This factorization is crucial as far as the CPU time is concerned: the 4 terms integral is approximately 100 times more expensive than twice the 2 terms integral. As one can easily check, in the non-stationary case, the model of the simple and cross-variograms can only be calculated at the data points, as we need to know the thresholds for the integral of the gaussian multivariate density. This explains the technique used in the structural analysis of the plurigaussian model: for each pair of data points, we calculate simultaneously the experimental variogram and the model. These two quantities are then regrouped by multiples of the lags and represented graphically.
Technical References
181
12.3 Simulation
The plurigaussian simulation consists in simulating two independent random functions and to code their "product" into lithotypes, according to the lithotype rule. When the two GRF are correlated, we can still work with independent primary GRF and combine them afterwards as described earlier. When running conditional simulations, we must convert the lithotypes into values in the gaussian scale beforehand. This involves an iterative technique known as the Gibbs sampler. We will now describe this method for a set of lithotypes data (say "N") in the case of non-correlated GRF. We will focus on one GRF in particular. We first initialize two vectors of gaussian values
min, g max ] corresponding to the given lithotype for the first GRF at the data points. Obviously [ g
the bounds of the interval depend on the values of the proportions at this location:
min Y g max Y g
(eq. 12.3-1)
These values belong to the correct gaussian intervals (by construction) but are not correct with respect to their covariance. The next steps are meant to fulfill this covariance requirement while keeping the constraints on the intervals. We then enter in an iterative process where the following operations are performed:
l
Select one of the data points. Discard this data and krige its estimate
Y =
of this estimation.
(eq. 12.3-2)
If the two GRF are correlated the interval of the third step becomes:
182
Plurigaussian Simulations
(eq. 12.3-3)
This iterative procedure requires the process to be stopped. In Isatis the number of iterations is fixed by the user. When the gaussian values are defined at the conditioning data points, the rest of the process is standard. We must first perform the conditional simulations of two independent GRF. Then at each grid node their outcomes are combined according to the lithotype rule in order to produce lithotype information.
Technical References
183
12.4 Implementation
The Gibbs sampler is the difficulty of the algorithm. In theory, it requires all the information to be taken into account simultaneously (unique neighborhood). This constraint rapidly becomes intractable when the number of data is too large. However there is a strong advantage in considering a unique neighborhood. As a matter of fact, the covariance matrix CN can be established and inverted once for all (for the N data locations). The inverse of the kriging matrix
1 can be easily derived from C 1 and the estimation is then CN 1 N
reduced to a simple scalar product. In Isatis we decided to run the Gibbs sampler in two steps:
l
We first consider each well/line individually. The iterative process is performed several times on the data along this well before the next well is tackled. When the number of data along one line is too large (more than 400 points), the well/line is subdivided into several pieces using a moving window (of 400 points). The starting 400 samples are processed first, then the window is moved by 200 samples further before the iterative process is performed again. The window is moved until all the data have been processed. As the wells/lines are mainly vertical, this first step ensures that the vertical behavior of the covariance is fulfilled.
In order to reproduce the horizontal behavior of the covariance, we must now run the Gibbs sampler in a more isotropic way. This is achieved by selecting in a standard Isatis neighborhood a set of points around the first data point. The Gibbs iterations are performed on this subset of points and then the program selects another subset around the second point and so on until all the data points have been the center of a subset.
In Isatis the numbers of iterations for the two steps may be different and are given by the user.
184
Plurigaussian Simulations
185
IMPALA (Developed by Ephesia Consulting) stands for Improved Multiple-point Parallel Algorithm using a List Approach, this is a new and high performance parallelized algorithm that performs Multiple-Point Statistics simulations. The use of lists results in fewer RAM requirement compared to tree-based algorithms. The Multiple-Point Statistics simulation technique is used to simulate a categorical variable through the simulation of a pattern. It tends to reproduce the proportions, the relationships between facies and the geobodies, from the training image.
defines the data event at u. Note that a data event with undefined components (for nodes which are not yet simulated) can be considered. To attribute a facies at a node u in the simulation grid, we retain the nodes v in the training image (TI) where the data event d(v) has the same components as those of d(u). Then the occurrence of all the facies at the nodes v are counted. This provides a probability distribution function (pdf) that ca be used to draw a facies at the node u randomly. More precisely, if the positions of the know components in d(u) are i1 <im (with 0 m N) then the probability to draw the facies k in the node u is:
186
(eq. 13.4-3)
For 0 k<M, where M is the number of facies. Note that if the number of matching data events is too small (less than min replicates parameters, see Imapala's mps help page). We consider the last component in d(u) as undefined (the last informed node is dropped) and we repeat this operation until this number is acceptable. In addition, the multigrid approach is used to capture structures within the training image that are defined at different scales. Let us introduce some terminology. A isatis grid file is a box shaped set of pixels as:
(eq. 13.4-4)
Where Nx, Ny, Nz are the dimensions in the x axis, y axis (and z axis) direction respectively. In the main grid G, the Ith subgrid is defined as:
(eq. 13.4-5)
From the original search template t(u) and data event d(u), define the search template
(eq. 13.4-6)
(eq. 13.4-7)
Where the lag vectors are magnified according to the scale of the subgrid SGi. Then, the simulation proceeds successively with the simulation of all the nodes in the multigrid Gm-1, using the search template tm-1. The process continues with the nodes in the multigrid Gm-2, using the search template tm-2 and repeats for all the multigrid levels (in decreasing order) similarly. The simulation starts with the coarsest multigrid level and finishes with the finest one.
187
and c= (c0, ,cM-1) is a list of occurrence counter for each facies: ci is the number of data events d(v) equal to d found in the training image with facies i at the reference node v. Such a list is a catalogue that allows to compute pdf to perform simulations. The training image is scanned once moving the search template to build the list and it is not used any more. The training image is scanned on all the nodes such the search template is entirely included in the training image.
l
The pdf used to draw a facies in a node u of the simulation grid is computed from the list. The formula is used and a minimal number of replicates, Cmin, is given. Assume that the simulated node in the data event centered at u, d(u), are u +hi1,, u + hin and let d(j)(u) be the data event whose defined components are s(h+hi1),, s(h+hij) (only the first j simulated nodes in d(u) are taken in account), 1 j n. for 1 j n and O k M, let C(j)k be the number of nodes v in the training image with facies k such that the data event centered at v, d(v), is compatible with d(j)(u) (i.e s(v +hil), 1 l j). Then the greatest index j such that the number of replicates greater or equals to Cmin and the corresponding pdf: is
(eq. 13.4-8)
(fig. 13.4-1)
188
(fig. 13.4-2)
For each conditioning data, the attributed facies is assigned to the node in the simulation grid whose corresponding region contains the point of data. (If more than one conditioning data lead to the same node location, we retain only the conditioning data whose the point is the closest to the center of the corresponding region.) Each conditioning node Uc in G obtained by the step above is spread in the subgrid SG1 as follows: - We select all the closest nodes in the subgrid SG1 to Uc i.e the nodes in SG1 that realize the minimum minucsg1.... where d is the dimension (2 or 3) and u(j) (resp. Uc (j)) are the integer coordinates in G of the node U (resp. Uc). - If all the selected nodes are unsimulated, we choose one randomly and simulate a facies for this chosen node using the search template t0, corresponding to the scale of the subgrid SG0. Otherwise, nothing is done (no need to spread this data).
The previous step is repeated for the subgrids SG2,...,SGm-1 successively: the conditioning nodes in G obtained in the first step are spread in the subgrid SGi using the search template ti-1 corresponding to the scale of the subgrid SGi-1.
The simulation continues with the simulation of all the unsimulated nodes in the multigrid Gm-1, Gm-2,...,G0 successively.
189
(fig. 13.4-3)
(fig. 13.4-3): (a) The position of the conditioning data is presented (encircled). (b) The gray scale represents the index of the node in the path; the gray scale goes from 0 (white) to 49999 (black). The multiple point statistics simulation described above is valid for stationary training images, because spatial pattern (pixels configuration) according to a search template are stored (in a list) regardless their location in the training image. However, IMAPALAs mps allows to use non stationary training images. In this case, auxiliary variable is used to describe the non stationarity. The use of non stationary training image TI (containing facies, primary variable) requires one auxiliary variables which must be exhaustively know in the simulation grid to guide the simulation. Below, the method is presented for one auxiliary variable t and the associated maos are called TIaux and Gaux for the training image TI and the simulation G respectively. In presence of an auxiliary variable, a vector m is appended to each element of the list. An element of the list is then a triplet of vectors (d,c,m) where d = (s1,...,sN) defines a data event, c = (c0,...,cM-
190
1)
is a list of occurrence counters for each facies and m = (m0,..., mM-1) is a list of means for the auxiliary variable: ci is the number of data events d(v) equal to d found in the training image with facies i at the reference node v and mi is the mean f the auxiliary variable at these nodes v.
Before starting the simulation and building the list, the auxiliary variable, say t, is normalized in the interval [0,1], via the linear transformation [a,b] to [0,1], t=(t-a)/(b-a), where a and b are respectively the minimum and the maximum of the auxiliary variable t(v), v in TIaux U Gaux. To simulate a facies in a node u of the grid G, knowing the data event d(u) and the auxiliary variable t(u) (provided from the auxiliary grid Gaux), the following is done. A tolerance error u between 0 and 1 is fixed. For each facies k, the set Ek of the elements in the list that are compatible with the data event d(u) and that satisfy:
(eq. 13.4-9)
are retrained. Then, the sum Ck of the occurrence counter Ck of the elements of Ek and the resulting mean Mk for the auxiliary variable are computed:
(eq. 13.4-10)
where the exponent (e) denotes the corresponding element in the list. The resulting means are used to penalize the counters. For each facies k, the penalized counter is defined as
(eq. 13.4-11)
Then the conditional pdf knowing the date event d(u) and the auxiliary variable t(u), used to draw the facies in the node u, is given by:
(eq. 13.4-12)
where :
191
(eq. 13.4-13)
In summary, the presence of an auxiliary variable adds a step of selection and a step of penalization for retrieving the conditional pdf.
(eq. 13.4-14)
- The probability for the facies k retrieved from the multiple point statistics as described above:
(eq. 13.4-15)
- The marginal probability for facies k (proportion of facies k) retrieved from the training image:
(eq. 13.4-16)
The the pdf used to draw the facies at the node u is given by the probabilities (Bordley 1982)
(eq. 13.4-17)
192
(eq. 13.4-18)
is a constant normalization and mp, 1, ..., n the weight in the Bordleys formula (see bordley 1982) for the pdf provided by the multiple point statistics and the soft pdf(s) respectively. The weight 0 is set to 0 =1 mp1...n. A soft probability can be global, i.e. the same one is used for all nodes, or local, i.e given for each node independently.
Technical References
193
14 Fractal Simulations
This page constitutes an add-on to the Users Guide for Interpolate / Non-Conditional Simulations / Random Functions / Fractals. For more information concerning the Fractal Model, please refer to Peitgen H.O., Saupe D., Barnsley M.F., The Science of Fractal Images (Springer N.Y., 1998).
194
Fractal Simulations
14.1 Principle
A fractional Brownian motion VH(t) is a single valued function of one variable time), such that its increments have a Gaussian distribution with variance:
t (referred to as the
(eq. 14.1-1)
E [ V H ( t 2 ) VH ( t1 ) ] 2 = k t 2 t 1 2H
with
0<H<1
Such a function is continuous, self-affine, stationary and isotropic. When H is close to zero, the behavior of the trajectories of VH(t) is rough whereas it becomes smoother when
H increases.
n , which
The value of H = 1/2 corresponds to the traditional Brownian notion. This formalism can be easily extended to provide a self-affine fractional Brownian in a satisfies the general scaling relation:
E [ VH ( x2 ) VH ( x1 ) ] = k x2 x1
and has a fractal dimension:
2H
(eq. 14.1-2)
D = n+1H
k represents a positive constant that we assimilate to a variance and denote as paragraph.
(eq. 14.1-3)
Fractals come in two major variations. Some are composed of several scaled down and rotated copies of itself such as the well-known Von Kock snowflake, or the Julia sets where the whole set can be obtained by applying a non linear iterated map to an arbitrarily small section of it. These are called the deterministic fractals. Their generation simply requires the use of a particular mapping or rule which then is repeated over and over in a usually recursive scheme. We can also include an additional element of randomness allowing the simulation of random fractals. Given the fact that fractals have infinite details at all scales, a complete computation of fractal is clearly impossible. Instead it is sufficient to approximate these computations down to a precision which matches the size of the pixels of the grid that we wish to simulate. Several simulation algorithms are used. These algorithms will be briefly described in 1 dimension ; they are usually extended to higher dimensions without any major problem.
Technical References
195
2 .
We then set the value of X(1/2) plus some Gaussian random offset D1 with mean 0 and variance
2 . We can then write the increment: 1
1 - X ( 0 ) = 1 -- [ X ( 1 ) X ( 0 ) ] + D1 X - 2 2
which has a zero mean and a variance
(eq. 14.2-1)
1 2 - X ( 0 ) = 1 -- 2 + 1 Var X - 2 4
(eq. 14.2-2)
1 2 = 1 -- 2 + 1 -- 2 4 2
Therefore:
2 = 1 -- 2 1
(eq. 14.2-3)
(eq. 14.2-4)
196
Fractal Simulations
The additional parameter r will change the appearance of the fractal: it is called the lacunarity. Following the ideas for the midpoint displacement method, we set X(0) = 0 and X(1) as a sample of a gaussian variable with mean 0 and variance before that:
2 = 1 -- ( 1 r2 2H ) ( rn )2H 2 n 2
(eq. 14.3-1)
Technical References
197
F(f) =
and the spectral density of
0 X ( t ) e2iftdt
(eq. 14.4-1)
is:
1 - F( f) 2 S ( f ) = lim -TT
(eq. 14.4-2)
In general, a process X(t) with a spectral density proportional to f corresponds to a fractional Brownian motion with:
1 H = ----------2
(eq. 14.4-3)
For practical algorithm we have to translate the above into conditions on the coefficients ak of the discrete Fourier transform.
N1 k =0
X(t) =
ak e 2 ikt
(eq. 14.4-4)
The conditions to be imposed on the coefficients in order to obtain that S(f) is proportional to f , now becomes:
E ( a k 2 ) proportional to k
This relation holds for 0 < k < N/2 and, for tion.
(eq. 14.4-5)
The method thus simply consists of randomly choosing coefficients subject to the condition on their expectation and then computing the inverse Fourier transform to obtain X in the time domain. In contrast to the previous algorithms, this method is not iterative and does not proceed in stages of increasing spatial resolution. We may, however, interpret the addition of more and more Fourier
198
Fractal Simulations
coefficients ak as a process of adding higher frequencies, thus increasing the resolution in the frequency domain.
Technical References
199
15 Annealing Simulations
This page constitutes an add-on to the Users Guide for Interpolate/Conditional Simulations/ Annealing Simulations
Note - This method cannot be actually considered as simulations in the usual sense, as it is meant
to transform an input realization according to several criteria. The Annealing procedure is similar to the Auto Regressive Deterministic one except that it does not require any model and that the result is a discrete variable. The data points are migrated at the nodes of the grid in order to improve the performances of the methods. If several data points are migrated to the same node, the closest one prevails: the remaining ones are simply ignored. It requires the definition of several cutoff intervals which must realize a partition of R If some intervals overlap the results are unpredictable. Each cutoff interval corresponds to facies, numbered starting from 1. The procedure starts with an Initial Image which is internally converted into facies. It requires a Training Image, which will be internally converted into facies, and which will be used to derive the statistics concerning the proportions and the transitions: they will serve as references. The principle is to modify iteratively a non conditioning pixel from its current facies value to another facies value, in order to reduce the gap between experimental quantities and the reference. These quantities are:
l
the transition probabilities between the different facies, for several steps defined by the three increments expressed in terms of grid meshes. the proportion for each facies.
For each grid node, the principle is to establish the energy of the current image.
2E + 2E = p p
(eq. 15.0-1)
200
Annealing Simulations
where 2 designates the weight, E the normalized energy and the indices of the indicators and the proportions.
and
p the variograms
The weights are used to increase or to reduce the relative influence of each component in the calculation of the energy. When calculating these transition probabilities, the procedure makes a distinction whether the quantities are:
l l
constrained: if one of two points coincides with a data points, unconstrained: if none of the two points is a data point.
where:
l l
the indices c and nc respectively refer to the constrained and unconstrained statistics.
E integrates the difference between the experimental transition and the ref s ts E = k ( t ij ij ) s i, j
(eq. 15.0-3)
where:
l
s is the transition probability from facies i to facies j at the step s, t ij s t ij is the corresponding reference value,
k is a normation value which considers the number of steps and the number of transitions. E p is calculated along the main directions of the grid so as to capture
Technical References
201
where:
l l
e x indicates if the grid has an extension in the x direction (1 for true ; 0 otherwise),
p ix is the proportion of facies integrated over the pile of cells located at , whatever their or
indices,
x is the corresponding reference value, p i N xyz is the total number of cells, d measures the dimension of the grid: ( d = ex + ey + ez )
(eq. 15.0-5)
The global process consists in iterating, following a random path on each one of the grid nodes which are not constrained by a data information. If we denote by f n the value of a facies drawn at random and different from f 0 , and by e 0 and e n the corresponding energies, the Metropolis algorithm gives the following substitution rule:
l
if if
e n e 0 we substitute f n to f 0 , e n > e 0 we substitute f n to f 0 with the probability p and we keep f 0 with the probability
1 p. p incorporates the difference of energy and the temperature of the system (monotonous function decreasing with the duration of the process) though the following equation: ( e n e 0 ) ----------------------p = exp kT
where
(eq. 15.0-6)
Instead of the temperature function, we ask the user to specify a maximum number of iteration
202
Annealing Simulations
(eq. 15.0-7)
This method has been proven to converge towards the minimum energy state if the cooling speed (ruled by the Boltzmann's constant) is small enough.
Technical References
203
This page constitutes an add-on to the On-Line Help for: Tools / Spill Point
204
16.1 Introduction
In Oil & Gas applications, the spill point calculation enables the user to delineate a potential reservoir knowing that some control points are inside or outside the reservoir. For the illustration of this feature, we will consider one map (which may be one of the outcomes of a simulation process) where the variable is the topography of the top of a reservoir. We will consider the depth as counted positively downwards: the top of the structure corresponds to the lowest value in the field. Moreover, we assume that we have a collection of control points whose locations are known and which belong to one of the following two categories:
l l
the control point belongs to the reservoir: inside, the control point does not belong to the reservoir: outside.
Note - All the points located outside the frame where the image is defined are considered as
outside.
Technical References
205
(fig. 16.2-1)
The Spill Point corresponds to the location of the saddle below volumes A and B. As a matter of fact, if we consider a deeper spill, these two volumes will connect and the constraints induced by the control points will not be fulfilled any more as the same location cannot be simultaneously inside and outside the reservoir. The volume A is considered as outside whereas B is inside. An interesting feature comes from the volumes C1 and C2:
l
they are first connected (as elevation of the separation saddle is located above the spill point) and therefore constitute a single volume C, the contents of this volume C is unknown.
Hence, after the spill point elevation has been calculated, each point in the frame can only correspond to one of the following four status:
l l l l
below the spill point, above the spill point and inside the reservoir, above the spill point and outside the reservoir, above the spill point in an unknown volume.
206
(fig. 16.3-1)
The new spill point is shifted upwards as otherwise the maximum reservoir thickness constraint would be violated. Note that, the Spill elevation is clearly known whereas the location of the Spill Point is rather arbitrary this time. It is the last point that may be included in the reservoir: if the next one (sorted by increasing depth) was included, the thickness of the reservoir would overpass the maximum admissible value.
Technical References
207
208
(fig. 16.5-1)
Let us now consider the opposite case where the outside control point is at the top of the structure and the inside control point is on the flank. In principle, the situation should be symmetric with the same result for the elevation of the Spill. But if we consider the volume of the reservoir now: the volume of the reservoir controlled by the inside control point and located above the spill has its volume reduced to zero. That is the reason why such a map is considered as not acceptable.
(fig. 16.5-2)
Technical References
209
(fig. 16.6-1)
The volume A is considered outside and B inside the reservoir. The volumes C and D are initially unknown. If we convert them into inside, the maximum reservoir thickness constraint will not be fulfilled any more for the volume C. We could imagine to move the spill upwards until the constraint is satisfied, but then we should also move the Spill Point in a new location. Instead, we have considered that such a map should rather be considered as not acceptable.
210
211
212
Let: - v be the generic selection block (SMU), - Z(v) its true grade, - and Z(v)* its ultimate estimate,
The recoverable resources above cutoff grade z, to be estimated, are: - the ore T(z) =
1Z ( v )* z
Z (v)1Z ( v )* z
the block anamorphosis: Z (v) = r (Yv ) from the sample point anamorphosis
Z ( x) = (Y ( x))
r ( y) = (ry + 1 r 2 u) g (u ) du
(this expresses Cartiers relation E Z ( x)| Z (v) = Z (v) for a point random in a block)
m
(eq. 17.7-1)
Z (v)* = s (Yv* )
1
, with weights
summming to 1 and
the correlaion
and
Yv*
213
(eq. 17.7-2)
The idea is to impose the panel grade, estimated for instance by Ordinary Kriging, in order to avoid the attraction to the mean that may be caused by some techniques in case of deviation from stationarity. The estimation of the metal at 0 cutoff must then satisfy the relation: E[Z(v) | Z(V)*] = Z(V)* This fundamental relation has several important consequences:
m
The panel grade estimate Z(V)* is implicitly assumed to be conditionally unbiased: E[Z(V) | Z(V)*] = Z(V)*.
Note that, having no conditional bias, Z(V)* cannot take negative values (as may be caused, in kriging, by negative weights). Negative values will anyway not be supported by the coming anamorphosis.
m
The Gaussian anamorphosis of Z(V)* is necessarily of the same form as that of Z(v). Let:
Z ( x) = (Y ( x))
Z (v) = r (Yv )
(eq. 17.7-4)
(eq. 17.7-5)
Z (V )* = (YV * )
(eq. 17.7-6)
214
where Y(x), Yv and YV* are standard Gaussian variables. The fundamental relation gives:
(eq. 17.7-7)
= r corl (Yv , YV * )
Hence the anamorphosis of Z(V)* is inherited from this of Z(v). This holds whatever the estimate, not only for linear combinations of Z sample values. In pratice S is obtained from the panel estimation and the previous relation will be used to compute:
corl (Yv , YV * ) = vV * = S r
(eq. 17.7-8)
from r and S.
E [ Z (v)| Z (V )*] = E E [ Z (v)| Z (v)*, Z (V )*] | Z (V )* = E E [ Z (v)| Z (v)*] | Z (V )* = E rvv* (Yv* )| YV * = rvv*v*V* (YV * ) = Z (V )* = S (YV * )
assuming that Z(v) and Z(V)* can be considered independent, conditionally on Z(v)*, that is:
(eq. 17.7-9)
vV * = vv* v*V * =
S r
(eq. 17.7-10)
v*V * =
vV * S = vv* r vv*
(eq. 17.7-11)
215
E [Q2 ( z )] = E Z 2 (v)1Z1 (v )* z = E 1Z1 ( v)* z E [ Z 2 (v)| Z1 (v)*] = E 1Y1v* y E ( 2, r2 (Y2v | Y1v* )) = E 1Y1v* y 2, r2 1v*2 v (Y1v* )) = 2, r2 1v*2 v ( u ) g (u ) du
y
(eq. 17.7-12)
It requires:
m m
the anamorphosis of Z2(v), with change of support coefficient r2; the correlation between the gaussian and .
Assuming that
Y1v*
and
Y2 v
1v*2v = 1v1v*1v 2v
17.7.2.4 Bivariate Uniform Conditioning
(eq. 17.7-13)
Bivariate UC consists in estimating the recoverable resources in panel V from the sole vector (Z1(V)*,Z2(V)*). The problem is simplified, however, by assuming that:
Z1 (v) and Z1 (v)* are conditional on Z1 (V )* , independent from the auxiliary metal panel grade, so that
the UC estimates for the selection variable correspond to the univariate case. It results that:
(eq. 17.7-14)
216
Z 2 (V )* is implicitly assumed to be conditionally unbiased. As a consequence it should not take negative values, as may be caused in kriging or cokriging by negative weights. Negative values will anyway not be supported by the coming anamorphosis.
Z 2 (v )
(this holds
denoting :
(eq. 17.7-17)
In practice S2 is obtained from the panel estimation Z2(V)*, and the previous relation will be used to get:
S2 r2
(eq. 17.7-18)
Since Z2(v) and Z1(V)* are considered independent, conditional on Z2(V)*, we have:
i.e.
217
(eq. 17.7-20)
By symmetry between the metals, we can assume Z1(v) and Z2(V)* independent, conditional on Z1(V)*, that is:
(eq. 17.7-21)
We will finally assume that Z1(v)* and Z2(V)* are independent, conditional on Z1(V)*, that is:
(eq. 17.7-22)
218
with change of support coefficient r, deduced from through the integral relation :
r ( y) = (ry + 1 r 2 u) g (u ) du
(this expresses Cartiers relation E [ Z ( x) | Z (v)] = Z (v) for a point random in a block)
(eq. 17.8-1)
The model is also characterized by the relationships between block covariances and point covariances, i.e.: - Cov[Yv(x), Yv(x+h)] represents the covariance between any pair of blocks v(x) and v(x+h). - The point-block covariance and the point covariance can be shown to be: - The point-point covariance is then : Cov[Y(x), Y(x+h))] = r Cov[Y(x), Yv(x+h)] = r Cov[Yv(x), Yv(x+h)], with x within vi and x+h within vj , - except for a point and itself (h=0) where Cov[Y(x), Y(x)+h] = Var[Y(x)] = 1:
219
(eq. 17.8-2)
(eq. 17.8-3)
where n are the coefficients of the expansion of the anamorphosis function into N Hermite polynomials. The block gaussian covariance Cov[Yvi , Yvj] is determined by inversion from cov(Z (v(x)), Z (v(x))), which is the regularized covariance of Z(x).
the anamorphosis of Zj(v), with change of support coefficient rj, the covariance between each variable separately, the cross-covariances between the variables taken two by two: the cross-covariance of block gaussian variables is Cov[Yiv(x) , Yjv(x+h)] - the point-block cross-covariance is then: Cov[Yi(x), Yjv(x+h)] = ri Cov[Yiv(x), Yjv(x+h)] - the point-point cross-covariance is then : Cov[Yi(x), Yj(x+h)] = rirj Cov[Yiv(x) , Yjv(x+h)] - except between the point and itself where the covariance is derived from the statistics on the data Cov[Yi(x), Yj(x+h)]
220
the standard block gaussian variable corresponds to the (normalized) regularized point gaussian (here univariate):
Yv = Y (v) r
(eq. 17.8-4)
Y (v) =
1 Y ( x) dx v v
(eq. 17.8-5)
It is derived from the variogram of the gaussian variable, instead of the variogram of the raw variable in the classical method. In the same mind we can calculate directly the block gaussian covariances and cross-covariances from the regularized covariances and cross-covariances of the gaussian data:
cov(Y1v ,Y1vh ) =
cov(Y1v ,Y2vh ) =
cov [Y1(v),Y2 (vh )] Y1Y2 (v, vh ) cov [Y1( x),Y2 ( x)] Y1Y2 (v, vh ) = = r1 r2 r1 r2 r1 r2
(eq. 17.8-8)
221
222
223
Figure 1: workflow for multivariate UC and direct block simulations. The simulation is then achieved by means of the following steps:
m m m
Non conditional simulation using Turning Bands of the block gaussian variogram. Transform of the simulated block values into point values at data locations. Conditioning by a cokriging based on the Discrete Gaussian Model.
According to that model, Yx and Yv make a pair of bi-gaussian variables. If we consider two variables "i" and "j", the Gaussian point and block values are obtained by means of a linear regression. In the formula below the variables Gi and Gj are the normal residuals of the linear regression.
(eq. 17.8-9)
(eq. 17.8-10)
Knowing the covariance model Cijv(h) of the block Gaussian values we can derive the covariance between point Gaussian values Cij(h).
(eq. 17.8-11)
These covariances are used to establish the cokriging system when conditioning the block simulated values by point Gaussian values considered as random in a block. The cokriging matrix has to be transformed to account the case where the two data points are not only located in the same block but are the same point. The modifications are then: - When the two variables (i and j) are the same we use Civ(0) (equal to 1 when the block Gaussian variogram is normalized).
224
- When the two variables are different we use Cij that is the covariance between point gaussian values. Using the relationship between Y(x) and Yv we can derive the covariance between the residuals Gi, Gj.
(eq. 17.8-12)
(eq. 17.8-13)
This correlation matrix must be positive definite, i.e. with positive eigen values. This property is checked and has to be respected before to use that model for the direct block simulation.
m
Optionally a sample randomly located in the block can be calculated from the simulated block values. This is directly coming from the discrete gaussian model where the point and the block values are linked by the relationship above (eq. 17.8-9) (eq. 17.8-10). The two normal variables Gi and Gi are taken at random from a bi-gaussian distribution with the coefficient of correlation given in (eq. 17.8-13).
225
Note - This technical reference is based on: Abzalov, M.Z. (2006) Localised Uniform Conditioning (LUC): A New Approach to Direct modelling of Small Blocks. Mathematical Geology 38(4) p393411.
The Localized uniform conditioning is designed for non linear estimation in mining industries and should be used as a Uniform Conditioning's post-processing. This is a specific method which enables to estimate the grades at the block scale. The classic Uniform Conditioning method estimates only the panel proportion of recoverable mineralization without identifying the location of the recoverable blocks. Beside it is commonly admit the use of Ordinary Kriging to estimate small blocks is inappropriate when the data are to parsed compare to the block size. As a matter of fact these two methods (Uniform Conditioning & Ordinary Kriging) do not allow to efficiently determinate the actual location of the economically extractable blocks. The Localized Uniform Conditioning method aims at filling this lack. This method estimates the localized block grades by using the grade-tonnage curves given by the uniform conditioning and by reproducing the spatial grade distribution obtained by Ordinary Kriging. Actually the concept of LUC is to use the grade ranking provided by the Ordinary Kriging while keeping the distribution grade.
226
18.1 Algorithm
The Uniform Conditioning estimates the grade-tonnage curves for each panels. The grade tonnage curves correspond to the tonnage and grade of mineralization which can be recovered for a cut-off value. The Local Uniform Conditioning algorithm then estimates the mean grades of the grade classes in each panel according to the block. Then the algorithm ranks the SMU blocks distributed in each panel in their grade (estimate by Ordinary Kriging) increasing order. Finally, the mean grades (Mi) of the grade class (Gci) which have been deduced from the UC model are assigned to the SMU blocks whose rank matches the grade class. The grade class is the portion of the panel whose grade is lying between a given cut-off (Zci) and the following cut-off (Zci+1). In other words:
(eq. 18.1-1)
With Gci = grade class, Ti (Zci ) = the recoverable tonnage at cut-off (Zci ) and Ti+1(Zci+1) = the recoverable tonnage at cut-off (Zci+1). By defining the SMU ranks as proportions of the panel tonnage Tv, the SMU ranks can be converted into the grade classes:
(eq. 18.1-2)
With SMUK = the SMU of a rank K, TK = the proportion of the panel tonnage distributed in SMU blocks whose rank is equal or lower than (K), and TK+1 = the proportion of the panel distributed in SMU blocks having higher rank. Then the UC model enables to deduces the mean grades (Mi ) of the grade classes (MGci ) in the panels. Finally by matching then class indexes MGci and TGci the mean grade (Mi) of each class can be transferred to the SMUk blocks.
227
(fig. 18.1-1)
Example of LUC on 16 SMU blocks per panel, and six cut-off values on the grade tonnage curve coming form the uniform conditionning.
228
Skin algorithm
229
19 Skin algorithm
The new algorithm used to fill an incomplete grid of values is called the Skin Algorithm. This simple technique allows a very flexible input and therefore can be used for several applications, such as Fluid Propagation, Wave propagation
19.1.1 VOCABULARY
The Skin algorithm only makes sense on a regular grid, which is characterized by its geometry and its total number of cells (N1). The variable of interest is initially defined on a set of grid nodes that we will call the Initial Domain of Definition (N2). The grid may also contain an active selection (masking off N3 cells) which reduces the number of cells that can be ultimately filled (N4). An obvious formula states that: Each cell of the grid (already filled or not) may also be assigned an attribute (say its permeability) which acts as a weighting factor to speed up or slow down the propagation. This property is not defined in the basic case of grid filling. This weighting factor can also be influenced by a speed coefficient which describes the velocity with which a fluid (known in a cell already filled) would tend to invade the adjacent cell. This feature can be used to introduce some anisotropy in the weighting factor or discriminating among several fluids. This feature, essential in the Fluid propagation algorithm, is not used for Grid Filling. In this paper, we will refer to the neighborhood of a target cell. This refers to all the cells which are adjacent and have a vertex (not a corner) in common with the target cell. Therefore, in 1-D, the neighborhood is limited to the 2 adjacent cells, 4 in 2-D and 6 in 3-D.
19.1.2 INITIALIZATION
We start with the cells contained in the Initial Domain of Definition and establish the skin. The skin is composed of all the cells immediately contiguous to a cell contained in the Initial Domain of Def-
230
inition. In other words, a cell belongs to the skin if one of its neighboring cells belongs to the Initial Domain of Definition. The next cell consists in filling one cell of this skin. All the cells of the skin do not have the same probability of being elected. For a given target cell belonging to the skin, this probability is computed as the sum of the weights induced by the only cells already filled and which belong to neighborhood of the target cell. This weight is given by the (permeability) property carried by the cell (if defined) or 1 if not defined. This weight will serve as energy for each cell of the skin. The nonweighted version of the energy leads to the Skin length. The Initial Skin Energy is the sum of these energies for all the cells that constitute the skin. When the initialization step is ended, a message is produced (in the verbose option) giving: - The total number of cells (N1) - The number of cells already filled (N2) - The number of cells masked off (N3) - The number of cells to be processed (N4) - The initial energy of the skin
Skin algorithm
231
232
Isatoil
Technical References
235
19 Isatoil
One of the main problems during the exploration and the development phases of a reservoir is to construct a complex multi-layer geological faulted model recognized by seismic campaigns and several wells (often deviated and sometimes even horizontal). This is the general framework within which the methodology of Isatoil has been established. The main sources of uncertainty come from the quality as well as the quantity of the information, but also the reservoir's geological structure, the variability of the petrophysical properties and the location of the gas-oil and oil-water contacts. Therefore the Isatoil methodology has been developed in order to:
l
calculate a base case geological model by using estimation techniques (Kriging) which produce a set of smooth surfaces that honor all the available data. The graphical display of the general shape of the reservoirs is used to check the suitability of the model from a geological point of view, apply the same concepts by means of simulation techniques so as to obtain reliable distribution curves of reservoir volumes, over different exploitation segments which constitute a partition of the field. The series of volume estimates obtained through simulations for a given layer and a given segment can be represented as risk curves.
The aim of this geostatistical technique, which works with deviated wells, is to provide accurate estimates, whatever the number of surfaces involved in the geological model.
236
Isatoil
the layer cake hypothesis implies to work with a geological sequence of strata which starts from a given surface named the Top Layering reference surface. the same vertical sequence of strata is defined over homegeneous areas of the field. Nevertheless missing stratum corresponding to pinch out can be handled. each stratum is considered as vertically homogeneous as far as petrophysical parameters are concerned, so that any information processed on the output grid (seismic time, elevations, petrophysical parameters) can always be defined using a 2D representation - we will refer to them as maps the sequence is divided vertically into Layers. The Layers are stacked successively with no vacuum, so that the bottom of one Layer always matches the top of the next Layer. Generically, the top and bottom of a Layer will be called a surface. Some surfaces can be picked using the seismic information (seismic surface), others cannot. All the Layers, when intersected, must be "visible" on the well information.
The procedure enables to take into account the following information in order to produce a consistent geological model:
l
Seismic Time maps. They are provided by a series of picks coming from 3D seismic sections which cover the whole field. These picks are interpolated in order to produce 2D surfaces which cover the entire field. When the time map is absent, the corresponding Layer will be missing. The seismic sections also serve in picking the fault events which create a disruption in the time map. Within the faulted area, the quality of the time map is questionable and therefore, the procedure may alter its values. These faults can be represented on 2D maps as fault polygons which correspond to the projection on the horizontal plane of the areas where the faults have perturbed the seismic time surface. The procedure is restricted to normal faults.
Well data. A well consists of a continuous well path through the 3D geological model. The locations where the well path intersects each surface of the sequence (whether they are reflected in the seismic time map or not) are recorded, we call them the intercepts. The wells can be vertical or deviated with no limitation - they can even be horizontal -
At some locations along the well path, the values of (static) petrophysical parameters are measured - porosity and the net to gross ratio values - The saturation could obviously not be considered as vertically homogeneous within a layer since it strongly depends on the vertical distance to the oilwater contact. The saturation is therefore calculated using a formulae tabulated within the procedure. The petrophysical measurements are usually located within a layer and are therefore different from the intercepts.
Technical References
237
Some Control Surfaces given in depth and which cannot be deduced from the layer cake environment, such as unconformities, erosion surfaces or major faults boundaries.
For volume calculation, it is also possible to provide a set of 2D areas which subdivide the field into compartments where the volumes must be calculated. The procedure enables the reservoir to contain up to three different phases (gas, oil and water). If present, the order relationship reflects their density: gas is always located above oil and oil above water. There presence depends upon the definition of contact surfaces which delineate the transition between two consecutive phases. These contacts can be defined for each layer and within each area, either as a constant value or a map (possibly adding a randomization factor).
238
Isatoil
19.2 Workflow
The Isatoil methodology has been developed in order to reflect the nature of the data and the geological structure of the field. This is reflected in the workflow which is used: 1. select a Top Layering reference surface from which the whole sequence will be derived. This surface usually corresponds to a good seismic marker 2. perform a Depth Conversion of the set of markers for which seismic time maps are available 3. build the (normal) fault surfaces starting from the fault polygons 4. subdivide a unit (between two consecutive Layers) into zones within which the petrophysical parameters can be considered as verticaly homogeneous - as well as non correlated between zones 5. populate each zone with petrophysical variables - porosity, net to gross ratio and saturation in order to derive the in-situ volumes above contact surfaces. All the results are considered as 2D surfaces (or maps) which must match any information collected along the deviated wells. For petrophysics, this coarse assumption only holds if the variables can be considered as vertically homogeneous within each layer. The same workflow is applied for estimation as well as for simulations. In the latter case, each sequence produces several outcomes. Caution is required when combining the outcomes of different sequences in order to keep the consistency of the global geological model: let us recall, for example, that, by construction, the sum of the thicknesses of the layers within a unit must match the total thickness of this unit.
Technical References
239
and
well
, while D i ( x ) is the true vertical depth down to the layer i at the the point x counted from
the Top Layering reference surface: it also corresponds to the sum of the thicknesses of all the layers above i, measured at point x :
ji j=0
Di ( x ) =
Tj ( x )
(eq. 19.3-1)
These definitions are illustrated in the next figure showing two representative well geometries: the well is vertical while the well
is strongly deviated:
(fig. 19.3-1)
240
Isatoil
T 2 ( x ) . Conversely, the deviated well does not provide any valuable direct infor ( x ) can only be obtained indirectly as T 2
( x ) = D ( x ) T *( x ) T 2 2 1
where
(eq. 19.3-1)
*( x ) designates the estimation of the thickness of the first layer at the point x . We T1
recall that this value only represents an estimate (with an attached uncertainty) and, therefore, not an exact quantity.
Technical References
241
D( x) =
where the element
pl ( x ) Tl ( x )
l=0
(eq. 19.3-1)
D ( x ) or not: in other words, if the information at the point x is an intercept with a layer deeper than l or not. For example, for an intercept with the first surface, the p-vector is p = [ 1, 0, 0, , 0 ] and p = [ 1, 1, 0, , 0 ] for an intercept with the second layer.
The cokriging system follows, established for the target layer i and the target node x 0 :
(eq. 19.3-2)
When expanding the previous set of equations, we introduce the following covariance terms:
ij ( h ) = Cov [ T i ( x + h ), T j ( x ) ]
lj
C ij ( h ) = Cov [ T i ( x + h ), D j ( x ) ] =
pl ( x ) ij ( h )
l li mj l m
C ij ( h ) = Cov [ D i ( x + h ), Dj ( x ) ] =
pl ( x + h ) pm ( x )lm ( h )
(eq. 19.3-3)
If we recall that the p-vectors are known, the quantities covariance terms between elementary thicknesses is required.
242
Isatoil
The cokriging system (eq. 19.3-2) can then be expanded as follows, according to the strict stationarity hypothesis:
i C,
= C , i
(eq. 19.3-4)
i2
where
= ii ( 0 )
C
i
, i
C , designates the covariance Cov ( D , D ) and is expressed using ij ( h ) according x and x and the distance h , between them. C , i = Cov ( D ,T i ) depends on the rank of the layer intercepted at the data point h , and h , 0 will systematically be skipped in the following.
x and the target layer i at point x 0 and the distance between them h, 0 . For simplicity, the distance arguments
Note that the system (eq. 19.3-4) also provides the variance of the estimation and can be established for the estimation of each target layer i, hence the additional index attached to the cokriging weights .
i
Ti v i = --ti
(eq. 19.3-1)
Once more, the actual information provided by a deviated well consists in the true vertical depth
( D i ) . We can therefore introduce the apparent velocity ( V i ) which corresponds to the velocity
averaged over the layers intercepted down to the layer i, i.e. the cumulative thickness divided by the cumulative time thickness
( i ) :
Technical References
243
li
li
li l
l - vl --- i
(eq. 19.3-2)
For better legibility, we can use the same formalism as before, introducing the p-vector where each element represents the proportion of the time thickness spent in an intercepted layer, and zero for a layer not intercepted. Note that, this time, the elements of a p-vector always add up to 1.
t1 t2 -, ---, , 0 p = ---
(eq. 19.3-3)
Vi ( x ) =
pl ( x ) vl ( x )
l=0
(eq. 19.3-4)
Hence the cokriging system, expressed using velocities, and written for the target layer i and the target node :
N
v i( x 0 ) =
*
V ( x ) =
pl ( x ) vl ( x )
l=0
(eq. 19.3-5)
E [ v i( x 0 ) v i ( x 0 ) ] = 0 Var [ v i ( x 0 ) v i ( x 0 ) ]
which can be expanded as follows:
*
minimum
i C,
= C , i
(eq. 19.3-6)
i2
= ii ( 0 )
C
i
, i
244
Isatoil
ij ( h ) = Cov [ v i ( x + h ), v j ( x ) ]
lj
C ij ( h ) = Cov [ v i ( x + h ), V j ( x ) ] =
pl ( x ) ij ( h )
l li mj l m
C ij ( h ) = Cov [ V i ( x + h ), V j ( x ) ] =
pl ( x + h ) pm ( x )lm ( h )
(eq. 19.3-7)
Another interest for working in velocities (rather than in depth) is when the model for the interval velocities must reflect some physical behavior (rock compaction rule for example).
E [ vi ] = ai + bi Ti
(eq. 19.3-1)
which relates the mathematical expectation of each interval velocity field to the seismic time through a linear equation. The coefficients a i and b i are assumed to be constant over the field. Note that this formalism enables the use of a more complex function, and even the possibility of involving more terms. Introducing the assumptions (eq. 19.3-1) in the cokriging formalism (eq. 19.3-5) leads to the new formulation of the cokriging system, expressed for the target layer i and the target node x 0 :
Technical References
245
i C,
= C , i = li
(eq. 19.3-2)
l pl ( x )
l p l ( x ) T l ( x )
li T i ( x 0 )
i2 = ii ( 0 ) i C , i l l T l ( x 0 )
l l
where
li stands for the Kroneker sign which is equal to 1 when i = l and to 0 otherwise. We { l } and { l } which stand as additional
unknowns. As the second and third type of equations must be repeated for each layer index l, the dimension of this system is now equal to the count of intercepts incremented by twice the count of layers.
246
Isatoil
(fig. 19.3-1)
Isatoil interpolates the fault surface from its traces on the depth maps of two consecutive seismic markers. These top and bottom surfaces are then extrapolated throughout the fault in a pre-faulted scenario. Any intermediate surface is then estimated throughout the fault in a pre-faulted scenario and the fault is finally applied afterwards to reproduce the observed throws.
Technical References
247
The Zonation process is similar to the one explained in the previous paragraph, using the cokriging formalism. This time, it must compulsorily be performed using thickness instead of velocity (as there is no time map information for each layer). Note that the external drift feature is still applicable as long as the geologist has a sound intuition of a set of variables which can serve as external drifts: there must be as many variables as they are layers within a unit. The important difference of this second step comes from the additional constraint that must be considered: the cumulated thickness of the layers within a unit must be equal to the thickness of the unit. This is achieved by considering a collocation option added to the previous cokriging formalism.
(fig. 19.3-1)
In principle, when the unit is subdivided into N layers, it suffices to calculate the thicknesses of the N-1 layers: the thickness of the last one is obtained by comparison to the thickness of the total unit. Nevertheless, in the case of the collocated option, we consider the problem of estimating the N thicknesses (as if the thickness of the total unit were unknown). This is the reason why we consider all the intercepts of the wells with the layers, as well as those with the bottom of the unit. The top of the unit serves as the reference from where the true vertical depth is counted. Moreover, at the target node location, we simply tell the system that one additional information must be considered: the thickness of the total unit. When working with true vertical thicknesses, the task is even simplified as it means that the cumulative depth down to the layer "N" at the target node, is known. As the estimation (using the cokriging technique) provides an exact interpolation (all the information is honored), the intercept with the bottom of the unit, collocated with the target node, ensures that the sum of the estimated thicknesses match the thickness of the total unit.
248
Isatoil
the information provided refers to linear transform of the variables of interest (cumulative thickness or apparent velocity), the variables are not all sampled at the same points and therefore, it is not possible to use a linear inversion in order to transform the model back to the variables of interest.
For simplicity, we focus on the problem of modelling the thicknesses of several layers, starting from information on cumulative thickness. Let us denote by layers which are only measured in a set of points x 1,
Z(x) =
The weights
pi( x ) Yi ( x )
i
p i ( x ) are known at each sample point and for all layers. Y i variables:
(eq. 19.3-2)
Technical References
249
ij = au
i xj pu pu xpu p
i rj pu rpu p
(eq. 19.3-3)
with
i = r pu
i which pu x pu
makes sense as
pu 0 .
K Z ( x, y ) =
i r j K (x y) p i ( x ) p j ( y ) r pu pu u , i, j pu
(eq. 19.3-4)
When the variables have been carefully centered beforehand, in the scope of a stationary model, the previous term corresponds to the covariance will be obtained by minimizing the quantity:
J( A) =
2 ij K ( x y ) Z ( x ) Z ( y ) p ( x ) p ( y ) a i j u u , i, j pu x, y
(eq. 19.3-5)
The criterion
ij . If we use for the set of indices J ( A ) is quadratic with respect to the coefficients a u
k ( ) = pi ( x ) p j ( y ) k u ( x y ) ( ) = Z ( x ) Z ( y )
then we can write:
(eq. 19.3-6)
J( a) =
(eq. 19.3-7)
where
< f, g > =
f()g( )
The whole set of matrices is obtained simultaneously by solving the linear system:
k
But we must still ensure that each vious procedure.
< k , l > al
l
= < k , >
(eq. 19.3-8)
250
Isatoil
Therefore we use an iterative procedure where each matrix is optimized in turn while keeping the definite positive condition fulfilled for all the other matrices. The procedure consists of:
l
K u ; in general each basic structure is considered in turn but one A u , keeping all the other matrices unchanged,
Technical References
251
(eq. 19.4-1)
where:
l l
252
Isatoil