The discussers read the paper with interest, since they are also working in this fascinating area of network analysis. The authors presented an efficient algorithm for steady and gradually varied flows in looped channel networks. The authors referred to two papers of Sen and Garg. Sen and Garg (1998) presented an efficient solution algorithm to solve the steady/unsteady flow equations in a dendritic channel network by using the finite element method. Sen and Garg (2002) extended the concept to solve the steady/unsteady flow equations in a general channel network system dendritic, looped, divergent, or any combin ation of such networks by using the finite difference method. The authors have discussed the computational efficiency of their proposed algorithm as compared with the direct method and have also compared it with Sen and Garg (2002). The authors also concluded that the proposed algorithm is computationally more efficient than that of Sen and Garg (2002)
View more info for "Closure to ¿Gradually Varied Flow Computation in Cyclic Looped Channel Networks¿ by H. Prashanth Reddy and S. Murty Bhallamudi"
|Journal||Journal of Irrigation and Drainage Engineering|