Ing. Melisabel Muñoz, Ph.D.

Groundwater

CH 2

Hydraulics Pipe Networks

Series, Parallel and Branch Pipes Water supply distribution systems in municipal
Flow districts are usually composed of a large number of
pipes interconnected to form loops and branches.
Although the calculations of Flow in a pipe network
involve a large number of pipes and may become
tedious, the solution scenario is based ont he same
principles that govern Flow in pipelines and branching
pipes previously discussed. In general, a series of
simultaneous equations can be written for the
network.

Departamento de Hidráulica,
Sanitaria y Ciencias del Ambiente
Facultad de Ingeniería Civil Melisabel Muñoz U.
Sep-22 2

1 2

CH 2 CH 2

Pipe Networks Pipe Networks

These equations are written to satisfy the following
conditions:

1. At any junction, ∑ 𝑄 = 0 based on the

conservations of mass (junction equation).

2. Between any two junctions, the total head loss is

independent of the path taken based on the
conservations of energy (loop equation).

Sep-22 3 Sep-22 4

3 4

CH 2 CH 2

Pipe Networks Pipe Networks

Depending on the number of unknowns, it is usually As a general rule, a network with 𝑚 loops and 𝑛
posible to set up a sufficient number of independent junctions provides a total of 𝑚 + 𝑛 − 1 independent
equations to solve the problema. equations.

A typical problem would be to determine the Flow

distribution in each pipe of a network, when the inflow
and outflows to the network are known. These
equations may be solved simultaneously.

Sep-22 5 Sep-22 6

5 6

Semester II - 2020 1
Ing. Melisabel Muñoz, Ph.D. Groundwater

CH 2 CH 2

Pipe Networks Pipe Networks

A set of 12 independent equations (8 junctions and 4 Two algorithms are commonly used for pipe network
loops) is needed to solve for the Flow distribution in analysis:
the 12 pipes.
1. Hardy Cross
2. Newton Raphson

Sep-22 7 Sep-22 8

7 8

CH 2 CH 2

Pipe Networks – Hardy Cross Pipe Networks – Hardy Cross

Is a method of successive approximations based on Is a method of successive approximations based on

1. At each junction the total inflow must equal the 2. The loss of head from Flow in the counterclockwise
total outflow (law of conservation of mass, or direction along pipes bc and cd must equal the loss
continuity law, or Kirchhoff`s first Law) of head from Flow in the clockwise direction along
pipes be and ed.

Sep-22 9 Sep-22 10

9 10

CH 2 CH 2

Pipe Networks – Hardy Cross Pipe Networks – Hardy Cross

The classical approach for solving these networks is to
use the Hardy Cross method. In this formulation, first
you go through and create guess values for the flows
in the network. The flows are expressed via the
volumetric flow rates Q. The initial guesses for the Q
values must satisfy the Kirchhoff laws (1).
That is, if Q7 enters a junction and Q6 and Q4 leave
the same junction, then the initial guess must satisfy
Q7 = Q6 + Q4. After the initial guess is made, then, a
loop is considered so that we can evaluate our second
condition.

Sep-22 11 Sep-22 12

11 12

Semester II - 2020 2
Ing. Melisabel Muñoz, Ph.D. Groundwater

CH 2 CH 2

Pipe Networks – Hardy Cross Pipe Networks – Hardy Cross

Given a starting node, we work our way around the
loop in a clockwise fashion, as illustrated by Loop 1.
We add up the head losses according to the Darcy–
Weisbach equation for each pipe if Q is in the same
direction as our loop like Q1, and subtract the head
loss if the flow is in the reverse direction, like Q4.
In other words, we add the head losses around the
loop in the direction of the loop; depending on whether
the flow is with or against the loop, some pipes will
have head losses and some will have head gains
(negative losses).

Sep-22 13 Sep-22 14

13 14

CH 2 CH 2

Pipe Networks – Hardy Cross Pipe Networks – Hardy Cross

Example 4.8

Sep-22 15 Sep-22 16

15 16

CH 2 CH 2

Pipe Networks – Hardy Cross Pipe Networks – Newton Method

Example 4.9 The Newton method is an appropriate and convenient
procedure for analyzing pipe networks containing a
large number of pipes and loops. In general, the
Netwton iteration method was developed to solve a set
of N simultaneous equations, 𝐹 , written as

𝐹 𝑄 ,𝑄 ,…,𝑄 …,𝑄 =0

where 𝑖 = 1 to N, and 𝑄 are the N unknowns.

Sep-22 17 Sep-22 18

17 18

Semester II - 2020 3
Ing. Melisabel Muñoz, Ph.D. Groundwater

CH 2 CH 2

Pipe Networks – Newton Method Pipe Networks – Newton Method

Sep-22 19 Sep-22 20

19 20

CH 2 CH 2

Pipe Networks – Newton Method Pipe Networks – Newton Method

Sep-22 21 Sep-22 22

21 22

CH 2 CH 2

Pipe Networks – Newton Method Pipe Networks – Newton Method

Example 4.10
Junction Equations

𝐹 = −𝑄 + 𝑄 + 𝑄

𝐹 = −𝑄 − 𝑄 + 𝑄 + 𝑄
𝐹 = 𝑄 +𝑄 −𝑄

𝐹 = 𝑄 −𝑄 +𝑄 Inflow path equation

betweeen reservoir A and G
𝐹 = −𝑄 − 𝑄 − 𝑄 + 𝑄
𝐹
=𝐻 −𝐾 𝑄 𝑄 −𝐾 𝑄 𝑄
ℎ = 𝐾𝑄 𝑄 +𝐾 𝑄 𝑄 +𝐾 𝑄 𝑄 −𝐻
Sum of hf around a 𝐿 1 16
closed loop must be =0 𝐾 = 𝑓
𝐷 2𝑔 𝜋 𝐷
𝐹 =𝐾 𝑄 𝑄 −𝐾 𝑄 𝑄 +𝐾 𝑄 𝑄

Sep-22 23 𝐹 = −𝐾 𝑄 𝑄 − 𝐾 𝑄 𝑄 + 𝐾 𝑄 𝑄 + 𝐾 𝑄 𝑄 24

23 24

Semester II - 2020 4
Ing. Melisabel Muñoz, Ph.D. Groundwater

CH 2 CH 2

Pipe Networks – Newton Method Pipe Networks – Newton Method

Example 4.10 Example 4.10
Junction Equations 𝐴 𝐵 = 𝐶 𝐵 = 𝐴 𝐶
𝐹 = −𝑄 + 𝑄 + 𝑄 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄
𝐹 = −𝑄 − 𝑄 + 𝑄 + 𝑄 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄
𝐹 = 𝑄 +𝑄 −𝑄 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 ∆𝑄
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝐹
∆𝑄
𝐹 = 𝑄 −𝑄 +𝑄 Inflow path equation 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 ∆𝑄
𝐹
betweeen reservoir A and G 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 ∆𝑄
𝐹
𝐹 = −𝑄 − 𝑄 − 𝑄 + 𝑄 𝐴= 𝐹
𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝐵 = ∆𝑄 𝐶=−
𝐹 ∆𝑄
𝐹
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝐹
=𝐻 −𝐾 𝑄 𝑄 −𝐾 𝑄 𝑄 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 ∆𝑄
𝐹
+𝐾 𝑄 𝑄 +𝐾 𝑄 𝑄 −𝐻 ∆𝑄
Sum of hf around a 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄
∆𝑄
𝐹
ℎ = 𝐾𝑄 𝑄 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹
closed loop must be =0
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄
𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹
𝐹 =𝐾 𝑄 𝑄 −𝐾 𝑄 𝑄 +𝐾 𝑄 𝑄
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄

𝐹 = −𝐾 𝑄 𝑄 − 𝐾 𝑄 𝑄 + 𝐾 𝑄 𝑄 + 𝐾 𝑄 𝑄 25 Sep-22 26

25 26

CH 2 CH 2

Pipe Networks – Newton Method Pipe Networks – Newton Method

Example 4.10 Example 4.10
𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝐹 = 𝐹 = −𝑄 − 𝑄 − 𝑄 + 𝑄
= −1 =1 =1 =0 =0 =0 =0 =0
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄

𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹
𝐹 =𝐹 =𝐾 𝑄 𝑄 −𝐾 𝑄 𝑄 +𝐾 𝑄 𝑄
𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹
=0 = −1 =0 = −1 =1 =0 =0 =0
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄
𝐹 =𝐹 = −𝐾 𝑄 𝑄 − 𝐾 𝑄 𝑄 + 𝐾 𝑄 𝑄 + 𝐾 𝑄 𝑄
𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹
=0 =0 =0 =1 =0 =0 =1 = −1
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄
𝐹 =𝐹 =𝐻 −𝐾 𝑄 𝑄 −𝐾 𝑄 𝑄 +𝐾 𝑄 𝑄 +𝐾 𝑄 𝑄 −𝐻
𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹
=0 =0 =0 =0 =0 =1 = −1 =0
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄

𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹
=0 =0 = −1 =0 = −1 = −1 =0 =0
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕8
𝐹 = 𝐹 = −𝑄 + 𝑄 + 𝑄
𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹
=0 = 2𝐾 𝑄 = −2𝐾 𝑄 =0 = 2𝐾 𝑄 =0 =0 =0
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄
𝐹 = 𝐹 = −𝑄 − 𝑄 + 𝑄 + 𝑄
𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹
𝐹 =𝐹 = 𝑄 +𝑄 −𝑄 𝜕𝑄
=0
𝜕𝑄
=0
𝜕𝑄
=0
𝜕𝑄
= −2𝐾 𝑄
𝜕𝑄
= −2𝐾 𝑄
𝜕𝑄
= 2𝐾 𝑄
𝜕𝑄
= 2𝐾 𝑄
𝜕𝑄
=0

𝐹 =𝐹 = 𝑄 −𝑄 +𝑄 𝜕𝐹
= −2𝐾 𝑄
𝜕𝐹
= −2𝐾 𝑄
𝜕𝐹
=0
𝜕𝐹
= 2𝐾 𝑄
𝜕𝐹
=0
𝜕𝐹
=0
𝜕𝐹
=0
𝜕𝐹
= 2𝐾 𝑄
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄

Sep-22 27 Sep-22 28

27 28

CH 2 CH 2

Pipe Networks – Newton Method Pipe Networks – Newton Method

Example 4.10 Example 4.10
𝜕𝐹
𝜕𝑄
= −1
𝜕𝐹
𝜕𝑄
=1
𝜕𝐹
𝜕𝑄
=1
𝜕𝐹
𝜕𝑄
=0
𝜕𝐹
𝜕𝑄
=0
𝜕𝐹
𝜕𝑄
=0
𝜕𝐹
𝜕𝑄
=0
𝜕𝐹
𝜕𝑄
=0 𝐴 𝐵 = 𝐶 𝐵 = 𝐴 𝐶
𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹
𝜕𝑄
=0
𝜕𝑄
= −1
𝜕𝑄
=0
𝜕𝑄
= −1
𝜕𝑄
=1
𝜕𝑄
=0
𝜕𝑄
=0
𝜕𝑄
=0 𝐹 = −𝑄 + 𝑄 + 𝑄

𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝐹 = −𝑄 − 𝑄 + 𝑄 + 𝑄
=0 =0 =0 =1 =0 =0 =1 = −1
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄
𝐹 = 𝑄 +𝑄 −𝑄
𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝐹
=0 =0 =0 =0 =0 =1 = −1 =0
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄
𝐹 = 𝑄 −𝑄 +𝑄 𝐹
𝐹
𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝐹
𝜕𝑄
=0
𝜕𝑄
=0
𝜕𝑄
= −1
𝜕𝑄
=0
𝜕𝑄
= −1
𝜕𝑄
= −1
𝜕𝑄
=0
𝜕8
=0 𝐹 = −𝑄 − 𝑄 − 𝑄 + 𝑄 𝐶=−
𝐹
𝐹
𝜕𝐹
=0
𝜕𝐹
= 2𝐾 𝑄
𝜕𝐹
= −2𝐾 𝑄
𝜕𝐹
=0
𝜕𝐹
= 2𝐾 𝑄
𝜕𝐹
=0
𝜕𝐹
=0
𝜕𝐹
=0
𝐹 =𝐾 𝑄 𝑄 −𝐾 𝑄 𝑄 +𝐾 𝑄 𝑄 𝐹
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄
𝐹
𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝐹 = −𝐾 𝑄 𝑄 − 𝐾 𝑄 𝑄 + 𝐾 𝑄 𝑄 + 𝐾 𝑄 𝑄
=0 =0 =0 = −2𝐾 𝑄 = −2𝐾 𝑄 = 2𝐾 𝑄 = 2𝐾 𝑄 =0
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄
𝐹 = 𝐻 −𝐾 𝑄 𝑄 −𝐾 𝑄 𝑄 +𝐾 𝑄 𝑄 +𝐾 𝑄 𝑄 −𝐻
𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹 𝜕𝐹
= −2𝐾 𝑄 = −2𝐾 𝑄 =0 = 2𝐾 𝑄 =0 =0 =0 = 2𝐾 𝑄
𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄 𝜕𝑄

Sep-22 29 Sep-22 30

29 30

Semester II - 2020 5
Ing. Melisabel Muñoz, Ph.D. Groundwater

CH 2

Pipe Networks – Newton Method

Example 4.10
𝐴 𝐵 = 𝐶 𝐵 = 𝐴 𝐶

∆𝑄
∆𝑄
∆𝑄
∆𝑄
𝐵 = ∆𝑄
𝑄 =𝑄 + ∆𝑄
∆𝑄
∆𝑄
∆𝑄
∆𝑄

Sep-22 31

31

Semester II - 2020 6