Abstract
<p style='text-indent:20px;'>In [Andreianov, Coclite, Donadello, Discrete Contin. Dyn. Syst. A, 2017], a finite volume scheme was introduced for computing vanishing viscosity solutions on a single-junction network, and convergence to the vanishing viscosity solution was proven. This problem models <inline-formula><tex-math id="M1">\begin{document}$ m $\end{document}</tex-math></inline-formula> incoming and <inline-formula><tex-math id="M2">\begin{document}$ n $\end{document}</tex-math></inline-formula> outgoing roads that meet at a single junction. On each road the vehicle density evolves according to a scalar conservation law, and the requirements for joining the solutions at the junction are defined via the so-called vanishing viscosity germ. The algorithm mentioned above processes the junction in an implicit manner. We propose an explicit version of the algorithm. It differs only in the way that the junction is processed. We prove that the approximations converge to the unique entropy solution of the associated Cauchy problem.</p>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Computer Science Applications,General Engineering,Statistics and Probability,Applied Mathematics,Computer Science Applications,General Engineering,Statistics and Probability
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献