1.23
2.0
main
test-branch
| Line | |
|---|
| 1 | int nx;
|
|---|
| 2 | double u0[2];
|
|---|
| 3 | int nsteps;
|
|---|
| 4 | double kappa;
|
|---|
| 5 | double data[3][2];
|
|---|
| 6 | double u[2];
|
|---|
| 7 |
|
|---|
| 8 | void init() {
|
|---|
| 9 | nx = 2;
|
|---|
| 10 | nsteps = 2;
|
|---|
| 11 | kappa = 0.1;
|
|---|
| 12 | for (int i = 0; i < nx; i++) {
|
|---|
| 13 | u[i] = u0[i];
|
|---|
| 14 | }
|
|---|
| 15 | }
|
|---|
| 16 |
|
|---|
| 17 | void write(int time) {
|
|---|
| 18 | for (int i = 0; i < nx; i++) {
|
|---|
| 19 | data[time][i] = u[i];
|
|---|
| 20 | }
|
|---|
| 21 | }
|
|---|
| 22 |
|
|---|
| 23 | void update() {
|
|---|
| 24 | double u_new[nx];
|
|---|
| 25 |
|
|---|
| 26 | for (int i=1; i<nx-1; i++) {
|
|---|
| 27 | u_new[i] = u[i] + kappa*(u[i+1] + u[i-1] - 2*u[i]);
|
|---|
| 28 | }
|
|---|
| 29 | for (int i=1; i<nx-1; i++) {
|
|---|
| 30 | u[i] = u_new[i];
|
|---|
| 31 | }
|
|---|
| 32 | }
|
|---|
| 33 |
|
|---|
| 34 | void main() {
|
|---|
| 35 | init();
|
|---|
| 36 | write(0);
|
|---|
| 37 | for (int iter = 1; iter <= nsteps; iter++) {
|
|---|
| 38 | update();
|
|---|
| 39 | write(iter);
|
|---|
| 40 | }
|
|---|
| 41 | }
|
|---|
Note:
See
TracBrowser
for help on using the repository browser.