Godunov scheme and sampling technique for computing phase transitions in traffic flow modeling | Zendy

Christophe Chalons | Zendy; Paola Goatin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Christophe Chalons,

Paola Goatin

Publication year - 2008

Publication title -

interfaces and free boundaries mathematical analysis computation and applications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.964

H-Index - 39

eISSN - 1463-9971

pISSN - 1463-9963

DOI - 10.4171/ifb/186

Subject(s) - godunov's scheme , convergence (economics) , extension (predicate logic) , scheme (mathematics) , flow (mathematics) , mathematics , sampling (signal processing) , sampling scheme , phase transition , space (punctuation) , traffic flow (computer networking) , computer science , mathematical optimization , algorithm , numerical analysis , mathematical analysis , physics , geometry , statistics , estimator , computer security , filter (signal processing) , quantum mechanics , economics , computer vision , programming language , economic growth , operating system

A new version of Godunov scheme is proposed in order to compute solutions of a traffic flow model with phase transitions. The scheme is based on a modified averaging strategy and a sampling procedure. Several numerical tests are shown to prove the validity of the method. The convergence of the algorithm is demonstrated numerically. We also give a higher order extension of the method in space and time.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research