See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/245296719

Efficient Solution Technique for Dendritic Channel Networks Using FEM

Article  in  Journal of Hydraulic Engineering · August 1998

DOI: 10.1061/(ASCE)0733-9429(1998)124:8(831)

CITATIONS READS

33 57

2 authors, including:

D. Sen
Indian Institute of Technology Kharagpur
27 PUBLICATIONS   322 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Kolkata rainfall monitoring View project

All content following this page was uploaded by D. Sen on 26 April 2017.

The user has requested enhancement of the downloaded file.

 EFFICIENT SOLUTION TECHNIQUE FOR DENDRITIC CHANNEL
NETWORKS USING FEM

By D. J. Sent and N. K. Gar~

ABSTRACT: This paper presents an efficient solution algorithm for one-dimensional unsteady flow routing
through a dendritic channel network system. The finite element method is used to solve the Saint Venant
equations in all branches of the network simultaneously. The maximum active memory required is only 2N X
2N, where N = number of branches in the network. Importantly, the algorithm does not require any special node
Downloaded from ascelibrary.org by Indian Inst Of Technology Library, Kharagpur on 04/26/17. Copyright ASCE. For personal use only; all rights reserved.

numbering schemes, and the nodes or elements can be numbered independently for each branch. The algorithm
is also suitable for programming using a parallel processing computer. The solution technique can also be
extended to finite difference methods.

INTRODUCTION cessors. Even on a serial machine, it requires much less mem-

Different streams join to develop a network of channels that
drain off an area. Channel network systems are often dendritic,
and the flows in the branches are generally subcritical. It is
necessary to solve the relevant equations in all the branches
simultaneously (Akan and Yen 1981; Choi and Molinas 1993).
A survey of literature shows that mathematical simulation of
flow in channel networks, even in a single channel, has mostly
been attempted through finite difference schemes. Many re-
searchers, including Cunge and Wegner (1964), Fread (1973),
Wood et al. (1975), Kao (1980), Akan and Yen (1981), Schaf-
franeak et al. (1981), Joliffe (1984), Ball (1985), Choi and
Molinas (1993), Nguyen and Kawano (1995), and others, have
presented different methods of minimizing the computational
efforts involved in solving the flow problem in channel net-
works based on the finite differene method. The finite element
method has been used recently to simulate open channel flows.
Cooley and Moin (1976), Keuning (1976), King (1976), Nwa-
ogazie and lYagi (1984), and others have used this method to
simulate flow in a single branch of a channel. Also, Adeff and
Wang (1985) and Szymkiewicz (1991) have successfully used
this method to simulate flow in a general network of channels.
However, no special algorithm has been presented to solve the
resulting system of nonlinear equations for channel network
systems efficiently.
When the Saint Venant equations, together with the junction
and energy conservation for flood routing through channel net-
works, are employed to describe the flow, the resulting coef-
ficient matrix involved in the solution process is not banded.
A large amount of computer storage and a very expensive
execution time is thus required to store and solve these non-
banded matrix equations. The purpose of this study is to de-
velop a procedure to store and solve the resulting finite ele-
ment equations efficiently for a dendritic channel network
system. The algorithm reduces the nodal equations to one node
for each branch in a forward elimination phase. These nodes
correspond to the downstream end of each branch. The prob-
lem is reduced to solve the corresponding equations simulta-
neously, and the remaining unknown variables of the branches
are solved independently for each branch in a backward sub-
stitution phase. A major advantage of this algorithm is that it
may easily be programmed on a computer having parallel pro-
'Central Water COmIn., Sewa Bhawan, R. K. Puram, New Delhi
110066, India.
'Dept. of Civ. Engrg., lIT Delhi, Hauz Khas. New Delhi 110016. India.
Note. Discussion open until January I, 1999. To extend the closing
date one month, a written request must be filed with the ASCE Manager
of Journals. The manuscript for this paper was submitted for review and
possible publication on February 29, 1996. This paper is part of the lour-
nal of HydrauUe Enginemng, Vol. 124, No.8, August, 1998. CASCE.
ISSN 0733-9429/98/0008-0831-0839/$8.00 + $.50 per page. Paper No.
12795.
ory, because the reduced coefficients are stored branchwise.
Also, the proposed algorithms do not require any special node
numbering schemes.
GOVERNING EQUATIONS AND BOUNDARY
CONDITIONS
The governing equations for simulating gradually varied un-
steady flow are described by the well known Saint Venant
equations. These equations may be derived from the laws of
conservation and momentum and may be expressed as follows:
8Q 8 ((1)
fu + 8x A + gA
8h
8x + gASf - gASo =0 (1)
8h + 1. 8Q _ 9. = 0 (2)
8t B 8x B
where t = time; x = longitudinal distance; Q = discharge; h =
water depth; A and B = cross-sectional area and free-surface
width; So = bed slope; Sr = friction slope; q = rate of lateral
inflow; and g = acceleration due to gravity. For channel flow,
Sf may be estimated by any of the flow resistance equations,
for example, Manning's equation:
(3)
where n = Manning's roughness coefficient; and R = hydraulic
radius.
It is to be noted that the equations of continuity and mo-
mentum are applied only within the channel branch lengths,
and different relations are used to link the flow variables at
the confluences. The hydraulic conditions at the confluences
may be described by the equations of mass and energy con-
servation. Assuming no change in storage volume within the
confluence, the continuity equation can be written as
(4)
where i stands for the inflow branches and 0 stands for the
outflow branch. When the flows in all branches meeting at a
confluence are subcritical, the equations of energy conserva-
tion can be approximated by a kinematic compatibility con-
dition as (Akan and Yen 1981)
(5)
where Z = elevation of the channel bed. If the bed elevations
of the inflow and outflow channels meeting at a confluence
are assumed to be the same, then (5) simplifies to
(6)
Eqs. (4) and (6) constitute the interior boundary conditions
JOURNAL OF HYDRAULIC ENGINEERING / AUGUST 1998/831

J. Hydraul. Eng., 1998, 124(8): 831-839


Downloaded from ascelibrary.org by Indian Inst Of Technology Library, Kharagpur on 04/26/17. Copyright ASCE. For personal use only; all rights reserved.
FIG. 1. Dendritic Network Showing Different Categories of Branches
at the confluences and will be referred to in this paper as the
Q-ib and h-ib conditions, respectively. The total number of
interior boundary conditions at a confluence is equal to the
number of channels meeting at the junction. At each of the
confluences, the downstream ends of the inflow branches are
imposed with the h-ib conditions and the upstream end of the
outflow branch is imposed with the Q-ib condition. Other in-
terior boundary conditions may occur within a single branch,
e.g., due to a weir, constrictions like bridges, etc. However,
these conditions are omitted in the present study, because ap-
plication of these is very straightforward and no special mod-
ification of the algorithms is required.
At the outlet of a dendritic network, a depth-discharge re-
lation or a depth-time variation has to be specified (Cunge et
al. 1980). Because this condition appears at the exterior of a
channel network system and relates the water depth at a point
to some function, it is referred to as an h-eb exterior boundary
condition. In addition, the discharge values as a function of
time are also specified at the upstream ends of the dendritic
tree as a part of exterior boundary condition and will be re-
ferred to as Q-eb conditions in the present study.
It may be observed that any branch of the dendritic network
will have either a Q-ib or a Q-eb condition at its upstream end
and either an h-ib or an h-eb condition at its downstream end.
On the basis of this observation, branches may be classified
into three categories (Fig. 1):
1. Branches with a Q-eb condition at the upstream end and
an h-ib condition at the downstream end (branch type
"ei" in Fig. 1)
2. Branches with a Q-ib condition at the
an h-ib condition at the downstream
"ii" in Fig. 1)
3. Branches with a Q-ib condition at the
an h-eb condition at the downstream
upstream end and
end (branch type
upstream end and
end (branch type
"ie" in Fig. 1)
The problem thus requires computation of the dependent
variables at specified intervals of time t along the branches.
The computations are started by solving (1) and (2) with the
initial, exterior, and interior boundary conditions.
832 I JOURNAL OF HYDRAULIC ENGINEERING I AUGUST 1998
J. Hydraul. Eng., 1998, 124(8): 831-839
BOUNDARY CONDITIONS
EXTERNAL INTERNAL
!O-eijl ~a-ib~
h-eb
@ ®e TYPE OF BRANCH
DERIVATION OF ELEMENT MATRICES
To demonstrate the basic philosophy and essential steps in-
volved, the channel network system is discretized into one-
dimensional linear elements. However, the same logic will also
remain applicable for the higher order elements. In the pro-
posed solution scheme, each branch may be numbered inde-
pendently. For example, a three-branched network [Fig. 2(a)]
is discretized as shown in Fig. 2(b). The nodes have been
numbered as b· j, the symbol standing for the jth node of the
bth branch. The branches may be numbered arbitrarily, but the
connectivity of the branch at each confluence will be required
while applying the interior boundary conditions.
The finite element method is used with the Galerkin
weighted residual principle to solve (1) and (2). In general, a
branch is divided into K number of linear elements with nodes
numbered from b· 1 to b· (K + 1). Th nodes may be numbered
either from the upstream end proceeding to the downstream
end of a branch or vice versa, but for the present, all branches
have been numbered proceeding upstream from the down-
stream end.
Applying the Galerkin technique and solving (1) and (2),
the element equations for an element e, with local nodes 1 and
2, can be written as
[X]' 8<1>}' +
{Sf {Y}' (7)
where {8<1>/8t} is the temporal derivative of the variable vector
{<I»} and
{~}'. {H (8)
in which Qi and hi = discharge and depth at the local node i
of element e.
As linear shape functions are used, the matrix [X)' will be
composed of four submatrices, each of size 2 X 2, and matrix
{Y}' will be composed of two column submatrices, each of
size 2 X 1. It may be noted that {Y}' is nonlinear and will
Downloaded from ascelibrary.org by Indian Inst Of Technology Library, Kharagpur on 04/26/17. Copyright ASCE. For personal use only; all rights reserved.
Branch I
la) lb.,
FIG. 2. (a) Three Branched Dendritic Network; (b) Three Branches Idealized by Linear One-Dimensional Elements; (c) Application of
Boundary Conditions
be a function of {4»}. Because the objective of this paper is
to develop a methodology to assemble and solve the resulting
finite element equations, the details regarding the derivation
of the element matrices are omitted. The element matrices can
be derived with or without upwinding schemes, only effecting
a change in the numerical value of the elements of the matrices
[X]' and {V}'. No changes in the proposed algorithms will be
required.
ASSEMBLY OF ELEMENT MATRICES
Having formed the element matrices, the next step is to
assemble them. Because the governing equations are applied
branchwise, the element matrices pertaining to the branches
are assembled independently. A second assembly is then re-
quired to combine all the branch matrices into a global matrix.
It is here that the boundary conditions are applied. The vari-
ables of the different branches become interconnected through
application of the interior boundary conditions. For the three
branched network of Fig. 2(a), the applied boundary condi-
tions are shown in Fig. 2(c).
After replacing the temporal derivative of {4»} with a dif-
ference equation in time, the assembled equations of all
branches can be written as
[R]{4»} + {S} =0 (9)
where R = nonlinear assembled global coefficient matrix; S =
nonlinear assembled global right-hand-side vector; and 4» =
unknown vector at time (t + At).
It may be noted that [R] and [S] would be nonlinear func-
tions of {4»}; therefore, to solve (9), the Newton-Raphson
method is used. Denoting (9) as
!<cf) =0 (10)
a Jacobian matrix [W] and a column vector {F} may be
fonned such that
[W] = [o~] (11)
{F} =/(cf) (12)
corresponding to an initial guess of the variable {cf)} as {cf)h.
The error vector {4cf)} is then obtained from the following
equation:
[W]{Acf)} = {F} (13)
From (13), the error vector {44»} is calculated and the im-
J. Hydraul. Eng., 1998, 124(8): 831-839
IC)
proved values of the variables {4»} are worked out from the
relationship
{4»lr+1 = {cf)h - {44»} (14)
{4»}r is now replaced by {4»}r+h and (11)-(14) are repeat-
edly solved till {44»} decreases below a specified tolerance.
It may be noted that [W] may actually be formed by an
assembly of element Jacobian matrices [W)'. Similarly, {F}
may also be fonned by assembling element column vectors
{F}'.
EFFICIENT SOLVER
Matrix [W] would be banded except for some tenns arising
out of the implementation of the internal boundary conditions.
It is difficult to give a suitable node numbering scheme to
reduce the bandwidth for a general network flow problem.
However, for the proposed algorithms, the nodes of each
branch can be numbered independently [as shown in Fig.
2(b)], and the following paragraphs detail a simple method to
solve the error vector {A4»} from (13). The sample network
(Fig. 2) is used as an example to explain the various steps
involved in the algorithm.
To get a solution, (13) must be solved. To reduce the band-
width, the (Q, h) pairs of equations corresponding to the down-
stream nodes of each branch must be separated out and ar-
ranged as shown in Fig. 3. The matrix [W] thus converts into
a double-bound band fonn of matrix. This fonn is advanta-
geous in that a forward elimination may be perfonned for all
the variables corresponding to the nodes of the branches, ex-
cepting those of the lowest nodes, independently for each
branch.
By doing so, one is left with a 6 X 6 matrix relating to the
unknowns of the downstream end nodes of the example prob-
lem. These six equations are solved simultaneously to get the
error vector {Acf)} corresponding to the downstream node of
each branch, Le., nodes 1·1, 2 ·1, and 3·1 of the example
problem. These values are now used in a back substitution
phase to obtain the error vector for the remaining nodes of the
branches; this backward substitution phase can also be carried
out independently for each branch.
It may be noted that both the forward elimination and back
substitution processes may be carried out for one branch at a
time, the branches being taken in any order, thus requiring
very small active memory at any point in time. There is also
a significant reduction in the solution time because of the re-
duction in the bandwidth. Because the forward elimination and
backward substitution phases can be carried out independently
for each branch, it may be programmed on a parallel processor
JOURNAL OF HYDRAULIC ENGINEERING / AUGUST 1998/833
 tf#tf# 1## #
tf### 1## #
###### I #
tf##### I #
1 I -1-1 Q.e4-Q2eI-Qhl
##tf#
####
,-----
I
I ##
tf
------
#
#### I ## #
###### I #
Downloaded from ascelibrary.org by Indian Inst Of Technology Library, Kharagpur on 04/26/17. Copyright ASCE. For personal use only; all rights reserved.

###### I #
1 o 'e4- 00'e4 (t I
#### I #
#### I
1------
##"
------
#### I ##
**#
# # # # # #1 #
######1 #
I1 O'e4 - 0 Q h4 (t I
# # # #1 #
:# # ----I------I------I#"i---- --It---
1 I 1# 1 h lel-hh'el (0 lei)
1# # I I # # #
-11 I I 1 h 2el - h le4
I 1# # I # # #
I -11 1 1 hhl-h le4

FIG. 3. Global Equations Rearranged after Separating Lowest Node. of Each Branch

machine. Each processor may be given one branch to work branch, which are numbered from b·l through b '(K + 1) for
upon. The solution of a 2N X 2N matrix is found in one a general branch b; this is shown in Figs. 4(a-c) for subse-
operation by the host node of the parallel processors, where N quent use. The node numbering for the three types of branches
= number of branches in the network. already discussed would be similar.

ALGORITHMS IN A STRUCTURED FORM Phase 1: Forward Elimination Phase

The algorithms may be written in a phasewise manner. It is This phase is comprised of two parts, which are carried out
assumed that any branch of the network is divided into K independently for each branch. In the first part, the equations
number of linear elements. There would be K + 1 nodes in a corresponding to nodes b· 2 to b· K are reduced. In the second

o
t::0 rr.;:;;-n I
~Oddel
eel
be(K+I) ~Q-/I1 ij
be(K+ II

bel 0
O!'SJ
(01 (bl Ie)
FIG. 4. Details of Three Types of Branches Showing Node Numberlngs: (a) Branch Type "el"; (b) Branch type "II"; (c) Branch Type "Ie"

834/ JOURNAL OF HYDRAULIC ENGINEERING / AUGUST 1998

J. Hydraul. Eng., 1998, 124(8): 831-839

 part, the boundary conditions are applied, which relate the var-
iables of node b· (K + 1) to the corresponding variables of
other branches. This is followed by reduction of the equations
corresponding to node b· (K + 1). The boundary conditions
are not applied initially, as it would unnecessarily increase the
size of the active matrix.
1. Elimination of variable corresponding to nodes b· 2 to
b'K:
Form two matrices [MI] and {M2} for a branch. Let
[MI] be the assembled Jacobian matrix corresponding to
Downloaded from ascelibrary.org by Indian Inst Of Technology Library, Kharagpur on 04/26/17. Copyright ASCE. For personal use only; all rights reserved.
the element matrices of the second element are added as
shown in Fig. 7(b). The variables .iQb.2 and .ihb.2 are
now eliminated, because they will never appear in the
subsequent assembly. The reduced coefficients corre-
sponding to node 2 can be stored for a back substitution
phase, and the matrix coefficients are rearranged to add
to the next element. These steps are repeated until a final
form of the matrix is formed as shown in Fig. 8(a).
The relevant portions of the matrices shown in Figs.
6 or 8(a), which will now be considered in order to apply
the appropriate boundary conditions, are shown in Fig.

8(b).
element matrices [W)". Also, let {M2} be the assembled
2. Application of boundary conditions and elimination of
column matrix corresponding to column vectors {F}·.
variables corresponding to node b·(K + 1):
The equations corresponding to the downstream node
After incorporating the boundary conditions, the final
b·l are written at the end of the matrices. This arrange-
reduced matrix of Fig. 8(b) will be redefined depending
ment would look like that shown in Fig. 5. This is re-
on the branch type, as described below in the following:
quired because the variables corresponding to the down-
• Branch type "ei":
stream nodes of each branch are not to be eliminated in
The Q-eb condition is applied at the first equation of
a forward elimination process, but rather are to be solved node b· (K + 1), as shown in Fig. 9(a), and will finally
simultaneously after the end of the forward elimination reduce to Fig. 9(b) after eliminating the variables
phase. A double-bounded band matrix solver can be used
.iQb-K+1 and .ihb-K+I' The h equation corresponding to
efficiently to reduce the equations in this phase. The ma-
trix [MI] will look like Fig. 6 for any of the branches
after the end of the forward elimination phase. # # ## 6.0 .... #
The frontal concept can also be used to reduce the # # ## 6.1'1 "•• #
equations. Consequently, it will not be necessary to 6.0 ...,
model the full form of the assembled [MI] and {M2} 6.1'1 lie'
-
matrices. The variables can be eliminated at the element
level; thus, a matrix size of more than 6 X 6 for linear
#tt # tt 6.0"., #
elements will never be required. Because the downstream # # # # 6.1'1 .., #
node will not be eliminated, the element matrices for the
( 0 )
first element are arranged as shown in Fig. 7(a). Next,

#### ## #
###### 6.0 .... #
6. 0 ...
##It# ## 6. h ••• # ###### 6.1'1 "eI #
##ltlt## 6. 0 ••, # #### 6.0 lie, #
#It#### 6. h ••1 #
#### =
###### It 6.1'1"., #
###### # # # ##
###### 1\ 6.0 lie I #
= -## # #
######
######
# 6.1'1 ".1 #
#
It##### #
#### tJ. 0 " # (b)
#### 6. h .., " #
It# ## 6. 0,., # FIG. 7. (a> Arrangement of Element Matrix for Element 1; (b>
#It ## A h •• 1 Assembled Matrix of Elements 1 and 2
**
###### 6.0 ".IC #
[M 1] {M2} ##### 6.1'1 ...1< #
#### 60""1C+1I #
FIG. 5. Arrangement of A..embled Matrices for Branch b
#### 61'1 "',K+IJ -#
#### 60 ..., #
1111## #It '#
# It II # # #
#### 61'1 h i #
#1*## ## '#
### !tit :#
###11 #It (0)
# # It 1* # **
#

~u
#### #It #

;]j
#

""'' j
In
It II It # # It
#####1* It ## (j h ".11<+11
## #**
#1*###
1* # It It
#
110
(jo ... , -
6. a " It
It It # # It
# # # #
6. h
t:, 0",
"
# ## # (jh hi
1* It # 1* t:, h.o ' It

(b)
[M 1]
FIG. 8. (a> Final Reduced Matrix after Aseembly of Laat EI.
FIG. 6. Matrix Structure after End of Elimination Phase 1 ment; (b) Active Matrix for Further Consideration

JOURNAL OF HYDRAULIC ENGINEERING / AUGUST 1998/835

J. Hydraul. Eng., 1998, 124(8): 831-839

 node b· 1 can be ignored, because the h boundary con- LI 0 ,• ,
LI h h '
dition corresponding to this node will be applied later on LlO..,
while considering the corresponding downstream conflu-
ence outflow branch. . ·
LI hh'

• Branch type "ii" or "ie":

The Q-ib condition is applied to the Q equation of
• • • • • •
· . ~ ** • • # • • • ~ • • • • • LI a ••,

·
LI h •• ,

node b· (K + 1). This relates the continuity of the dis-

.. . LI a ••,
=
charges at its upstream confluence point. Therefore, the
Q variables corresponding to the nodes c . 1 and d· 1 will · .
.••..• ##··**1··#··· .. · li h •• 1
· .
l*

also appear in this equation while applying the Q-ib con- .. LI 0 •• ,

dition. The h equations corresponding to nodes C' 1 and
· .
•••••• *1:1*··#···**1····
·
LI h ••,
Downloaded from ascelibrary.org by Indian Inst Of Technology Library, Kharagpur on 04/26/17. Copyright ASCE. For personal use only; all rights reserved.

d· 1 are also considered at this point and have been

equated to hb-K+l in order to satisfy the h conditions at LIa•• ,
this confluence point. The resulting matrix would look LI h ••,

like that shown in Fig. lO(a). The variables aQb.K+l and FIG. 11. Storing Final Reduced Equations In Global Matrix of
ahb .K + 1 can now be eliminated, and the matrix would Downstream Nodes
look like that shown in Fig. lO(b). For reasons similar
to those given for branch type "ei," the h equation cor-
responding to node b·1 for branch type "ii" is ignored. boundary condition. Also, the equations corresponding to
For the "ie" type branch, the h equation would obvi- aQc.l and AQd'l will be ignored, because they will be
ously be ignored because of the external downstream considered at appropriate places while applying the Q-ib
conditions at nodes c· (K + 1) and d· (K + 1), respec-
tively. It may be noted that we have assumed only two
1 °
6 .elK+'1 °.. IK+II - OO••IK+II I t I inflow branches at each confluence purely for demon-
stration purposes. For more inflow branches, the matrices
"# # "# # 6 h .elK+1I "#
= of Fig. 10 may be suitably modified incorporating the
# # # # b 0 ••, # boundary conditions.
# At this stage, the highlighted sections of the matrices
# "# # # bh h' shown in Figs. 9(b) or lO(b) (depending upon the type
I Q)
of branch) will be the only remaining active portions to
be appropriately stored. This portion of the matrix, when
kept in the global matrix of downstream nodes, will look
b ° .elK+1I °"111+11 - OO•• 'K+II I t) like that shown in Fig. 11.
# # # b h ••111+11 #

U bO h ,
0 Phase 2: Solution of Lower Node Equations
# # bh hi *I The lower node equations for the example problem (Fig. 2),
kept in the global matrix form, will look like that shown in
Ibl
Figs. 12(a) and (b) respectively before and after incorporating
FIG. 9. Final Reduced Form of Matrix for Branch 'TYpe "el": (a) the outlet boundary condition, e.g., in the form of a rating
Application of Q . .b Condition; (b) Reduction of Variables for curve. Now these equations are solved simultaneously to give
Nodeb·(K+ 1) the nodal unknowns for the downstream nodes of all branches.

1 -1 -1 r LlOhCK+1I a...K+II-0•• ,-0,.•• # # # 60,_, ~

** ** ** ** Llh••'II+1I # **
LI h 1.1
Llo".,
-1 Llh•• 1 6 °2" #
h•• ,-hh'II+1J
** **
Aa..., # "# # 6 h2" #
**
-1 Ah••, h•• j'hh'KtIl 11 # Ll03'/ #
** "# 6~., "#
** ** II h 3 .,
** ** ** **
Llh h , "# ** ** ** ** **
la) tal

-1 -1 A~.III+II ~.IK+II-O",-O,.,
"* ** lIOI·'
"" "* '** 6h"'I1+11
"" ** ** ** **
Llo"., 6 h).) h 1')- hh'·IIO)·I)
1# ** **
~*' llh•• ,
LlO••,
**
**
**
# II ° 2 ,/
**

/=
** 1
**
**
** :1 llh".,
A~.I
c=;] "# ** ** 1 **
# #
LI h2 ' 1
Ll03 ·)
**
**
Ah•• ,
** "" Ib) "" # "# 11
**
LI h3 ./
**
Ib)
FIG. 10. Final Reduced Form of Matrix for Branch 'TYpes "II"
and "Ie": (a) Application of Q-Ib Condition; (b) Reduction of Var- FIG. 12. (a) Global Matrix for Example Problem after Ellmlna-
lables for Node b· (K + 1) tlon Phase; (b) Introduction of Outlet Boundary Condition

836/ JOURNAL OF HYDRAULIC ENGINEERING / AUGUST 1998

J. Hydraul. Eng., 1998, 124(8): 831-839

 Phase 3: Back Substitution Pha. .
After obtaining the nodal unknowns for the downstream
nodes, the backward substitution phase for the branches can
be carried out simultaneously or independently, starting with
the upstream node of each branch.
APPLICATION
To show the applicability of the proposed solution tech-
nique, a hypothetical dendritic network system composed of
nine branches (Fig. 13) is considered. The channel character-
Downloaded from ascelibrary.org by Indian Inst Of Technology Library, Kharagpur on 04/26/17. Copyright ASCE. For personal use only; all rights reserved.
istics are shown in Table 1. A discharge hydrograph at the
upstream ends of this dendritic network was provided as input
to the channel network system (Fig. 13). Each branch is di-
vided into eight linear elements. The initial discharge per unit
width is assumed to be constant. The computed outflow hy-
drographs are obtained at all the nodes of the branches, in-
cluding intermediate nodes, using the proposed algorithms.
The computed hydrographs at a few key locations only are
plotted in Fig. 14. Attenuation of the flood peak and widening
of the base of the outflow hydrograph along Branch 3, nec-
essary to conserve the mass, can be observed in Fig. 14. The

'"6Or--------,
~SC
u4C
n
.E

i20~
3C
\ 0 I
\ ~~~~~_:::~~-:.::_:::_:::--
----------~lJ 2
i10 '-----
C O'!:---f.:-~~_=___f..~
------------
"::: ~-:..:::::: ::-:::: 1
o 10 20 30 40 SO I - - b ------I
Tim. in hours

Inflow Hydrograph General channel section

rn

FIG. 13. Layout of Hypothetical Network Problem with Inflow Hydrograph Details

100', . - - - - - - - - - - - - - - . . . ,

Junction A Junction B

.6
..o~
.J::
40

'"
.!!!
c
o so o so
160.-------------,
III

~ 140
§ III
Junction C ~ 10
Junction 0
.='" 120
S
u
90
~ 100
d
.J:: 80
III
o

10 20 30 40 so 10 20 30 40 so
Time in hours
Time in hours
FIG. 14. Computed Outflow Hydrographs at Some Junction Points of Hypothetical Network

JOURNAL OF HYDRAULIC ENGINEERING / AUGUST 1998/837

J. Hydraul. Eng., 1998, 124(8): 831-839

 TABLE 1. Channel Characterlatlce for Network Shown In Fig. dritic channel networks. Using the algorithm, the maximum
13 active matrix storage requirement is reduced to only IN X IN.
Bottom where N = number of branches in the network. It is applied
width to a hypothetical channel network and resulted in a significant
Channel Manning's (b) In Length savings in solution time, in addition to the reduction in storage
number So n meters in meters requirements. The proposed solution technique is also com-
(1 ) (2) (3) (4) (5) pared with a band solver for the hypothetical network. Iden-
3 0.00015 0.0225 35 20,000 tical outflow hydrographs were obtained by both techniques.
1,2 0.00015 0.0225 30 15,000 The proposed solution algorithm was found to be at least six
8,9 0.00017 0.0225 25 10,000 times faster than a band solver for the hypothetical network
4,5,6,7 0.00020 0.0225 20 5,000 and can become more than 25 times faster on parallel proces-
Downloaded from ascelibrary.org by Indian Inst Of Technology Library, Kharagpur on 04/26/17. Copyright ASCE. For personal use only; all rights reserved.

sors. The solution times came out to be significantly different

TABLE 2. Comparison of Solution Time for Proposed Solution
Technique and Band Solver
CPU Time for One Time
Step (in Seconds)
Node Proposed
numbering Maximum solution
scheme band width Band solver technique
(1 ) (2) (3) (4)
I 111 9.50 0.60
2 89 6.81 0.60
3 89 6.81 0.60
4 75 5.33 0.60
5 57 3.62 0.60
6 57 3.62 0.60
model results can be justified on the basis of the physical rea-
soning in a channel routing problem. With a hypothetical net-
work, the validity of the proposed solution technique is further
checked by solving the same problem using another solution
technique, a banded matrix solver. To reduce the band width
for a band solver, the channel network of Fig. 13 was num-
bered in six different ways, and each time the same network
was solved by the band solver and the proposed solution tech-
nique. The results obtained by both solution techniques were
identical, and the outflow hydrographs shown in Fig. 14 were
obtained for all six cases comprised of different node num-
bering schemes. The solution times for the proposed solution
technique were the same for all cases and were found to be
independent of the node numbering schemes. However, there
were significant differences in the solution times for the band
solver depending upon the maximum bandwidth. For a 5 s
lime step, Table 2 compares the CPU time taken on an IBM
PC486 for one timestep for both solvers.
It is evident from Table 2 that the proposed solution tech-
nique does not depend upon the node numbering schemes and
is at least six times faster than a band solver for the channel
network of Fig. 13, even on a serial machine. In addition, there
will be a significant reduction in storage requirements. For the
proposed solution technique, the time was also calculated for
the combined and individual processes. It was found that the
individual processes, Le., the forward elimination and the
backward substitution phases for all the nine branches, took
approximately 86.4% of the CPU time, whereas the combined
processes, i.e., the simultaneous solution phase, took around
13.6% of the CPU time. The CPU time used on single pro-
cessor computers can be reduced using parallel processors.
Therefore, there can be a further reduction of about 77% of
the CPU time of the proposed technique; Le., it would become
more than 25 times faster than a band solver. These advantages
would be much more for a larger network, and they can not
be ignored.
CONCLUSION
An efficient solution algorithm. based on the finite element
method, is developed to route flood hydrographs through den-
for the band solver depending upon the node numbering
schemes. but were found to be independent of the node num-
bering schemes for the proposed solution technique. The al-
gorithm is organized in three phases: the forward elimination
phase, the simultaneous phase, and the backward substitution
phase. The main phases-the first and third phases-may be
processed independently for each branch. This allows the al-
gorithm to be adapted to parallel processors. The algorithms
do not require any special node or element numbering
schemes. Because the proposed solution algorithm ultimately
results in a solution technique for a set of equations, it can
also be extended to finite difference methods.
APPENDIX I. REFERENCES
Abbott, M. B. (1982). "A modelling system for the design and operation
of storm-sewer networks." Engineering applications of computational
hydraulics. Vol. 1: Homage to Alexander Priessman, M. B. Abbott and
J. A. Cunge, eds., Pitman Publishing, London, U.K., 11-32.
Adeff, S. E., and Wang, S. Y. (1985). "Hydrodynamic model of river
flow on a microcomputer." Hydraulics and hydrology in the small
computer age, Vol. 2, W. R. Wardrop, ed., ASCE, Reston, Va.,
1017-1023.
Akan, A. 0., and Yen, B. C. (1981). "Diffusion wave flood routing in
channel networks." J. Hydr. Engrg., ASCE, 107(6),719-732.
Ball, J. E. (1985). "An algorithm for routing unsteady flows in urban
drainage networks." J. Hydr. Res., Delft, The Netherlands, 23(4),
327-341.
Choi, G. w., and Molinas, A. (1993). "Simultaneous solution algorithm
for channel network modelling." Water Resour. Res., 29(2), 321-328.
Cooley, R. L., and Moin, S. A. (1976). "Finite element solution of Saint
Venant equations." J. Hydr. Engrg., ASCE, 102(6), 759-775.
Cunge, J. A., Holly Jr., F. M., and Verwey, A. (1980). Practical aspects
of computational river hydraulics. Pitman Publishing, London, U.K.
Cunge, J. A., and Wegner, M. (1964). "Integration numerique des equa-
tions d'ecoulement de Barre de St. Venant par un schema implicite de
differences fines. Application au cas d'un galerie tentot en change tantot
a surface liIene." La Houille Blanche, Grenoble, France, 19(1), 33-39.
Fread, D. L. (1973). "Technique for implicit dynamic routing in rivers
with tributaries." Water Resour. Res., 9(4), 918-926.
Joliffe, I. B. (1984). "Computation of dynamic waves in channel net-
works." J. Hydr. Engrg., ASCE, 110(10), 1358-1370.
Kao, K. H. (1980). "Improved implicit procedure for multichannel surge
computations." Can. J. Civ. Engrg., Ottawa, Canada, 7, 501-512.
Keuning, D. H. (1976). "Application of finite element method to open
channel flow." J. Hydr. Engrg., ASCE, 102(4),495-468.
King, I. P. (1976). "Finite element for unsteady flow routing through
irregular channels." Finite element in water resources, C. A. Brebbia
et aI., eds., Pentech Press, London, U.K., 4.165-4.184.
Nguyen, Q. K., and Kawano, H. (1995). "Simultaneous solution for flood
routing in channel networks." J. Hydr. Engrg., ASCE, 121(10),
744-750.
Nwaogazie, F. I. L., and Tyagi, A. K. (1984). "Unified streamflow routing
by finite elements." J. Hydro Engrg., ASCE, 110(11), 1595-1611.
Schaffranek, R. W., Baltzer, R. A., and Goldberg, D. E. (1981). "A model
for simulation of flow in singular and interconnected channels." Tech-
niques of water resources investigations of the United States Geolog-
ical Survey, U.S. Geological Survey, Washington, D.C.
Szymkiewicz, R. (1991). "Finite element method for the solution of the
St. Venant equation in an open channel network." J. Hydro., Amster-
dam, The Netherlands, 122, 275-281.
Wood, E., Harley, B. M., and Perkins, F. G. (1975). "Transient flow
routing in channel networks." Rep. RR-75-1, lIASA, Laxenburg.

838/ JOURNAL OF HYDRAULIC ENGINEERING / AUGUST 1998

J. Hydraul. Eng., 1998, 124(8): 831-839

 APPENDIX II. NOTATION K = total number of elements in branch;
The following symbols are used in this paper: N = total number of branches in network;
Q = discharge;
A = cross-sectional area; QI = discharge at local node i of element;
B = free surface width; q = net rate of lateral inflow;
b oj = jth node of bth branch of network; So = bed slope;
g = acceleration due to gravity; Sf = friction slope;
h = water depth; t = time; and
hi = depth of water at local node i of element; x = longitudinal distances.
Downloaded from ascelibrary.org by Indian Inst Of Technology Library, Kharagpur on 04/26/17. Copyright ASCE. For personal use only; all rights reserved.

JOURNAL OF HYDRAULIC ENGINEERING / AUGUST 1998 /839

View publication stats J. Hydraul. Eng., 1998, 124(8): 831-839