Fast algorithms for the approximation of a traffic flow model on networks
New computation algorithms for a fluid-dynamic mathematical model
of flows on networks are proposed, described and
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
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 efficience tests are presented in order to show the
behaviour of FSF in comparison with G, FG and a conservative
scheme of second order.