source: CIVL/examples/accuracy/upwindSecondOrder.cvl@ bb03188

main test-branch
Last change on this file since bb03188 was ea777aa, checked in by Alex Wilton <awilton@…>, 3 years ago

Moved examples, include, build_default.properties, common.xml, and README out from dev.civl.com into the root of the repo.

git-svn-id: svn://vsl.cis.udel.edu/civl/trunk@5704 fb995dde-84ed-4084-dfe6-e5aef3e2452c

  • Property mode set to 100644
File size: 1.1 KB
Line 
1/* Commandline execution:
2 * civl verify -inputn=5 upwindSecondOrder.cvl
3 * */
4#include<civlc.cvh>
5
6$input int n = 5; /* Number of points */
7$input double h; /* Distance between points */
8$input double dt; /* Size of a time step */
9$input double a; /* Constant for wave velocity */
10$input double u1[n];
11$abstract $contin(3) $real u($real x, $real t);
12$assume(h > 0);
13$assume(dt > 0);
14$assume(a != 0);
15double v[n];
16double v_new[n];
17int iter;
18
19void upwindForward() {
20 for (int i = 1; i < n-2; i++) {
21 v_new[i] = v[i]-dt*a*(-v[i+2]+4*v[i+1]-3*v[i])/(2*h);
22 }
23 //TODO: Handle i=n-2 differently
24}
25
26void upwindBackward() {
27 for (int i = 2; i < n-1; i++) {
28 v_new[i] = v[i]-dt*a*(3*v[i]-4*v[i-1] + v[i-2])/(2*h);
29 }
30 //TODO: Handle i=1
31}
32
33void upwind() {
34 $assume($forall {j=0 .. n-1} v[j] == u(j*h, iter*dt));
35 if (a > 0)
36 upwindBackward();
37 else
38 upwindForward();
39 for (int i = 1; i < n-1; i++) {
40 v[i] = v_new[i];
41 }
42 $assert($uniform{m=2 .. n-3} (u(m*h, (iter+1)*dt)-v[m])/dt-($D[u, {t, 1}](m*h, iter*dt)+a*$D[u,{x,1}](m*h, iter*dt)) ==$O(dt)+$O(h*h));
43}
44
45void main() {
46 for (int i = 0; i < n; i++) {
47 v[i] = u1[i];
48 }
49 iter = 0;
50 upwind();
51}
Note: See TracBrowser for help on using the repository browser.