I am trying to solve numerically (obviously) inviscid Burgers' equation with the finite difference method. The equation is the following:
$$ \displaystyle \partial_t u + u \, \partial_x u = 0 $$
which also reads
$$ \displaystyle \partial_t u + \frac{1}{2} \partial_x u^2 = 0$$
And since the discrete solution is positive, the upwind scheme reads
$$ \displaystyle u_j^{n+1} = u_j^n + \frac{\Delta t}{\Delta x} \left[ \left(u_{i-1}^n\right)^2 - \left(u_{i}^n\right)^2 \right] $$
All that remains is to define the computational domain and put it all in a loop and that's it, right? To definite this domain, I know we can use the famous CFL condition. I never heard about this condition at school and I just know how to use it for a simple convection case like
$$ \partial_t u + c \, \partial_x u = 0, \qquad \text{CFL} \Rightarrow \frac{c\Delta t}{\Delta x} \leq 1.$$
I don't find any documents describing the general method to follow to apply this condition in my case or in any other case. I just found this work about the same problem but I didn't understand the explanation of the condition use which is the following:
Anyway, I need help to understand how to use this condition. I have managed to implement my algorithm and get a solution but I would like to understand everything that is happening.
Thank you in advance.