Abstract
This paper presents a double sweep algorithm for the simultaneous solution of dynamic wave flood routing in nonlooped open channel networks. The difficulty caused by an excessive amount of computer storage required when conventionally solving nonbanded matrix equations is eliminated by using sets of recursion equations written for each specific type of channel section. The size of the coefficient matrix can be reduced from 2 N × 2 N to just 2 N × 4, where N is the total number of computational nodes for the entire system. Consequently, execution time is also significantly shortened. The more flexible choices of spatial coordinate directions for channel branches introduced here enable the equal treatment of all channel junctions. As a result, all nonlooped channel networks can be considered as networks of the true dendritic type. This makes the proposed model applicable to a broader range of practical problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
