A Simple Test Problem
Courant Condition: Dt = fastest speed/bin width
Time-stepped Algorithm:
•Start with an initial distribution of
“entities”
The speed of each entity is a function of the total
number of entities in each “bin”
• New entities are periodically “injected”
into the simulation zone