ScholarLens Back to search
2000•ISH Journal of Hydraulic EngineeringRequires access

FLOOD ROUTING IN TREE TYPE CHANNEL NETWORKS

S. Surya Rao, S. Murthy Bhallamudi, Suchismita Tewari, Ravi Bhushan Kumar

Open publisher page 1 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Hydrograph, Channel (broadcasting), Routing (electronic design automation), Outflow, Tributary, Inflow, Flood myth, Tree (set theory)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
FLOOD ROUTING IN TREE TYPE CHANNEL NETWORKS — Research Paper | ScholarLens