Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Nguyen et al. (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: