Scholarlink

<p>We prove the maximum principle for a discontinuous Galerkin (DG) method applied to the numerical solution of traffic flow problems on networks described by the Lighthill-Whitham-Richards equations. The paper is a followup of the preceding paper, Part I, where <i>L</i><sup><i>2</i></sup> stability of the scheme is analyzed. At traffic junctions, we consider numerical fluxes based on Godunov’s flux derived in our previous work. We also construct a new Godunov-like numerical flux taking into account right of way at the junction to cover a wider variety of scenarios in the analysis. These fluxes are easily constructible for any number of incoming and outgoing roads, respecting the drivers’ preferences. We prove that the explicit Euler or SSP DG scheme with limiters satisfies a maximum principle on general networks. Numerical experiments demonstrate the obtained results.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Discontinuous Galerkin method with Godunov-like numerical fluxes for traffic flows on networks. Part II: Maximum principle

  • 期刊论文

  • 发表日期：

    2025年6月12日

查看全文
  • Lukáš Vacek,
  • Chi-Wang Shu,
  • Václav Kučera

摘要

We prove the maximum principle for a discontinuous Galerkin (DG) method applied to the numerical solution of traffic flow problems on networks described by the Lighthill-Whitham-Richards equations. The paper is a followup of the preceding paper, Part I, where L2 stability of the scheme is analyzed. At traffic junctions, we consider numerical fluxes based on Godunov’s flux derived in our previous work. We also construct a new Godunov-like numerical flux taking into account right of way at the junction to cover a wider variety of scenarios in the analysis. These fluxes are easily constructible for any number of incoming and outgoing roads, respecting the drivers’ preferences. We prove that the explicit Euler or SSP DG scheme with limiters satisfies a maximum principle on general networks. Numerical experiments demonstrate the obtained results.