In this article, we present an extension of the splitting algorithm proposed in [22] to networks of conservation laws with piecewise linear discontinuous flux functions in the unknown. We start with the discussion of a suitable Riemann solver at the junction and then describe a strategy how to use the splitting algorithm on the network. In particular, we focus on two types of junctions, i.e., junctions where the number of outgoing roads does not exceed the number of incoming roads (dispersing type) and junctions with two incoming and one outgoing road (merging type). Finally, numerical examples demonstrate the accuracy of the splitting algorithm by comparisons to the exact solution and other approaches used in the literature.

翻译：在本条中,我们提出将[22] 中提议的分离算法扩展至在未知情况下具有片断线线性不连续通量功能的养护法网络;我们首先在交界处讨论适当的里曼求解器,然后说明如何在网络上使用分裂算法的战略;特别是,我们侧重于两类交界点,即离岸道路数目不超过进港道路数目(分散型)的交汇点,以及两条进港道路和一条出港道路(合并型)的交汇点。 最后,数字例子通过比较确切的解决办法和文献中使用的其他方法,表明分离算法的准确性。