Answers are grounded in this paper and cite their sources.
This paper presents an efficient solution algorithm for one-dimensional unsteady flow routing through a dendritic channel network system. The finite element method is used to solve the Saint Venant equations in all branches of the network simultaneously. The maximum active memory required is only 2N× 2N, where N= number of branches in the network. Importantly, the algorithm does not require any special node numbering schemes, and the nodes or elements can be numbered independently for each branch. The algorithm is also suitable for programming using a parallel processing computer. The solution technique can also be extended to finite difference methods.
No takes yet. Share an insight, caveat, or question.
Sen et al. (1998) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: