Numerical relaxation limit and outgoing edges in a central scheme for networked conservation laws
Abstract
A recently introduced scheme for networked conservation laws is analyzed in various experiments. The scheme makes use of a novel relaxation approach that governs the coupling conditions of the network and does not require a solution of the Riemann problem at the nodes. We numerically compare the dynamics of the solution obtained by the scheme to solutions obtained using a classical coupling condition. In particular, we investigate the case of two outgoing edges in the Lighthill-Whitham-Richards model of traffic flow and in the Buckley-Leverett model of two phase flow. Moreover, we numerically study the asymptotic preserving property of the scheme by comparing it to its preliminary form before the relaxation limit in a 1-to-1 network.
Keywords
Cite
@article{arxiv.2210.03573,
title = {Numerical relaxation limit and outgoing edges in a central scheme for networked conservation laws},
author = {Niklas Kolbe},
journal= {arXiv preprint arXiv:2210.03573},
year = {2022}
}
Comments
7 pages, 4 figures