Flood routing in tree type channel networks

TLDR: The computer program is based on the implicit-finite difference algorithm recently developed by Nguyen and Kawano (1995), and the system of simultaneous equations resulting from the finite-difference discretization is solved using an efficient double sweep algorithm specially designed for tree type channel networks.

Abstract: The objective of this study is to develop and demonstrate the applicability of a computer code for flood routing in large tree type channel networks. The computer program is based on the implicit-finite difference algorithm recently developed by Nguyen and Kawano (1995). In this method, the system of simultaneous equations resulting from the finite-difference discretization is solved using an efficient double sweep algorithm specially designed for tree type channel networks. The computer code is applied to Ganga River Basin from Haridwar to Farakka barrage. The network consists of 29 channels with a combined length of 10,682 km. Flood routing is carried out with Log Pearson type III inflow hydrographs at the inlets of all the tributaries. The results are discussed in terms of the outflow hydrographs.