Gradually Varied Flow Computation in Cyclic Looped Channel Networks
This article has a reply.
VIEW THE REPLYThis article has a reply.
VIEW THE REPLYPublication: Journal of Irrigation and Drainage Engineering
Volume 130, Issue 5
Abstract
A novel and computationally efficient algorithm is presented to compute the water surface profiles in steady, gradually varied flows of open channel networks. This algorithm allows calculation of flow depths and discharges at all sections of a cyclic looped open channel network. The algorithm is based on the principles of (1) classifying the computations in an individual channel as an initial value problem or a boundary value problem; (2) determining the path for linking the solutions from individual channels; and (3) an iterative Newton–Raphson technique for obtaining the network solution, starting from initial assumptions for discharges in as few channels as possible. The proposed algorithm is computationally more efficient than the presently available direct method by orders of magnitude because it does not involve costly inversions of large matrices in its formulation. The application of this algorithm is illustrated through an example network.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Chaudhry, M.H. ( 1993). Open channel flow, Prentice-Hall, Englewood Cliffs, N.J.
2.
Chaudhry, M. H., and Schulte, A. (1986). “Computation of steady state, gradually varied flows in parallel channels.” Can. J. Civ. Eng., 13(1), 39–45.
3.
Choi, G. W., and Molinas, A. (1993). “Simultaneous solution algorithm for channel network modeling.” Water Resour. Res., 29(2), 321–328.
4.
Chow, V.T. ( 1959). Open channel hydraulics, McGraw–Hill, New York.
5.
Cunge, J.A., Holly, F.M., and Verwey, A. ( 1980). Practical aspects of computational river hydraulics, Pitman, London.
6.
Kutija, V. (1995). “A generalized method for the solution of flows in networks.” J. Hydraul. Res., 33(4), 535–555.
7.
Mukherjee, K.N. ( 1985). River basin atlas of India, Central Board for the Prevention and Control of Water Pollution, New Delhi.
8.
Naidu, B. J., Bhallamudi, S. M., and Narasimhan, S. (1997). “GVF com-putation in tree-type channel networks.” J. Hydraul. Eng., 123(8), 700–708.
9.
Nguyen, Q. K., and Kawano, H. (1995). “Simultaneous solution for flood routing in channel networks,” J. Hydraul. Eng., 121(10), 744–750.
10.
Press, W.H., Flannery, B.P., Teukolsky, S.A., and Vetterling, W.T. ( 1986). Numerical recipes—The art of scientific computing, Cambridge University Press, New York.
11.
Reddy, H.P. ( 2001). “Computation of gradually varied flow in looped open channel networks.” MTech thesis, Indian Institute of Technology, Chennai, India.
12.
Schulte, A. M., and Chaudhry, M. H. (1987). “Gradually varied flows in open channel networks.” J. Hydraul. Res., 25(3), 357–371.
13.
Sen, D. J., and Garg, N. K. (1998). “Efficient solution technique for dendritic channel networks using FEM.” J. Hydraul. Eng., 124(8), 831–839.
14.
Sen, D. J., and Garg, N. K. (2002). “Efficient algorithm for gradually varied flows in channel networks.” J. Irrig. Drain. Eng., 128(6), 351–357.
15.
Wylie, E. B. (1972). “Water surface profiles in divided channels.” J. Hydraul. Res., 10(3), 325–341.
Information & Authors
Information
Published In
Copyright
Copyright © 2004 ASCE.
History
Published online: Oct 1, 2004
Published in print: Oct 2004
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.