Advanced Search
Article Contents
Article Contents

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

Abstract Related Papers Cited by
  • 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.
    Mathematics Subject Classification: 65M06; Secondary: 90B20, 35L65, 90B10.


    \begin{equation} \\ \end{equation}
  • 加载中

Article Metrics

HTML views() PDF downloads(80) Cited by(0)

Access History



    DownLoad:  Full-Size Img  PowerPoint