网络标量守恒律的中心格式
Central schemes for networked scalar conservation laws
摘要:
我们提出了一个新的方案,数值求解网络上的标量守恒律,而无需解决连接处的黎曼问题。该格式是利用在[Jin和Xin,Comm. Pure Appl.Math.48(3),235-276(1995)]中介绍的松弛系统并在网络的节点处取松弛极限而导出的。该方案是质量守恒的,并产生良好的定义和易于计算的耦合条件,即使是一般的网络。讨论了该格式的高阶推广及其在交通流和两相流中的应用。在前者中,我们与文献中得到的结果进行比较。
英文摘要:
We propose a novel scheme to numerically solve scalar conservation laws on networks without the necessity to solve Riemann problems at the junction. The scheme is derived using the relaxation system introduced in [Jin and Xin, Comm. Pure Appl. Math. 48(3), 235-276 (1995)] and taking the relaxation limit also at the nodes of the network. The scheme is mass conservative and yields well defined and easy-to-compute coupling conditions even for general networks. We discuss higher order extension of the scheme and applications to traffic flow and two-phase flow. In the former we compare with results obtained in literature.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。