Context Navigation

2D_Godunov

v14	v15
46	46	The solution data for the x-split mesh is then stored in a 2D array, and used as the ''initial condition'' for the y-direction sweep. This sweep proceeds as above, this time moving cell by cell along a given column solving the IVP given by the y-split Euler equations above (and initial condition that is the SOLUTION to the previous x-split sweep). Once a column is traversed, the next is until the entire grid is sweeped. The solution to this last sweep is the solution to the full IVP (evolved to t+dt).
47	47
48		This process repeats for as many dt's needed to get to the final time of the simulation. Note, the dt is the SAME for both the x- and y-sweeps.
	48	This process repeats for as many dt's needed to get to the final time of the simulation. Note, the dt is the SAME for both the x- and y-sweeps, at least for the 1st order accurate splitting scheme presented here.
49	49
50	50	The method of choosing the best dt is described in Toro, chapter 16.