9 Solution Methods

Solution Methods
01/17/23 Dr.Helmy Sayyouh 1

One-dimensional flow system
 One-dimensional system composed of five blocks.

 A no-flow boundary condition is imposed on the left end, while a
non-zero pressure gradient is specified on the right.
 A well with a flow rate qs is located in block #2. We assume that the
flowing fluid is slightly compressible.

The characteristic equation for any block
D in Pin11  E 1n Pin 1  Fin Pin11  Q i
Pressure is not known in any of these five blocks, and so we must write
Equation for each of them (i.e., i = 1,..., 5):
i  1: D 1n P0n 1  E 1n P1n 1  F1n P2n 1  Q 1

i  2: D 2n P1n 1  E 2n P2n 1  F2n P3n 1  Q 2
i  3: D 3n P2n 1  E 3n P3n 1  F3n P4n 1  Q 3
i  4: D 4n P3n 1  E 4n P4n 1  F4n P5n 1  Q 4
i  5: D 5n P4n 1  E 5n P5n 1  F5n P6n 1  Q 5

 Moving to block #5, the imposed constant pressure gradient
implies that
P6n 1  P5n 1
 C1
x
 or
P6n 1  P5n 1  C1x

 In implementing the flow rate specified at the well block, we
invoke the following definition of Q2:
 Vb c n
Q 2   q s  P2 
 5.615t 2 

The 5x5 coefficient matrix is a tri-diagonal coefficient matrix, which is
normally written in a more compact form as follows:
O O 0
 O Fi 
 
O Ei O
 
 Di O 

0 O O


Two-dimensional flow system
 The reservoir under consideration has three no-flow boundaries
and one constant-pressure boundary.
 A well is located in block (2,2), at which sand face pressure is
specified as Psf.
 Although there are nine blocks in the system, the constant
pressure specification on the boundary blocks (1,1), (2,1), and
(3,1) means that only six blocks have unknown pressures.

We need to write Equation for just these six
blocks:
n n 1 n n 1 n n 1 n n 1 n n 1
i = 1, j = 2: B1,2 P1,1  D 1, 2 P0 , 2  E 1, 2 P1, 2  F1, 2 P2 , 2  H 1, 2 P1, 3  Q 1, 2
n n 1 n n 1 n n 1 n n 1 n n 1
i = 2, j = 2: B 2,2 P2 ,1  D 2 , 2 P1, 2  E 2,2 P2 , 2  F2 , 2 P3, 2  H 2 , 2 P2 , 3  Q 2 , 2
n n 1 n n 1 n n 1 n n 1 n n 1
i = 3, j = 2: B 3,2 P3,1  D 3, 2 P2 , 2  E 3,2 P3, 2  F3, 2 P4 , 2  H 3, 2 P3, 3  Q 3, 2
n n 1 n n 1 n n 1 n n 1 n n 1
i = 1, j = 3: B1,3 P1, 2  D 1, 3 P0 , 3  E 1, 3 P1, 3  F1, 3 P2 , 3  H 1, 3 P1, 4  Q 1, 3
n n 1 n n 1 n n 1 n n 1 n n 1
i = 2, j = 3: B 2,3 P2 , 2  D 2 , 3 P1, 3  E 2 , 3 P2 , 3  F2 , 3 P3, 3  H 2 , 3 P2 , 4  Q 2 , 3
n n 1 n n 1 n n 1 n n 1 n n 1
i = 3, j = 3: B 3,3 P3, 2  D 3, 3 P2 , 3  E 3, 3 P3, 3  F3, 3 P4 , 3  H 3, 3 P3, 4  Q 2 , 3

 The matrix in this case is a penta-diagonal coefficient matrix, and it is
normally written in the more compact form shown below:
O O O 0
 O O 0 H i, j 
O O Fi , j O
 
O E i, j O
 
O 0 D i, j O O
 B i, j O O 
0 
 O O O

Three-dimensional flow system
 We start with the flow equation in its finite difference

form:
Z in, j,k Pin, j,k1 1  Bin, j,k Pin, j11,k  D in, j,k Pin11, j,k  E in, j,k Pin, j,k1  Fin, j,k Pin11, j,k
 H in, j,k Pin, j11,k  S in, j,k Pin, j,k1 1  Q i , j,k

A three-dimensional single-phase problem leads to
a hepta-diagonal coefficient matrix whose general form is as follows:
O O O O 0
 O O O S i , j, k 
O O O O 0 O
 O O O H i , j, k

 
 O O O 0 O

 O O Fi , j, k O 
O O E i , j, k O O
 O D i , j, k O O

 
 O 0 O O O

 B i , j,k O O O 
O 0 O O O O
 Z i , j, k O O O 
0 
 O O O O

Irregularly bounded reservoirs
 The tri-, penta-, and hepta-diagonal matrix structures

obtained for the three previous examples are quite
standard. However, discretization of irregularly-
bounded reservoirs may yield other matrix structures.

 E1 P1 + F1 P2 + H1 P5 = Q1 D2P1 + E2P2 = Q2
 E3P3 + F3P4 + H3P6 = Q3
 D4P3 + E4P4 + F4P5 + H4P7 = Q4
 B5P1 + D5P4 + E5P5 + H5P8 = Q5
 B6P3 + E6P6 + F6P7 = Q6
 B7P4 + D7P6 + E7P7 + F7P8 + H7P10 = Q7

Multi-Phase Flow Equations: Solution Methods
 Simulating multiphase fluid flow in porous media involves

solving a system of coupled non-linear partial differential
equations.
 The various solution techniques differ with respect to how

we manipulate the governing partial differential
equations.

IMPES method
 Obtain a single equation in which the sole unknown is

the pressure of one of the phases.
 We achieve this by combining the partial differential
equations for each phase in such a way as to
eliminate the saturation derivatives.
 Assume capillary pressure to be constant during any
time step.
 Obtain just one partial differential equation, with a
phase pressure as the only unknown (this is usually
the water-phase pressure).

 Obtain the appropriate characteristic equation.
 Generate a system of linear algebraic equations.
 The coefficients appearing in this system of equations

are functions of the pressures and saturations;
therefore, they are estimated using the information
available at the previous iteration level.
 When the solution for the phase pressure (e.g., Pw)

distribution is obtained, the next step is to solve
explicitly for that phase saturation distribution, Sw
from the partial differential equation describing the
flow of that phase.

 At this stage, we know the Pw and Sw distributions.
 This enables us to determine the oil phase pressure

distribution using the capillary pressure relationship
between the oil and water phases.
 Similar to the determination of Sw, after obtaining

the Pw distribution, we explicitly solve the oil-phase
partial differential equation for the oil-phase
saturation, So.

 With the values of So and Sw calculated, we can
easily determine Sg (Sg = 1 - So - Sw).
 Finally, using the capillary pressure relationship

between the oil and gas phases, we obtain the gas
phase pressure (Pg) distribution.
 This completes one iteration; we then repeat the

whole procedure until we achieve convergence.
 At the beginning of each iteration, all the pressure

and saturation dependent terms are updated using
the most recent information available.

Flow chart highlighting the major steps involved in the
IMPES method

Solution of Matrix Equations
 In setting the computer model, we face the problem of

solving a set of n equations relating n unknowns,
which are expressed in the form of
 A11 x1 + a12 x2 + a13 x3 + ... +a1n xn = C1

 A21 x1 + a22 x2 + a23 x3 + ... +a2n xn = C1
 ....................................................
 An1 x1 + an2 x2 + an3 x3 + ... +ann xn = Cn

We can put the left-hand members of the previous equation into a square array of the
coefficients, known as the coefficient matrix,
 a 11 a 12  a 1n 
a a 22  a 2n 
 21 
   
 
 a n1 a n2  a nn 
 and the unknown vector,
x 1 
x 
X  
2 
.... 
 
x
 n

Standard ordering by rows
 Ordering by rows for grid blocks in a 5x2 model, and the
resulting coefficient matrix.
 The non-zero elements of the coefficient matrix are indicated
by x; positions, while zero elements are left blank.

Standard ordering by columns
The band width for

the coefficient
matrix is five
(2x2+1=5).
This ordering
scheme will
significantly reduce
computational
requirements.
Figure shows the standard ordering by columns
of the same reservoir.

Checkerboard (Cyclic-2) Ordering
 In ordering the grid
blocks, we number
the shaded blocks
first and then the
unshaded blocks.
 The resulting
coefficient matrix
offers the advantage
that, during the
forward solution
stage of Gaussian
elimination, only a
small portion of the
matrix needs to be
worked for
triangularization
Consider a reservoir model numbered in a
checkerboard fashion.

Checkerboard (D-4) Ordering
 In checkerboard D-4
ordering, we number
grid blocks along
alternate diagonals.
 This alternate
diagonal ordering
leads to substantial
savings in
computational
overhead (CPU time
and storage).
Typical coefficient matrix generated

from D-4 ordering of a 4x5 matrix.
(D-2) Ordering
The D-2 ordering scheme is

also known as diagonal
ordering.
 The resulting coefficient

matrix has a relatively small
bandwidth

System of linear equations solution methods
 Our goal is always to end up with a system of linear

equations, regardless of whether the original equations
are linear or non-linear.
 Two main categories of solution methods for the

resulting system of linear algebraic equations: direct
and iterative.

Direct solution methods
 For a direct solution, we assume that the machine

performing the computations is capable of carrying an
infinite number of digits (i.e., there is no round-off
error).
 A direct solution method will yield an exact solution

after a finite number of elementary arithmetical
operations.

The Gaussian elimination technique
 Is the fundamental algorithm used by direct

solvers.

Thomas’ Algorithm
 Is designed for tri-diagonal coefficient

matrices.
 Simply avoid performing any arithmetic

operations on the zero elements of the
coefficient matrix, thereby saving a
significant amount of time.

Iterative methods
 Iterative solution methods involve making an initial

guess, or approximation of the solution vector, and
then improving on this guess by successfully
implementing the algorithm.

 Iterative methods offer two important
advantages: less storage requirements and
less computational work.
 The simplest and best-known iterative

methods for solving systems of linear
algebraic equations are grouped under the
name fixed point iterative methods.

 Use a common multiplier, ωopt (the optimum acceleration
parameter), whose value is always lies between 1 and 2.

 Comparison of convergence paths for the three
algorithms.

Comparison of direct and iterative
methods

9 Solution Methods

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

9 Solution Methods

Uploaded by

Copyright:

Available Formats

Solution Methods

01/17/23 Dr.Helmy Sayyouh 1

 One-dimensional system composed of five blocks.

01/17/23 Dr.Helmy Sayyouh 2

D in Pin11  E 1n Pin 1  Fin Pin11  Q i

i  1: D 1n P0n 1  E 1n P1n 1  F1n P2n 1  Q 1

01/17/23 Dr.Helmy Sayyouh 3

P6n 1  P5n 1  C1x

01/17/23 Dr.Helmy Sayyouh 4

01/17/23 Dr.Helmy Sayyouh 5

01/17/23 Dr.Helmy Sayyouh 7

01/17/23 Dr.Helmy Sayyouh 8

01/17/23 Dr.Helmy Sayyouh 9

01/17/23 Dr.Helmy Sayyouh 11

 We start with the flow equation in its finite difference

01/17/23 Dr.Helmy Sayyouh 12

01/17/23 Dr.Helmy Sayyouh 14

 The tri-, penta-, and hepta-diagonal matrix structures

01/17/23 Dr.Helmy Sayyouh 15

01/17/23 Dr.Helmy Sayyouh 16

 Simulating multiphase fluid flow in porous media involves

 The various solution techniques differ with respect to how

01/17/23 Dr.Helmy Sayyouh 17

 Obtain a single equation in which the sole unknown is

01/17/23 Dr.Helmy Sayyouh 18

 Generate a system of linear algebraic equations.

 The coefficients appearing in this system of equations

 When the solution for the phase pressure (e.g., Pw)

01/17/23 Dr.Helmy Sayyouh 19

 This enables us to determine the oil phase pressure

 Similar to the determination of Sw, after obtaining

01/17/23 Dr.Helmy Sayyouh 20

 Finally, using the capillary pressure relationship

 This completes one iteration; we then repeat the

 At the beginning of each iteration, all the pressure

01/17/23 Dr.Helmy Sayyouh 21

01/17/23 Dr.Helmy Sayyouh 22

 In setting the computer model, we face the problem of

 A11 x1 + a12 x2 + a13 x3 + ... +a1n xn = C1

01/17/23 Dr.Helmy Sayyouh 23

 and the unknown vector,

01/17/23 Dr.Helmy Sayyouh 24

01/17/23 Dr.Helmy Sayyouh 25

The band width for

01/17/23 Dr.Helmy Sayyouh 26

01/17/23 Dr.Helmy Sayyouh 27

Typical coefficient matrix generated

The D-2 ordering scheme is

 The resulting coefficient

01/17/23 Dr.Helmy Sayyouh 29

 Our goal is always to end up with a system of linear

 Two main categories of solution methods for the

01/17/23 Dr.Helmy Sayyouh 30

 For a direct solution, we assume that the machine

 A direct solution method will yield an exact solution

01/17/23 Dr.Helmy Sayyouh 31

 Is the fundamental algorithm used by direct

01/17/23 Dr.Helmy Sayyouh 32

 Is designed for tri-diagonal coefficient

 Simply avoid performing any arithmetic

01/17/23 Dr.Helmy Sayyouh 33

 Iterative solution methods involve making an initial

01/17/23 Dr.Helmy Sayyouh 34

 The simplest and best-known iterative