Go to the source code of this file.
void States |
( |
const State_1D * |
state, |
|
|
int |
beg, |
|
|
int |
end, |
|
|
Grid * |
grid |
|
) |
| |
Compute 1D left and right interface states using piecewise linear reconstruction and the characteristic decomposition of the quasi-linear form of the equations.
This is done by first extrapolating the cell center value to the interface using piecewise limited linear reconstruction on the characteristic variables.
Left and right states are then evolved for the half time step using characteristic tracing if necessary.
Definition at line 4 of file flat_states.c.
23 #if TIME_STEPPING != EULER
24 #error FLAT Reconstruction must be used with EULER integration only
27 for (i =
beg; i <=
end; i++) {
28 for (nv = 0; nv <
NVAR; nv++) {
29 state->
vm[
i][nv] = state->
vp[
i][nv] = state->
v[
i][nv];
39 for (i =
beg; i <=
end-1; i++) {
double ** v
Cell-centered primitive varables at the base time level, v[i] = .
int end
Global end index for the local array.
double ** vR
Primitive variables to the right of the interface, .
double ** vp
prim vars at i+1/2 edge, vp[i] = vL(i+1/2)
int beg
Global start index for the local array.
double ** vm
prim vars at i-1/2 edge, vm[i] = vR(i-1/2)
void PrimToCons(double **uprim, double **ucons, int ibeg, int iend)
double * bn
Face magentic field, bn = bx(i+1/2)
double ** um
same as vm, in conservative vars
double ** vL
Primitive variables to the left of the interface, .
double ** up
same as vp, in conservative vars