Changes between Version 36 and Version 37 of u/erica/GudonovMethodEuler


Ignore:
Timestamp:
05/06/13 12:10:07 (12 years ago)
Author:
Erica Kaminski
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • u/erica/GudonovMethodEuler

    v36 v37  
    7070=== Sampling the solution ===
    7171
    72 Once Pstar is found to within a certain degree of accuracy, ustar is given immediately by a simple formula in Toro, chapter 4.
     72Once Pstar is found to within a desired degree of accuracy, ustar is given immediately by a simple formula in Toro, chapter 4. These quantities are used to determine the combination of waves present along the intercell boundary. Once these are determined, we look for the speeds of the wave, relative to the grid speed, dx/dt = 0, which corresponds to the local intercell boudary. Depending on where the waves are, relative to this interface, the algorithm prescribes a density, velocity, and pressure for the boundary. These quantities are then used to update the cells, as described above.
    7373
    74 The time-step, is constrained by the CFL condition, which uses the max wave speed on the grid. The constraint used in the God. code here allows any given wave on the grid to travel a full delta_x in a time-step. In allowing this, we achieve a more efficient time-marching scheme, but with the assumption that wave interactions do not lead to wave accelerations.
     74=== Constraining the time step ===
     75
     76The time-step, is constrained by the CFL condition, which uses the max wave speed on the grid. The constraint used in the God. code here allows any given wave on the grid to travel a full delta_x in a time-step. In allowing this, we achieve a more efficient time-marching scheme, but with the assumption that wave interactions do not lead to wave accelerations. The CFL condition is given by:
     77
     78{{{#!Latex
     79
     80CFL = smax/(dx/dt)
     81
     82}}}
    7583
    7684== The code ==