Courant–Friedrichs–Lewy condition
From Wikipedia, the free encyclopedia
In mathematics, the Courant–Friedrichs–Lewy condition (CFL condition) is a condition for certain algorithms for solving partial differential equations to be convergent (not to be confused with numerically stable, though for an explicit it often is within a small constant factor of the stability condition). As a consequence, the time step must be less than a certain time in many explicit time-marching computer simulations, otherwise the simulation will produce wildly incorrect results. The condition is named after Richard Courant, Kurt Friedrichs and Hans Lewy who described it in their 1928 paper.
For example, if a wave is crossing a discrete grid, then the timestep must be less than the time for the wave to travel adjacent grid points. As a corollary, when the grid point separation is reduced, the upper limit for the time step also decreases.
This can be a very limiting constraint and efforts are often made to avoid it by using implicit methods.
[edit] References
- R. Courant, K. Friedrichs and H. Lewy, Über die partiellen Differenzengleichungen der mathematischen Physik, Mathematische Annalen, vol. 100, no. 1, pages 32–74, 1928.
