A semi-Lagrangian scheme for Hamilton-Jacobi equations on networks with application to traffic flow models
Abstract
We present a semi-Lagrangian scheme for the approximation of a class of Hamilton-Jacobi-Bellman equations on networks. The scheme is explicit and stable under some technical conditions. We prove a convergence theorem and some error estimates. Additionally, the theoretical results are validated by numerical tests. Finally, we apply the scheme to simulate traffic flows modeling problems.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.