PIPE NETWORK ANALYSIS

System of Equations Governing Pipe Network

Dr. Mohammed Osama

Assistant Professor of Mechanical Power,
Faculty of Engineering, KFS University
Network Elements
 Branched and looped systems

In branched system, NP = NJ – 1 → NL = 0

In looped system, NP > NJ

 Definitions

• Fixed grade junction: is a pipes connecting point in the

network where energy or piezometeric head is known
(storage tank) [ NT … number of tanks or FGJ in
network].
• Node: is a point where two or more pipes join with
unknown elevation of energy (not FGJ) [ NJ … number
of nodes in network].
• Primary (real) loop: is a series of connected pipes that
begins and returns back to the same node. [NL …
number of real loops in the system] .
NL  NP  NJ for NT  2
NL  NP  NJ  1 for NT  2
 Storage Tanks

• Pseudo loop: are imaginary loop that begins from one tank to the
other tank.
• Pseudo loops are loops that do not close themself but considered for
solution to be energy consistent [ Nli … number of pseudo loops
required. Nli = NT – 1
• Pipes that was not appear in any energy equation in such networks
will appear in the pseudo-loop equation.
• For pseudo loop the energy equation is:  L  i i  WS
h   K Q 2
 Pipe Network Analysis
• Equations for steady flow in networks

– Q-equations (pipe charges are the unknowns)

– H-equations (heads are the unknowns)
When the equations are established (non-
linear), may use Newton method to solve them

– ΔQ-equations (corrective discharges are the

unknowns) – Classic, Hardy Cross iterative
method.
 At each node At each loop
Junction Continuity Equations Energy Loop Equations
(Node Law) (Loop Law)

 Q i  0  h   K Q
L i i
2
0
Qout  ve CW (+) : CCW (-)

Q in ve hL = head loss

Ki = coefficients
 OR
For NT < 2 For NT ≥ 2
Neqns = (NJ - 1)cont + (NL)energy Neqns = (NJ )cont + (NL)energy
Applied for all nodes,then
Neqns = (NJ )cont
 OR

Neqns = (NL )energy

 Example of H-equations for
the previous simple network
• Write each Q in the previous Q-eqs. system
in terms of head
1 1
 H1  H 2 
n1  H1  H 4 
n3
      4.45  0
 K 1   K 3 
1 1 1
 H H2   H2 H4 
n1  H2 H3 
n2 n4
 1         1.11  0
 K 1   K 2   K 4 
1 1
 H H3   H4 H3 
n4 n5
 2      3.34  0
 K 4   K 5 
1 1 1
 H1  H 4 
n3  H2 H4   H4 H3 
n2 n5
      0
 K 3   K 2   K 5 
 Example of ∆Q-equations for
the previous simple network

Loop 1-2-3: K 1 (Qo 1  Q1 )n  K 2 (Qo 2  Q1  Q 2 )n  K 3 (Qo 3  Q1 )n  0

Loop 4-5-2: K 4 (Qo 4  Q 2 )n  K 5 (Qo 5  Q 2 )n  K 2 (Qo 2  Q1  Q 2 )n  0
 Example of network with
more than one elevated tanks
Write the systems of Q-equations, H-equations, ∆Q-equations for the shown network. In these
equations use the parameters Ki and ni , in which i is the pipe number.

Q-eqs. system :
 Example (Cont.)

H-eqs. system :
 Example (Cont.)

∆Q-eqs. system :
Example: Write down the ∆Q system of equations for the
following network
 Valves in pipe network

 h   (K
L i  K v / 2gA )Q  0
2
v i
2
Example with pumps and valves
Example with pumps and valves
(Cont.)
Q- system of equations:
Example(Cont.)

H- system of equations:
Example(Cont.)

∆Q- system of equations:

 Special Types of Valves

• Back pressure valve

• Pressure reducing valve
 Pressure Reducing Valve
(PRV)
The PRV limits and maintains outlet (downstream)
pressure to lower preset value regardless of fluctuating
demand or varying upstream pressure

open closed

Low downstream pressure High downstream pressure

Valve will begin to open when the pressure

downstream is less than the set-point pressure
(determined by the force of the spring).
HGL of a Network Using PRV
 Back Pressure Valve
sets minimum pressure upstream

open closed

High upstream pressure Low upstream pressure

Valve will begin to open when the pressure upstream is
greater than the set-point pressure (determined by the
force of the spring).
Similar to pressure relief valve
HGL of a Network Using PSV

PSV = Pressure Sustaining valve

Analysis of Network Having
PRV / BPV
(Q - equations)
1) Write the continuity equations for the network as usual (Not
effected with PRV / BPV).
2) Remove the PRV / BPV from the network replacing it with:
• an artificial reservoir is placed at downstream / upstream
(set) point with known HGL = Hset , and,
• a Demand node at the upstream / downstream point with
unknown outflow.
3) Write the energy equations around the loops of this modified
network.

Q-equations:
• Continuity @ nodes (Step 1)
• Energy @ loops (Step - 3 )
 Analysis of Network Having
PRV / BPV
(H - equations)
1) Write the continuity equations for the network as usual (Not
effected with PRV / BPV).
2) Remove the PRV / BPV from the network replacing it with:
• an artificial reservoir is placed at downstream / upstream
(set) point with known HGL = Hset , and,
• an unknown head Hv at the upstream / downstream point.
3) Additional proportionality equations are obtained by: head
losses in the upstream and downstream portions of the pipe
containing the valve are proportional to these two lengths.

H-equations:
• Continuity @ nodes (Step 1) in terms of H.
• Additional Proportionality eqn.
 Analysis of Network Having
PRV / BPV
(∆Q - equations)
1) Find out the ∆Q set of loops for the original network upon
which we know the discharge in each pipe.
2) Remove the PRV / BPV from the network replacing it with:
• an artificial reservoir is placed at downstream / upstream
(set) point with known HGL = Hset , and,
• a Demand node at the upstream / downstream point with
unknown outflow.
3) Write the energy equations around the loops of this modified
network but using the original-network corrective flow.

The ΔQ loops ignore the presence ∆Q-equations:

of the BPV in this network, but the Energy @ loops for modified network
energy loops will be written for the (Step - 3 ) but with flows of original-
modified network network loop corrective flow (Step - 1).
Thus the energy set of loops will always contain more pseudo loops than does the ΔQ
set of loops by the number of PRV's and/or BPV's that exist.
 Example (PRV)

For the 9 pipes and

6 nodes networks
shown, write the
system of :
• Q-equations,
• H-equations, and
• ∆Q equations.
 Q- system of equations
Step (1):
Write independent junction continuity equations according
to the usual rules:
 Q- system of equations (cont.)
Step (2):
Replace the PRV
with a reservoir at
the downstream (set)
point and a demand
at upstream side
 Q- system of
equations (cont.)
Step (3):
Write the energy
equation for the loops
of the modified
network.

Loop 2-3-7

Loop 1-7-4

Loop 4-5-6
H- system of
equations
H-equations:
• Continuity @ nodes (Step 1) in
terms of H.
• Additional Proportionality eqn.
 ∆Q- system of equations
Step (1):
Find out the ∆Q loops for
the network ignore the
presence of the PRV/BPV.

Pipe Discharge ∆Q1

∆Q3
1 Q1 - ∆Q3
2 Q2 +∆Q1- ∆Q3
3 Q3 -∆Q1+ ∆Q3 ∆Q2
4 Q4 + ∆Q3
5 Q5 + ∆Q2
6 Q6 - ∆Q2
7 Q7 -∆Q1+∆Q2
 ∆Q- system of equations (cont.)
Step (2):
Replace the PRV
with a reservoir at
the downstream (set)
point and a demand
at upstream side
∆Q- system of
equations (cont.) I

Step (3):
II
Write the energy
equation for the loops of
the modified network
with Qs from step(1). III

Loop I (2-3-7)
Pipe Discharge
1 Q1 - ∆Q3
2 Q2 +∆Q1- ∆Q3
Loop II (1-7-4) 3 Q3 -∆Q1+ ∆Q3
4 Q4 + ∆Q3
5 Q5 + ∆Q2
Loop III (4-5-6) 6 Q6 - ∆Q2
7 Q7 -∆Q1+∆Q2
 Hardy Cross Method
for Pipe Network Analysis
1936

Dr. Mohammed Osama

Assistant Professor of Mechanical Power,
Faculty of Engineering, KFS University
 Hardy Cross Method

ΔQ-equations (corrective discharges for

each loop)
• Guess the discharge Qi for each pipe in the
Network. Comply with Node rule .
• Our Guess is noted (Q ± ∆Q), where ∆Q is the
error in our guess for each loop.
• Apply with guessed discharge in loop law.
 Mathematical Review
Finding Zeros (Roots) of a
function
Graphical Depiction:

f (x n )  0
 f '(x n )
x n  x n 1
f (x n )  0  f '(x n ) (x n  x n 1 )
 Mathematical Review
Taylor’s Series

Mathematical Derivation:
• This can also be seen from Taylor’s Series.
• Assume we have a guess, x0, close to the actual root.
Expand f(x) about this point.
x n 1  x n  x
x 2
f (x n  x )  f (x n )  xf (x n )  f (x n )  0
2!
• If dx is small, then dxn quickly goes to zero.
f (x n )
x  x n 1  x n  
f (x n )
 Mathematical Review
Finding Zeros of a function:
An illustrative Example
Convergence

Local Convergence
Convergence Depends on a Good Initial Guess
f(x)

1 1
x x
2 0 0 X
x x x
 Hardy Cross Method (Cot.)
Based on Previous Numerical
Analysis Review
F (Q )    K i  (Q i ) n  0

From numerical methods for finding zero,s (solving) a function

F (Q i ) F (Q i )
Q i 1  Q i   Q i 1  Q i  
F (Q i ) F (Q i )
F (Q i )
Q  
F (Q i )

For each loop Q  

 i i
 K  (Q ) n


 h L ,i

n i  K i  (Q i ) n 1
n h i L ,i / Qi
 Hardy Cross Method (Cot.)

For loop with valves, pump, turbine, and tanks

n  pipe
F (Q i )   i
  K i  (Q i ) ni  K v / 2 gA 2v (Q i ) 2 h p  hT   W S

0 real loop
where W S 
W S end  W S start imaginary loop

n  pipe

F (Q i )    K i  (Q i ) ni  K v / 2 gA 2v (Q i ) 2 h p  hT   W S
Q    i

F (Q i ) n  pipe
 d h p d hT 
 n i 1
  n i K i  (Q i )  K v / gA v (Q i ) dQ  dQ 
2

i  i i 
n  pipe

   K i  (Q i ) ni  K v / 2 gA 2v (Q i ) 2
 A p  B pQ i  C pQ i 2    AT  BT Q i  C T Q i 2    W S
 i
n  pipe

   n i K i  (Q i ) ni 1  K v / gA 2v (Q i )
 B p  2C pQ i    BT  2C T Q i  
i
 Hardy Cross method
Calculation procedures
Steps in Hardy Cross Method:
1) Assume initial values Q 0 , for all pipes with continuity
satisfied at all nodes.
2) For each loop or path, calculate:
  (k i Q i n )
Q 
(n i k i Q i n 1 )
3) Update Q in each pipe and in each loop by :
Qi  Q0 i  Q
4) Checking ( 0.01    0.05 ) IF NO → Repeat steps 2, 3
until satisfied
 Q i  Q 0 i

Q i
IF Yes → Stop iterations
Construct the following Table
for each loop
1-Loop Network Example

Loop 1-2-3-4: K 1 (Qo 1  Q1 )n  K 2 (Qo 2  Q1 )n

 K 3 (Qo 3  Q1 )n  K 4 (Qo 4  Q1 ) n  0
1-Loop Network Example
Solution
 1-Loop Network Example
Solution (cont.)

First trial

Pipe Q (L/s) HL (m) HL/Q

AB 60 2.0 0.033
BC 40 0.886 0.0222
CD 0 0 0
AD 40- 0.886- 0.0222
 2.00 0.0774
 1-Loop Network Example
Solution (cont.)
Second trial

Pipe Q (L/s) HL (m) HL/Q

AB 47.08 1.23 0.0261
BC 27.08 0.407 0.015
CD 12.92- 0.092- 0.007
AD 52.92- 1.555- 0.0294
 0.0107- 0.07775

Q  
 h L

 0.0107
 0.0688
2  h /Q
L i 2 (0.07775)
 1-Loop Network Example
Solution (cont.)
Modify the flow rates for solution after 2 iterations

Pipe Discharge
(L/s)
AB 47.15
BC 27.15
CD -12.22
AD -52.22
2-Loops Network Example
of Hardy Cross Method
Solutions
Pipe Network Analysis
Sheet (3)
More Examples on Hardy
Cross Method

Given that preasure at junction (a) is 3 bar

 0.2

0.12 0.08

0.22

K 1 (Qo 1  Q I ) n1  K 2 (Qo 2  Q I ) n 2  K 3 (Qo 3  Q I ) n3  K 4 (Qo 4  Q I ) n 4  0

 0.2

0.12 0.08

0.22
 0.2

0.12 0.08

0.22

Given that preasure at junction (a) is 3 bar

K 1 (Qo 1  Q ) n1  h p  K 2 (Qo 2  Q ) n 2  K 3 (Qo 3  Q ) n3  K 4 (Qo 4  Q ) n 4  0

Substitute with hp as a function of Q, thus,

F (Q)  K 1 (Qo 1  Q ) n1  (40  160 (Qo 1  Q ) 2 )  K 2 (Qo 2  Q ) n 2  K 3 (Qo 3  Q ) n3  K 4 (Qo 4  Q ) n 4  0
F (Q)  n1 K 1 (Qo 1  Q )n1 1  (2 160 (Qo 1  Q ))  n 2 K 2 (Qo 2  Q ) n 2 1  n 3 K 3 (Qo 3  Q ) n3 1  n 4 K 4 (Qo 4  Q ) n 4 1  0
F (Q)
Q  
F (Q)
K 1 (Qo 1  Q I )n1  K 6 (Qo 6  Q I  Q II )n6  K 5 (Qo 5  Q I )n5  K 7 (Qo 7  Q I )n7  0
K 2 (Qo 2  Q II )n2  K 3 (Qo 3  Q II )n3  K 4 (Qo 4  Q II )n4  K 6 (Qo 6  Q I  Q II )n6  0
K 2 (Qo 2  Q I  Q II )n 2  K 3 (Qo 3  Q I  Q II )n3  K 4 (Qo 4  Q I ) n 4  0
K 1 (Qo 1  Q II )n1  K 2 (Qo 2  Q I  Q II ) n 2
 K 3 (Qo 3  Q I  Q II )n3  K 5 (Qo 5  Q II )n5  40  0
 Linearization Theory
Linear Theory Method
(Simultaneous Pipe Method)
Wood - Charles 1972

Dr. Mohammed Osama

Assistant Professor of Mechanical Power,
Faculty of Engineering, KFS University
 Solution of the Q-Method
using Linearization
Let’s formulate the governing equations of the
given network using the Q-method then let’s
solve the obtained equations using
linearization.
 Solution of the Q-Method
using Linearization (Cont.)
• List all the governing equations to solve the
below network using the Q-method.
 Solution of the Q-Method
using Linearization (Cont.)
• Some of the governing equations are linear and
others are non-linear.

We have two avenues for the solution,:

• To deal with the set of equations as non-linear and to use Newton-
Raphson or other iterative solvers to solve the equations (will be
discussed later)
or,
• To linearize the equations and to make use of the efficient linear solvers.
 n 1
K i Q i  K i Qo i
n
Qi  K Qi
i
o

where
K io  K i Qo i n 1
 Solution of the Q-Method
using Linearization (Cont.)
• Let us carry out linearization of the following
set of equations:

Linearization: Substitute each non-linear term K i Q i n with K i Q i n 1 Q i

Loop1  2  3 : K 1 Q1n 1 Q1  K 2 Q 2 n 1 Q 2  K 3 Q 3n 1 Q 3  0
Loop4  5  2 : K 4 Q 4 n 1 Q 4  K 5 Q 5 n 1 Q 5  K 2 Q 2 n 1 Q 2  0
Then guess an intial value for Q i in the K i Q i n 1 term
 Solution of the Q-Method
using Linearization (Cont.)

• The set of equations eventually reduces to the

following linear system:

Loop 1  2  3 : K 1 Qo 1n 1 Q1  K 2 Qo 2 n 1 Q 2  K 3 Qo 3n 1 Q 3  0
Loop 4  5  2 : K 4 Qo 4 n 1 Q 4  K 5 Qo 5 n 1 Q 5  K 2 Qo 2 n 1 Q 2  0
 Solution of the Q-Method
using Linearization (Cont.)

The above linear set of equations can be written in

a matrix format as:

Where:
 Solution of the Q-Method
using Linearization (Cont.)
The value of the unknown {Qnew} can be obtained
using iteration as follow:

Where
Procedure for analysis by the
linear theory method
Step 1: Write Q-equations system
Step 2: Linearize the loop energy equation.
K i Q i n  K i Qo i n 1 Q i  K ioQ i
where , K io  K i Qo i n 1
Step 3: Assume initial pipe discharges Qo1, Qo2, Qo3, . . . . It is not
necessary to satisfy continuity equations. Then, find K io .

Step 4: Calculate pipe discharges. The equation generated is of the form

AX = B, which can be solved for Qi.
o
Step 5: Recalculate coefficients K i from the obtained Qi values.

Step 6: Repeat the process again until the calculated Qi values in two
consecutive iterations are close to predefined limits.
Q i  Qo i  1103
 Example
A single looped network as shown in figure has to be
analyzed by the Linear Theory Method for given inflow
and outflow discharges. The pipe diameters D and
lengths L are shown in the figure. Use Darcy–Weisbach
head loss–discharge relationship assuming a constant
friction factor f = 0.02.
 Solution

• The nodal discharge functions, and

• loop head-loss function

 Solution (cont.)

• loop head-loss function is linearized as:

F4  K o 1 Q1  K o 2 Q 2  K o 3 Q 3  K o 4 Q 4  0
• Assuming initial pipe discharges as 0.1 m3/s in all the
pipes, the coefficients for head-loss function are
calculated as:
 Solution (cont.)

• Thus the matrix of the form Ax = B can be written as :

• Solving the above set of linear equations, the pipe

discharges obtained are:
 Solution (cont.)
• Repeating the process, the revised head-loss
coefficients are:

• Solving the above set of linear equations, the pipe

discharges obtained are:
 Solution (cont.)

• Solving the above set of linear equations, the pipe

discharges obtained are

• Thus, the above are the final pipe discharges as the two
iterations provide the same solution.
Inverse of Matrix A-1 ?!
 Inverse of
Matrix A-1 ?!
(cont.)
Inverse of Matrix
A -1
?!
(one more example)
Matrix Multiplication(A-1 B) ?!
Newton Raphson Method
or simply
Newton Method

Dr. Mohammed Osama

Assistant Professor of Mechanical Power,
Faculty of Engineering, KFS University
 Features

• It is a numerical method for solving a large system of

non-linear equations simultaneously.
• It is applicable for the solution of all system-of-
equations:
 Q –equations,
 H –equations, or
 ∆ Q –equations.
• Faster Convergence
• The primary unknown variable will be called the vector
{ x }. Where x is Q, H, or ∆Q according to the used
analysis system for the network.
 Procedure
• The Newton iterative formula for solving a system of
equations can be written as

 X =  X  -  D F 
m+1 m -1 m

Where,
x
 [x] is an entire column vector of unknowns,
 [F] is an entire column vector of equations,
and
 [ D ]-1 is the inverse of Jacobian matrix [ D ].

Recall slides – 40 and 41 for solving a single non-linear equation:

The unknown vectors {x} and {F} replace the single variable x and function f and
1 1
the inverse of the Jacobian [ D ]-1 , replace  in the Newton-Raphson
f  df dx
formula for solving a single equation.
 Jacobian Matrix [D]

• It represents the following matrix of

derivatives:
 Solving the Q-equations
by Newton method
• If solving the equation with the heads as the
unknown, the vector [x] becomes the vector
[Q]. And, the Jacobian [ D ] is,
 Q1   F1 F1 F1 
 Q Q 2 Q j 
Q   1 
 2  F2

F2 F2 

Q  Q 3  ,  D   Q1 Q 2 Q j 
   
 
   F j F j F j 
Q j   Q Q j 
   1 Q 2

Q  = Q  -  D F 
m+1 m -1 m
 Example
(Q-eqns. System)
For the simple one loop network shown in figure,
find out the head at each node using the Newton
Method.
 Solution
(Q-eqns. System)

• The system of H-equations are:

 Solution (cont.)
(Q-eqns. System)
• The Jacobian matrix [D]
 F1 F1 F1 F1 F1 
 Q Q 2 Q 3 Q 4 Q 5 
 1 
 F2 F2 F2 F2 F2 
 Q Q 2 Q 3 Q 4 Q 5 
 1 
 F F3 F3 F3 F3 
 D   Q3 Q 2 Q 3 Q 4

Q 5 
 1
 F4 F4 F4 F4 F4 
 
 Q1 Q 2 Q 3 Q 4 Q 5 
 F5 F5 F5 F5 F5 
 
 Q1 Q 2 Q 3 Q 4 Q 5 

• Implementing the Newton method,

Q  = Q  -  D F 
m+1 m -1 m
 Solution (cont.)
(Q-eqns. System)
• With an initial estimate of pipes flow rates as:

• Substitute with guessed values in [D] and [F]:

 Solution (cont.)
(Q-eqns. System)
• For finding the inverse of the Jacobian matrix,

• Thus, the inverse of the Jacobian [D]-1 matrix is:

 Solution (cont.)
(Q-eqns. System)

• With the solution of the 1st iteration

 Solution (cont.)
(Q-eqns. System)
(1)
• Substitute with Q values in [D] and [F]:

• With the solution of the 2nd iteration:

Q  = Q  -  D F 
(2) (1) -1 (1)
 Solution (cont.)
(Q-eqns. System)
• One more cycle (3rd iteration) would yield the
final solution:
 Solving the H-equations
by Newton method
• If solving the equation with the heads as the
unknown, the vector [x] becomes the vector
[H]. And, the Jacobian [ D ] is,
 H1   F1 F1 F1 
 H   
H   1 H 2 H j

 2  F2 F2

F2 

 H    H 3  ,  D   1 2
H H H j 

   
 
   F j F j F j 
H j   H 
   1 H 2 H j 

H =  H  -  D F 
m+1 m -1 m
 Example - 1
(H-eqns. System)

For the simple one loop network shown in figure,

find out the head at each node using the Newton
Method.
 Solution
(H-eqns. System)

• The system of H-equations are:

 Solution (cont.)
(H-eqns. System)
• The Jacobian matrix [D]

• Implementing the Newton method,

H =  H  -  D F 
m+1 m -1 m
 Solution (cont.)
(H-eqns. System)
• With an initial estimate of the nodal heads as:

• From which we find that:

 Solution (cont.)
(H-eqns. System)
• With the solution of the 1st iteration:

H = H -  D F 
(1 ) (0) -1 (0)

• After completing 5 iterations the solution become

 Example - 2
(H-eqns. System)

For the branched three reservoirs network shown,

find out the head at the junction and the flow
discharge in each pipe.
 Solution
(H-eqns. System)

• The system of H-equations are:

 Solution (cont.)
(H-eqns. System)
• Implementing the Newton method,

H =  H  -  D F 
m+1 m -1 m

• As there is only one equation, the Jacobian

matrix [D] reduces to the derivative dF1 dH 1 and
the will be:
-1
 dF1 
H m+1
=H m
-   F1
m

 1
dH
 Solution (cont.)
(H-eqns. System)
• The derivative is:

• With an initial estimate of the nodal head H1= 85,

the first two iteration produce:
 Solving the ∆Q-equations
by Newton method
• If solving the equation with the heads as the
unknown, the vector [x] becomes the vector
[∆Q]. And, the Jacobian [ D ] is,
 Q1   F1 F1 F1 
 H H L 
 Q   1 H 2

 2   F2 F2 F2 
 
ΔQ   Q 3
 ,  D    H
 1
H 2 H 
L 
   
  
 LF  F  FL 

 Q j 
L
 H 1 H 2 H L 
 
ΔQ =  ΔQ  -  D F 
m+1 m -1 m
 Example
(∆Q-eqns. System)

For the same one loop network shown in figure,

analyze using discharge-correction equations
system and the Newton Method.
 Solution
(∆Q-eqns. System)

• The system of ∆Q -equations are:

• The energy equation around the pseudo loop becomes:

• The energy equation around the real loop is:

 Solution (cont.)
(∆Q-eqns. System)

• The Jacobian matrix [D] and the initial estimate

of flow rates Q(s) are:

• Implementing the Newton method,

ΔQ =  ΔQ  -  D F 
m+1 m -1 m
 Solution (cont.)
(∆Q-eqns. System)

• Starting with ∆Q1 = ∆Q2 =0, from which we find

that:

• From which the solution becomes:

 Solution (cont.)
(∆Q-eqns. System)
• After completing 3 iterations the
solution becomes:

• From these results, we can

compute the flow rates in each
pipe by adding these corrective
flow rates to the initially assumed
values of Q(s), which satisfy the
junction continuity equations.
Water Distribution Modeling
 WDS Simulation

• Simulation: the process of imitating the

behavior of one system through the
functions of another.
• refers to the process of using a
mathematical representation of the real
system, called a model.
 WDS Simulation (Cont.)

• Steady-State: a snapshot in time and are

used to determine the operating behavior
of a system under static conditions.

• Extended Period Simulation (EPS):

used to evaluate system performance over
time.
 Application of WDMs

• Long-range master planning, both new

development and rehabilitation
• Fire protection studies
• Water quality investigations
• Energy management
• System design
• Daily operational uses including operator
training, emergency response, and
• troubleshooting
Processing and Output
One of the Main Applications:
Water Distribution System
 THANKS
&
ANY QUESTIONS?