Professional Documents
Culture Documents
Fen Nema 1990
Fen Nema 1990
FREE-SURFACE FLOWS
By Robert J . F e n n e m a , 1 Associate M e m b e r , A S C E ,
and M . Hanif Chaudhry, 2 Member, A S C E
Downloaded from ascelibrary.org by University of Michigan on 07/29/13. Copyright ASCE. For personal use only; all rights reserved.
INTRODUCTION
1013
Sf = (2a)
Clh1
n2vV^ (2b)
Jy
C20hl
Eqs. 1 and 3 are not in full conservation form because of the presence of
the source terms S and T. When the source terms are not equal to zero, they
act as sources or sinks. Since the contribution of these terms is usually small
the conservative properties are not significantly impaired. The conservation
form of the equations (as Eqs. 1 and 3) has the advantage that they are
superior in conserving the flow variables compared to the case when the
equations are not in conservation form. Our recent investigations show that
the wave celerity computed by using the same numerical scheme compares
better with the experimental results if conservation form of the equations is
used instead of the nonconservation form.
It is necessary, however, for certain numerical schemes that the equations
be in nonconservation form. For this purpose, the nonconservation form of
Eqs. la and lb is obtained by substituting E x = AU^ and F y = BU3, where
A and B are the Jacobians of E and F:
0 1 0 1
A = -u2 + gh 2« —uv u (4)
—uv v -v2 + gh 2v
Similarly the nonconservation form of Eq. 3 is obtained by substituting P^
= GVX and R. = H V . in which
u h 0
G = 9 u 0 H (5)
0 0 u
Matrices A and G, and B and H of Eqs. 4 and 5 have the important
property that their eigenvalues or characteristic directions are identical and
are given by
1015
( U>1 = V
a>2 = v + c (6b)
Downloaded from ascelibrary.org by University of Michigan on 07/29/13. Copyright ASCE. For personal use only; all rights reserved.
a)3 = v — c
where c = wave celerity = 'Vgh
FINITE-DIFFERENCE SCHEMES
MACCORMACK SCHEME
1016
Predictor Step
At , At , |2 < i < N
Ui, = U t - - V ^ - - V ^ - A ^ ( 2 s . s M (7)
Corrector Step
At . At _ _ f l a;' > N - 1
U,, = U , , - - A A , - - A y F , , - A , S , , ( ^ . ^ ^ -(8)
in which U and tl are the intermediate values for U. The new values of U
are then obtained from
The grid points are defined by subscripts i, j , and k. The scheme first uses
backward space differences (V* and Vy) to predict an intermediate solution
from known information at the k time level. Forward space differences (A^.
and Ay) are then used in the second step to correct the predicted Values. The
backward and forward difference operators (V and A) are defined by
VxV,j = U,j - U,_ w A,U„ = U l + U - U w (10)
where the subscript indicates the direction of differencing. The corrector step
always uses one-sided differences opposite the ones used in the predictor
part.
The differencing may be reversed or it may be alternated each time step.
An example of a sequence that repeats itself every fourth time step is given
in Fig. 1. This sequence removes most of the directional bias of this scheme
that would otherwise be present if alternating steps were not used. The dif-
ferencing shown in the first sketch, the k time step, is equivalent to the
differencing used in Eqs. 7 and 8. The values of primitive variables are
determined from the computed value of U at each step as follows
hn+1 = hn+1 (11a)
n+1
+, (uh)
u =
-^r <m>
hn+1
where n + 1 refers to an intermediate value obtained during a current pre-
dictor or corrector sequence.
Boundary Conditions
Reflection boundaries may be easily incorporated in the MacCormack
scheme. In this procedure, fictitious points in the solid wall are replaced by
1017
i.i-l
k + l timestep
LEGEND
^~N = SPATIAL DIFFERENCES IN THE x-DIRECTION,PREDICTOR STEP
/-^-s = SPATIAL DIFFERENCES IN THE x-DIRECTION,CORRECTOR STEP
p( = SPATIAL DIFFERENCES IN THE y-DIRECTION,PREDICTOR STEP
= SPATIAL DIFFERENCES IN THE y-DIRECTION,CORRECTOR STEP
Ax Ay Ax
M
hi = 4J~T- riMj ~ «u-i) - T- Wtj - hj-J - T «(v« - v+
'^
Ay Ay Ax
1018
*T-I,J
r™ ""*" ""/
SOLID
WALL;
y INTERIOR DOMAIN
In these equations the values at all the (i — 1, j) points have been replaced
by values at (i + 1, j) points and the sign of the normal velocity component,
M, has been switched. No difficulty arises during the corrector step because
none of the differences are from the interior of the solid boundary.
GABUTTI SCHEME
General Formulation
The algorithm is developed in the following manner. The Jacobians of
Eq. 5 may be diagonalized by transformation matrices, e.g., Anton (1981),
that are made up of the right eigenvectors of G and H. The system Eqs. 3
and 5 may then be written as
V, + MDGM~'VX + NDHN_1Vy + T = 0 (13)
where DG and D H are diagonal matrices of the eigenvalues presented in Eqs.
6, and M and N are defined by
1019
and
l/2(co2 + co3) 0 h/2c(o>2 W3)
H = ND H N" 0 0 (16)
c/2h(d>2 - co3) 0 1/2(0)2 " "3)
The diagonal matrices D G and D H may be split into positive and negative
parts, D G = Do + D Q and D H = D H + D H . This can be accomplished in a
number of ways. For example, one alternative is to test each eigenvalue by
1020
Ax
Corrector Step
The nonvector form of Eqs. 20-22 may be found in the appendix of Fen-
nema (1985).
Boundary Conditions
Boundaries based on characteristic principles may be included in the Ga-
butti scheme. The compatibility equations valid along each characteristic
aligned with the axes of the computational domain are obtained first, and
the appropriate one is replaced by a specified boundary condition. The sys-
tem is multiplied by the eigenvectors associated with the respective char-
acteristic directions. In the case of a solid boundary shown in Fig. 2, the
relevant eigenvectors corresponding to the eigenvalues given by Eqs. 6a and
6b are contained in M~\ Premultiplying each term of the system gives
M"'V, + DGM_1VX + M-'NDHN^'V,, + M _1 T = 0 (25)
The incoming characteristic, \ 2 = u 4- c, is associated with the second ei-
genvector M _1 . The information along \2 comes from the wall and is re-
placed by the boundary condition u = 0 or u, — 0. Thus the equations at
the wall, after simplification, may be written as follows
ft _ 1 h
h, + \3hx — \ 3 - ux + - (w2 + <^3)hy (axuy [Continued]
c 2 c
1021
where the superscript indicates that a forward difference should be used. The
first equation solves for the head hk+1, using information along the backward
characteristic Xi = u — c. The third equation solves vk+> using information
along the path or world line \ 3 = u. These are the equations for solving the
flow variables h and v at solid boundaries oriented parallel to the y-axis with
the computational domain facing the positive x-direction. Similar equations
may be written for boundaries with different orientations.
ARTIFICIAL VISCOSITY
1023
9 , 2 2 ,-,21,22
41,4
200
Computations for the problems included herein were done on an IBM 3090
mainframe computer, and three-dimensional graphs were prepared by using
a standard package available for this purpose at the Computing Center of
Washington State University.
Partial Breach or Opening of Sluice Gates
In this problem, the dam is assumed to fail instantaneously or the sluice
gates are assumed to be opened instantly. Because of discontinuous initial
conditions, it imposes severe difficulties and most of the presently used nu-
merical schemes fail under such conditions. In the simulations included herein,
channel downstream of the dam or the gates is assumed to have some finite
flow depth. This is quite normal for usual applications where a downstream
control keeps the downstream channel in a "wet" condition. To simulate a
dry channel, however, a very small flow depth may be assumed in the anal-
ysis. This procedure is much easier than to track the bore propagation ex-
plicitly and should give results that are of the same, if not better, accuracy
than that of the other input variables.
The computational domain comprises of a 200-m-long and 200-m-wide
channel. The nonsymmetrical breach or sluice gates are 75-m wide and the
structure or dam is 10-m thick in the direction of flow. The grid is 41 X
41 points, which results in an individual mesh size of 5 m X 5 m. Additional
details are shown in Fig. 3. To prevent any damping by the source terms,
a frictionless, horizontal channel was used and initial conditions had a tail-
water/reservoir ratio ht/hr = 0.5 in the initial few runs. Flow conditions
were analyzed for a wide variation of flow parameters, such as including
the friction losses (Manning n from 0 to 0.15), assuming a sloping channel
(bottom slope from 0 to 0.07), different ratios of the tailwater-to-reservoir
depths (as low as 0.2), and symmetrical and unsymmetrical breach. Only
typical results, however, are included herein to conserve space. The flow
conditions were computed for 7.1 sec after the dam failure or opening of
the sluices. The results presented are for 7.1 £ t < 7.1 + A? sec. At this
time, the bore is well developed in the central portion of the downstream
channel and the wave front has reached one bank of the channel.
1024
velocities below a specified tolerance are not drawn (magnitude with a length
less than 20% of the mesh size). The velocity vectors on the boundaries,
(a)
(b)
FIG. 4. Water Surface Profile Computed by MacCormack Scheme with No Arti-
ficial Viscosity: (a) Anti-Symmetric Boundary Condition; (b) Symmetric Boundary
Condition
1025
(b)
FIG. 5. Results Computed by MacCormack Scheme; Artificial Viscosity Added:
(a) Water Surface Profile; (b) Velocity Vectors
1026
of the breach. In these runs the sharp corners are modeled by assuming they
are boundaries parallel with the x-direction.
The solution of this problem using the Gabutti scheme and with no arti-
ficial viscosity added is shown in Fig. 6(a). Since the diffusive properties
of this scheme are different from those of the MacCormack scheme, the
(b)
FIG. 6. Water Surface Profiles Computed by Gabutti Scheme: (a) No Artificial
Viscosity; (h) Artificial Viscosity Added K = 0.25
1027
10.0
£ 7.
Q.
0>
O
5.0
0 100 200
Distance (m)
— Mac Cormack
— Gabutti
8.5
Node ( 2 0 , 1 5 )
o. 6.5
Q
Node ( 2 4 , 1 5 )
4.5
0.0 2.5 5.0 7.5
Time(s)
1028
£ 7.5
o.
\
"»s
j = 31 \
5.0 r~~*"*—^.
100 200
Distance (m)
21,12 31,12
Flow
2000m
21,30 31,30
2000 m
at all grid points at t = 0 is 5 m and the flow velocity is zero. The flood
wave of Fig. 11 is introduced at the upstream end over full channel width.
The flow depth at the downstream end is kept constant and equal to the initial
flow depth.
The flow depths computed by the MacCormack scheme at node (20, 21)
and at node (25, 21) are shown in Fig. 12. Node (10, 21) is located upstream
of the contraction and node (25, 21) is located downstream of the contrac-
tion. It is clear from this figure how the wave height and wave shape are
modified as the wave travels through the computational flow domain.
Fig. 13 shows the transverse water surface profiles computed by the
MacCormack scheme at t = 220 s at three locations. These locations are /
= 20 (upstream of the contraction), i = 25 (inside contraction), and i = 35
(downstream of contraction).
It is clear from this figure how the wave is modified as it passes through
the contraction. Since the contraction is unsymmetrical, water surface is not
symmetrical with respect to the centerline of the channel.
8.5
1030
II r
DISTANCE (m)
FIG. 14. Comparison of Computed Water-Surface Profiles for Dam Breach of
Fig. 3
1031
APPENDIX I. REFERENCES
1032
Ohio.
Matsutomi, H. (1983). "Numerical computations of two-dimensional inundation of
rapidly varied flows due to breaking of dams." Proc. XX Congress of the IAHR,
International Association for Hydraulics Research, 2, Sept., 479-488.
Moretti, G. (1979). "The X-scheme." Comput. Fluids, 7(3), 191-205.
Sakkas, J. G., and Strelkoff, T. (1973). "Dam-break flood in a prismatic dry chan-
nel." J. Hydr. Div., ASCE, 99(12), 2195-2216.
Warming, R. F., and Hyett, B. J. (1974). "The modified equation approach to the
stability and accuracy analysis of finite-difference methods." J. Computational
Physics, 14(2), 159-179.
A = Jacobian of E;
B = Jacobian of F;
c„ = Courant number;
Co = dimensional constant in Manning's friction formula;
c = wave celerity, c = Vgfc;
=
DA diagonal matrix of eigenvalues of E;
=
DB diagonal matrix of eigenvalues of F;
=
DG diagonal matrix of eigenvalues of P;
=
DH diagonal matrix of eigenvalues of R;
E = vector of fluxes in x-direction;
F = vector of fluxes in ^-direction;
G = Jacobian of P;
=
g acceleration due to gravity;
H = Jacobian of R;
h = flow depth, measured from channel bottom;
K = reservoir level;
h, = tailwater level;
I = diagonal matrix of ones, unit matrix;
M = matrix of right eigenvectors of A;
M = maximum range of computational domain in y-direction;
N = maximum range of computational domain in x-direction;
n = Manning's roughness coefficient;
P = vector of fluxes in ^-direction;
Q = Jacobian of source term S;
R = vector of fluxes in ^-direction;
S = vector of source terms (friction and bottom slope);
s& = friction slope in x-direction;
s
f, = friction slope in y-direction;
Sox = channel bottom slope in x-direction;
S0 = channel bottom slope in y-direction;
1033
X = space coordinate;
y = space coordinate, orthogonal to x;
A = backward differencing operator; increment between two points;
e = parameter used in artificial viscosity term;
K = damping parameter used in artificial viscosity term;
X = eigenvalue or characteristic direction;
V = parameter used in artificial viscosity term;
CO = eigenvalue or characteristic direction; and
V = forward differencing operator.
Superscripts
k = grid point in time direction;
/ = eigenvector index;
n = step increment; and
T — transpose of matrix or vector.
Subscripts
i = grid point in jc-direction;
j = grid point in y-direction;
/ = eigenvector index;
t = differentiation with respect to t;
x = differentiation with respect to x; and
y = differentiation with respect to y.
1034