Fast algorithms for the approximation of a traffic flow model on networks

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

New computation algorithms for a fluid-dynamic mathematical model of flows on networks are proposed, described and tested. First we improve the classical Godunov scheme (G) for a special flux function, thus obtaining a more efficient method, the Fast Godunov scheme (FG) which reduces the number of evaluations for the numerical flux. Then a new method, namely the Fast Shock Fitting method (FSF), based on good theorical properties of the solution of the problem is introduced. Numerical results and efficiency tests are presented in order to show the behaviour of FSF in comparison with G, FG and a conservative scheme of second order.

Original languageEnglish (US)
Pages (from-to)427-448
Number of pages22
JournalDiscrete and Continuous Dynamical Systems - Series B
Volume6
Issue number3
DOIs
StatePublished - May 2006
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Keywords

  • Finite difference schemes
  • Fluid-dynamic models
  • Scalar conservation laws
  • Traffic flow

Fingerprint

Dive into the research topics of 'Fast algorithms for the approximation of a traffic flow model on networks'. Together they form a unique fingerprint.

Cite this