Efficient Solution Algorithm for Unsteady Flow in Channel Networks Using Subtiming Technique
Publication: Journal of Irrigation and Drainage Engineering
Volume 146, Issue 6
Abstract
This paper describes a computationally efficient numerical model for unsteady flow computations in open channel networks using the four-point Preissmann implicit scheme. The proposed algorithm achieves improved convergence and computational efficiency by: (1) adopting a junction point water stage prediction and correction technique based on recurrence coefficients in the double sweep algorithm for the Preissmann scheme; (2) incorporating an adaptive relaxation technique in the iterative loop; and (3) adopting a subtiming framework for time stepping. Subtiming strategy requires small computational time steps for only those channels of the network where temporal variations in flow conditions are significant, while larger time steps are taken in other channels. The subtiming strategy minimizes computational inefficiency due to temporal overdiscretization associated with schemes using uniform time step size throughout the domain. The application of the proposed algorithm is illustrated for three test cases. For a large network of channels, the proposed algorithm increased the computational efficiency by a factor of two, as compared to the conventional junction point water stage prediction and correction algorithm presently available in literature.
Get full access to this article
View all available purchase options and get full access to this article.
Data Availability Statement
Some or all data, models, or code that support the findings of this study are available from the corresponding author upon reasonable request.
Acknowledgments
Authors acknowledge the partial funding received from the Department of Science and Technology (DST), Government of India under the Grant No. EMR/2017/000642 through SERB.
References
Bhallamudi, S. M., S. Panday, and P. S. Huyakorn. 2003. “Sub-timing in fluid flow and transport simulations.” Adv. Water Resour. 26 (5): 477–489. https://doi.org/10.1016/S0309-1708(03)00018-6.
Chaudhry, M. H. 2007. Open channel flow. Englewood Cliffs, NJ: Prentice-Hall.
Choi, G., and A. Molinas. 1993. “Simultaneous solution algorithm for channel network modeling.” Water Resour. Res. 29 (2): 321–328. https://doi.org/10.1029/92WR01949.
Cunge, J. A., F. M. Holly, and A. Verwey. 1980. Practicalaspects of computational river hydraulics. London: Pitman Publishers.
Durbin, T., and D. Delemos. 2007. “Adaptive underrelaxation of Picard iterations in groundwater models.” Ground Water 45 (5): 648–651. https://doi.org/10.1111/j.1745-6584.2007.00329.x.
El-Amin, M. F., J. Kou, and S. Sun. 2018. “Discrete-fracture-model of multi-scale time-splitting two-phase flow including nanoparticles transport in fractured porous media.” J. Comput. Appl. Math. 333 (May): 327–349. https://doi.org/10.1016/j.cam.2017.11.008.
Fread, D. L. 1973. “Technique of implicit dynamic routing in rivers with tributaries.” Water Resour. Res. 9 (4): 918–926. https://doi.org/10.1029/WR009i004p00918.
Islam, A., N. S. Raghuwanshi, R. Singh, and D. J. Sen. 2005. “Comparison of gradually varied flow computation algorithms for open-channel network.” J. Irrig. Drain. Eng. 131 (5): 457–465. https://doi.org/10.1061/(ASCE)0733-9437(2005)131:5(457).
Janicke, L., and A. Kost. 1998. “Convergence properties of the Newton–Raphson method for nonlinear problems.” IEEE Trans. Magn. 34 (5): 2505–2508. https://doi.org/10.1109/20.717577.
Joliffe, I. B. 1984. “Computation of dynamic waves in channel networks.” J. Hydraul. Eng. 110 (10): 1358–1370. https://doi.org/10.1061/(ASCE)0733-9429(1984)110:10(1358).
Larson, C. L., T. C. Wei, and C. E. Bowers. 1971. Numerical routing of flood hydrographs through open channel junctions, 67. Minneapolis: Water Resources Research Center, Univ. of Minnesota.
Li, W., and C. Wei. 2015. “An efficient finite element procedure for analyzing three-phase porous media based on the relaxed Picard method.” Int. J. Numer. Methods Eng. 101 (11): 825–846. https://doi.org/10.1002/nme.4830.
Liao, H. S., P. V. Sampath, Z. K. Curtis, and S. G. Li. 2015. “Hierarchical modeling and parameter estimation for a coupled groundwater-lake system.” J. Hydrol. Eng. 20 (11): 196–211. https://doi.org/10.1016/j.jhydrol.2015.04.057.
Misra, C., S. T. Manikandan, S. M. Bhallamudi, and S. Panday. 2012. “Dynamic subtiming-based implicit nonoscillating scheme for contaminant transport modeling.” J. Hydrol. Eng. 17 (6): 694–703. https://doi.org/10.1061/(ASCE)HE.1943-5584.0000507.
Naidu, B. J., S. M. Bhallamudi, and S. Narasimhan. 1997. “GVF computation in tree-type networks.” J. Hydraul. Eng. 123 (8): 700–708. https://doi.org/10.1061/(ASCE)0733-9429(1997)123:8(700).
Nakata, T., N. Takahashi, K. Fujiwara, O. Okamoto, and K. Muramatsu. 1992. “Improvements of convergence characteristics of Newton-Raphson method for nonlinear magnetic field analysis.” IEEE Trans. Magn. 28 (2): 1048–1051. https://doi.org/10.1109/20.123861.
Nguyen, Q. K., and H. Kawano. 1995. “Simultaneous solution of flood routing in channel networks.” J. Hydraul. Eng. 121 (10): 744–750. https://doi.org/10.1061/(ASCE)0733-9429(1995)121:10(744).
Reddy, H. P., and S. M. Bhallamudi. 2004. “Gradually varied flow computation in cyclic looped channel networks.” J. Irrig. Drain. Eng. 130 (5): 424–431. https://doi.org/10.1061/(ASCE)0733-9437(2004)130:5(424).
Ren, F., G. W. Ma, Y. Wang, and L. F. Fan. 2016. “Pipe network model for unconfined seepage analysis in fractured rock masses.” Int. J. Rock Mech. Min. Sci. 88 (10): 183–196. https://doi.org/10.1016/j.ijrmms.2016.07.023.
Santiago-Collazo, F. L., and W. F. Silva-Araya. 2019. “Computational model for gradually varied flow in channel networks with hydraulic structures.” J. Irrig. Drain. Eng. 145 (6): 04019007. https://doi.org/10.1061/(ASCE)IR.1943-4774.0001388.
Schulte, A. M., and M. H. Chaudhry. 1987. “Gradually-varied flow in open-channel networks.” J. Hydraul. Res. 25 (3): 357–371. https://doi.org/10.1080/00221688709499276.
Sen, D. J., and N. K. Garg. 2002. “Efficient algorithm for gradually varied flows in channel networks.” J. Irrig. Drain. Eng. 128 (6): 351–357. https://doi.org/10.1061/(ASCE)0733-9437(2002)128:6(351).
Singh, V., and S. Bhallamudi. 1997. “Complete hydrodynamic border-strip irrigation model.” J. Irrig. Drain. Eng. 123 (6): 407–414. https://doi.org/10.1061/(ASCE)0733-9437(1997)123:6(407).
Swain, E. D., and D. A. Chin. 1990. “Model of flow in regulated open channel networks.” J. Irrig. Drain. Eng. 116 (4): 537–556. https://doi.org/10.1061/(ASCE)0733-9437(1990)116:4(537).
Wu, W. 2008. Computational river dynamics. London: Taylor & Francis.
Zhang, M., and Y. Shen. 2007. “Study and application of steady flow and unsteady flow mathematical model for channel networks.” J. Hydrodyn. Ser. B 19 (5): 572–578. https://doi.org/10.1016/S1001-6058(07)60155-3.
Zhou, P., D. Lin, B. He, S. Kher, and Z. J. Cendes. 2010. “Strategies for accelerating non-linear convergence for T-Omega formulation.” IEEE Trans. Magn. 46 (8): 3129–3132. https://doi.org/10.1109/TMAG.2010.2043508.
Zhu, D., Y. Chen, Z. Yang, and Z. Liu. 2011. “Simply robust and efficient algorithm for gradually varied subcritical flow simulation in general channel networks.” J. Hydraul. Eng. 137 (7): 766–774. https://doi.org/10.1061/(ASCE)HY.1943-7900.0000356.
Information & Authors
Information
Published In
Journal of Irrigation and Drainage Engineering
Volume 146 • Issue 6 • June 2020
Copyright
©2020 American Society of Civil Engineers.
History
Received: Jan 21, 2019
Accepted: Jan 9, 2020
Published online: Apr 13, 2020
Published in print: Jun 1, 2020
Discussion open until: Sep 13, 2020
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.