Gradually Varied Flow Computation in Cyclic Looped Channel Networks

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.