Petroleum Geostatistics

PTRE 571
Student Presentations Chapter 3
Numerical and Field Examples
Professors: Dr. Minou Rabiei & Dr. Vamegh Rasouli
September 22, 2016

Numerical 3.3
Field 3.1
Alan Alexeyev (On-Campus)

Numerical Example 3.3

use data from Num.Ex 3.1 to find variogram as a
Problem:

Porosity
function ofDepth
lag distance
2040
8.25
Data:
2041
9
2042
2043
2044
2045
2046

6.25
5
5.3
4.75
5

Formula:
= number of pairs at lag distance L
= values for ith pair located L lag distance away

Numerical Example 3.3

Solution:

Pairs

Pairs

Pairs

Pairs

L(1)

L(2)

L(3)

L(4)

Depth Porosity
2040
8.25

1
0.5625

2
3
4
4.0000 10.5625 8.7025

2041

7.5625

16.0000 13.6900 18.0625

2042

6.25

1.5625

0.9025

2.2500

2043

0.0900

0.0625

0.0000

2044

5.3

0.3025

0.0900

2045

4.75

0.0625

2046

1.5625

10.1425 21.0550 26.5025 28.3275

Lag
Distance
Variogram

Numerical Example 3.3

Graph:

Variogram vs Lag Distance

5.0000
4.5000
4.0000
3.5000
3.0000

Variogram

2.5000
2.0000
1.5000
1.0000
0.5000
0.0000
0.5

1.5

2.5

Lag Distance, ft

3.5

4.5

Field Example 3.3

Problem: Generate variogram and covariance for the well
porosity data from Well 34-29
Solution: Use definitions of variogram and covariance to generate
depth
porosity
the values
2920.5
0.127
2921.5
0.157
Formula for variogram:
2922.5
0.129
Data:

2923.5
2924.5
2925.5
2926.5
2927.5
2928.5
2929.5
2937.5
2941.5
2942.5
2943.5
2944.5
2945.5
2946.5
2947.5
2948.5
2949.5
2950.5
2951.5

0.1
0.19
0.052
0.053
0.066
0.257
0.261
0.236
0.237
0.215
0.21
0.191
0.203
0.165
0.188
0.18
0.171
0.167
0.155

Formula for covariance:

Field Example 3.3

Graph:
Semivariogram and covariance vs lag distance
0.01

Semivariogram
Covariance

10

15

20

-0.01

Lag Distance

25

30

35

Petroleum Geostatistics
PtrE-571
Multipoint Histograms NE 3.8, NE 3.9
Chris Wagner
Professor: Dr. Minou Rabiei
Co-Professor: Dr. Vamegh Rasouli
Date: September 19th, 2016

Multipoint Histograms
Numerical Examples 3.8 &
3.9
Chris Wagner (DEDP)

Multipoint Histograms - 3.7.2

Variograms allow us to define the connectivity between
2 points (lag distance apart)
Multipoint Histograms allow us to define the
connectivity between 2 or more points
Use the Markov-chain principle
Can only be used on discrete variables or on continuous
variables that are discretized by some method

Calculate Multipoint Histogram using the formula

(3.125):

Markov Chain Principle and

Transition Probabilities
A Markov Chain is a method by which the ordering of
geological observations can be quantified in terms of
transition probabilities.1
Can only be used on adjacent points
Can only be used for two points

Transition probabilities represent the probabilities that

one feature will be followed by another feature.
In other words, it is the conditional probability that a
measurement will be feature B given that the previous
measurement was feature A or .

Numerical Example 3.8 - Description

Table 3.9 shows 162
observations of facies in a
vertical well. Observations are
ordered from top to bottom.
Each facies measurement has
three outcomes A, B, and C
A transition is the movement
from one measurement to the
next adjacent measurement
Exercise Estimate the
transition probabilities

Table 3.9 - Facies for Numerical Example

3.8

Top

16

Numerical Example 3.8 Transition

Probabilities
1. Count each facies transition and
create
a Transition Frequency Matrix
Transition Count to Facies (top) from Facies (left)

A
B
C

B
2
2
0

C
2
33
1

Total
0
2
3

4
73
4

2. Divide the count in each cell by its row total

and create Transition Probability Matrix

3.

Transition Probability to Facies (top) from Facies

(left)

A
B
C
Total
A
50.00% 50.00%
0.00%
100%
B
28.57%3 42.86%3 28.57%3
100%
C
0.00% 25.00% 75.00%
100%

Transition probabilities for each

facies transition. For example:
= 50.00%, = 28.57% and = 0.00%

Table 3.9 - Facies for Numerical Example

3.8

Top

Numerical Example 3.9 - Description

Spatial grid of 16 squares (such as an
aerial view of a reservoir)
10 measurements of a continuous
variable (such as porosity) taken
across area
Each measurement has been
discretized using indicator values
(see section 3.4.3, NE 3.4) at 3
different threshold values
Exercise Calculate multipoint
histograms for various configurations,
directions and thresholds

E(1,0,
0)

E(0,0,
0)

E(1,1,
1)

E(1,1, E(1,1,
0)
0)

E(1,0, E(1,1,
0)
0)

E(1,1, E(1,0, E(0,0,

1)
0)
0)

Numerical Example 3.9 Configurations

E(1,0,
0)

E(0,0,
0)

E(1,1,
1)

E(1,1, E(1,1,
0)
0)

E(1,0, E(1,1,
0)
0)

E(1,1, E(1,0, E(0,0,

1)
0)
0)

a)

b
)

c
)

a) Estimate the two-point histogram

at in an easterly direction for the
configuration for Threshold 2 (four
pairs).
b) Estimate the two-point histogram
at in an diagonal direction for the
configuration for Threshold 1 (four
pairs).
c) Estimate the three-point histogram
at for the configuration for
Threshold 2 (two sample data
sets).

Numerical Example 3.9 Parts a) &

b)
E(1,0,
0)

E(0,0,
0)

E(1,1,
1)

E(1,1, E(1,1,
0)
0)

E(1,0, E(1,1,
0)
0)

E(1,1, E(1,0, E(0,0,

1)
0)
0)

For N = 2, equation 3.125 reduces to:

a) For 4 pairs (n=4) in configuration a) and

threshold 2:

The probability that two values located

distance apart in an easterly direction are
both less than threshold 2 is 25%.

b) For 4 pairs (n=4) in configuration b) and

threshold 14:

The probability that two values located

distance apart in a diagonal direction are
both less than threshold 1 is 75%

Numerical Example 3.9 Part c)

E(1,0,
0)

E(0,0,
0)

E(1,1, E(1,1,
0)
0)

E(1,0, E(1,1,
0)
0)

E(1,1,
1)

E(1,1, E(1,0, E(0,0,

1)
0)
0)

For N = 3 equation 3.125 reduces to:

c) For 2 data sets (n=2) of 3 points (N=3) in

configuration c) and Threshold 2:
50
The probability that all 3 values in the given
configuration are less than threshold 2 is 50%