Changes between Version 20 and Version 21 of u/erica/GudonovMethod

Timestamp:

02/13/13 16:32:23 (12 years ago)

Author:

Erica Kaminski

Comment:

—

u/erica/GudonovMethod

@@ -1 +1 @@
 === Program Outline === 
 
-This program is for solving the Inviscid Burger's equation, a non-linear PDE in x, using the Godunov method.
+This program is for solving the Inviscid Burger's equation, a non-linear PDE in x using the Godunov method.
 
 1. Read in variables such as: domlen, tfinal, cflcoeff (used for calc timestep give max speed on grid), mx, test (type of initial condition), maxitr (how many iterations should code do to try and advance solution to tfinal?), nfreq (controls how many time states should be output).
@@ -11 +11 @@
 Note, 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 iterates 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. 
 
+=== Program PDF === 
+[https://clover.pas.rochester.edu/trac/astrobear/wiki/u/u/erica/BEPaper click here]
+
+
 === Program Results ===