Please use this identifier to cite or link to this item:
Title: An efficient, accurate and applicable numerical model for unsteady flows in river networks
Other Titles: 一种高效实用的河网水动力数学模型研究
Authors: Zhan, JM
Lu, MY
Li, YS 
Jiang, W
Keywords: River networks
Preissmann four-point implicit scheme
Data structure
Issue Date: 2006
Publisher: 中国船舶科学研究中心等
Source: 水动力学研究与进展(A辑) (Chinese Journal of Hydrodynamics), 2006, v. 21, no. 6, p. 685-692 How to cite?
Journal: 水动力学研究与进展(A辑) (Chinese Journal of Hydrodynamics) 
Abstract: 本文建立了河网的水动力数值模型,该模型可以解决树状的(如集水系统)、环状的、有分支的(如灌溉系统)以及任意组合的河网或渠道系统的水动力问题。利用Fortran语言自定义数据类型变量(或C语言的结构体类型变量)在构建数据结构方面的灵活性,把复杂的河网分成河道和节点两大类进行数据结构的构建以及数据的存储和使用。在节点的连接处理上,虽然本文的方法是基于三级联解的一种改进方法,但我们在已有的工作的基础上[2],避免了直接联立求解大型线性方程组。这样就没有系数矩阵的带宽问题,加上在构建数据结构的灵活性,使得河网中河道和叉点可以任意编号,甚至可以不连续编号。利用几个典型算例,我们对模型进行了可靠性和精度分析,计算结果与前人的计算结果吻合较好。
This paper presents a numerical model for unsteady flows in general river network systems—dendritic,looped,divergent,or any combination of such networks.Because of the use of the User-Defined types in Fortran(similar to Struct in C Language),complex data structures can be established and large size of data can be stored and analyzed.Comparing with previous models,there are also three steps in solving the equations,but it does not need to consider the bandwidth of the sparse coefficient matrix in solving the large linear system of equations.Therefore,it is not needed to use any special node-numbering schemes.The nodes can be numbered randomly and even be discontinuous.The complicated river networks is compartmentalized into two main parts—channels and junctions.It is convenient and flexible to use the numerical model.Finally three types of river networks are investigated.The numerical results agree well with those by Reddy and Sen.
ISSN: 1000-4874
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of May 21, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.