Context Navigation

GudonovMethod

v6	v7
6	6
7	7	2. Next, the program begins the time evolution of the initial condition. timeNow = 0.0, and a do-loop is entered that a) updates the ghost cells with a periodic boundary condition, b) figures out the dt to advance the simulation by considering a stable cfl condition for this scheme, c) computes the fluxes across inter-cell boundaries by solving the local Riemann Problem, d) updates the cells along the grid using a conservation formula, and finally e) checks if the final time has been reached - at which point if it has, the code stops and prints out final values, and if not, proceeds through the loop again until either the former is true or the max number of iterations has been reached.
	8
	9	The program does not explicitly use the time in any subroutine. It is just used in the main body of the program to determine if the end of the iterations (i.e. tfinal satisfied) has been reached. If timenow + dt DNE tfinal, the program reiterates through, setting the BC's to get the ghost cell values, so that a flux can be calculated for each side of each cell, getting the timestep to be used in the update subroutine, calculating the fluxes to be used in the update routine, then updating the mesh. Applying the conservation law to update cells repeats until tfinal has been reached or the max iterations have.