The Burgers problem: the Harten exact solution – visualization
int main(
int argc,
char**argv) {
space Xh (omega, argv[2]);
size_t nmax = (argc > 3) ? atoi(argv[3]) : 1000;
Float tf = (argc > 4) ? atof(argv[4]) : 2.5;
Float a = (argc > 5) ? atof(argv[5]) : 1;
Float b = (argc > 6) ? atof(argv[6]) : 0.5;
Float c = (argc > 7) ? atof(argv[7]) : 0;
for (
size_t n = 0;
n <= nmax; ++
n) {
}
}