Godunov scheme and sampling technique for computing phase transitions in traffic flow modeling (Q936146)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5311226
Language Label Description Also known as
default for all languages
No label defined
    English
    Godunov scheme and sampling technique for computing phase transitions in traffic flow modeling
    scientific article; zbMATH DE number 5311226

      Statements

      Godunov scheme and sampling technique for computing phase transitions in traffic flow modeling (English)
      0 references
      0 references
      0 references
      13 August 2008
      0 references
      The authors propose a new version of the Godunov scheme for the numerical approximation of solutions of a continuous traffic flow model. The phenomenon of phase transitions between a free flow (described by a scalar conservation law) and a congested flow (described by a \(2\times 2\) system) is taken into account. From an analytical point of view the mathematical model is well posed for all initial data with bounded total variation. The proposed numerical model is based on a modified averaging strategy and a sampling procedure. The mesh cells are modified following the phase boundaries and as such the projection involves only values belonging to the same phase. In order to come back to the original cells, the projection step is completed with a Glimm-type sampling technique. The accuracy of the scheme is extended to second order, in space and time, which is \(L^1\)-stable in time, using a MUSCL technique and a second order Runge-Kutta method. The validity and convergence of the method is demonstrated by several numerical tests.
      0 references
      Hyperbolic Conservation Laws
      0 references
      continuous traffic models
      0 references
      phase transitions
      0 references
      Godunov scheme
      0 references
      sampling
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references