节点处黎曼解算子的熵型条件
Entropy type conditions for Riemann solvers at nodes
摘要:
本文讨论用图表示的网络上的守恒律。熵型条件被认为是确定节点处的动态。由于熵分散是一个局部的概念,我们考虑一个网络组成的一个单一的节点$J$与$n$传入和$m$传出弧。我们在$J$上推广了经典Kružkov熵,得到了两个条件,记为(E1)和(E2):第一个条件是所有Kružkov熵都需要熵条件,第二个条件是只需要对应于音速点的值.首先,我们证明了在$n \ne m$的情况下,没有黎曼解算子可以满足最强条件。然后,我们刻画了所有的黎曼解算子在$J$满足最强条件(E1),在节点的情况下,最多有两个传入和两个传出弧。最后,我们集中在三个不同的黎曼解算子,在以前的论文中介绍。特别是,我们表明,黎曼解算子引入数据网络是唯一一个总是满足(E2)。
英文摘要:
This paper deals with conservation laws on networks, represented by graphs. Entropy-type conditions are considered to determine dynamics at nodes. Since entropy dispersion is a local concept, we consider a network composed by a single node $J$ with $n$ incoming and $m$ outgoing arcs. We extend at $J$ the classical Kružkov entropy obtaining two conditions, denoted by (E1) and (E2): the first requiring entropy condition for all Kružkov entropies, the second only for the value corresponding to sonic point. First we show that in case $n \ne m$, no Riemann solver can satisfy the strongest condition. Then we characterize all the Riemann solvers at $J$ satisfying the strongest condition (E1), in the case of nodes with at most two incoming and two outgoing arcs. Finally we focus three different Riemann solvers, introduced in previous papers. In particular, we show that the Riemann solver introduced for data networks is the only one always satisfying (E2).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。