论文标题
网络标量保护法的中央计划
Central schemes for networked scalar conservation laws
论文作者
论文摘要
我们提出了一个新的方案，以在网络上求解标量保护法，而无需在交界处解决Riemann问题。该方案是使用[Jin和Xin，Comm中引入的放松系统得出的。纯应用。数学。 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.
