Functions/Subroutines | |
| program | ut_point_interpolation |
| UT for point interpolation. | |
| program ut_point_interpolation |
UT for point interpolation.
The output is organized as follows: The first (and second) column is the ID of the computation, noted 't': where the ID is 100*depth (which is log_2(N)) + 10 + 'the ID of the scheme' The third column is the position of the data The fourth column is the value printed (usualy the approximation) Now, for each depth, there is a set of line with the same ID.
Hence, the reference solution is always t=xx00
The results can be analyzed visualy with gnuplot: if the output file is "out.dat", for the 4^th depth, then use: plot '< grep "^ 411" out.dat' u 3:($4-$5) w lp, '< grep "^ 412" out.dat' u 3:($4-$5) w lp, '< grep "^ 413" out.dat' u 3:($4-$5) w lp, '< grep "^ 414" out.dat' u 3:($4-$5) w lp
The spatial convergence can be analyzed visualy with gnuplot: plot x w l ls -1, 10*x**2 w l ls -1, 100*x**3 w l ls -1, 100*x**4 w l ls -1, "< grep 'Error: MP_o2' out.dat" u 3:4 w lp, "< grep 'Error: Simpson_o3' out.dat" u 3:4 w lp, "< grep 'Error: GL_o2' out.dat" u 3:4 w lp, "< grep 'Error: GL_o3' out.dat" u 3:4 w lp