.. _Exercice_section: ******************** Exercice and Package ******************** Introduction ============ The aim of the exercice is to produce a 2D solver for Euler equations based on a finite volume scheme, starting from a 1D code provided in the package :download:`(here) `. The code is written in FORTRAN 90 but only basic knowledge is necessary to go through the exercice. Any Fortran compiler can be used. The code is based on a first-order Godunov scheme that explicitly integrates Equations :eq:`eq_godunov`. The modifications of the code are mainly required on the mesh definition and the vector projections in the general reference frame and the local frame defined on each face of the volume. Fluxes are computed in a one-dimensionnal manner in the outgoing normal direction of the face. The developments must lead to 2D regular cartesian meshes: each cell is a rectangle. The Chapters 1-5 provided all the theoretical points that must be well understood to succeed in obtaining the 2D code. Coding can be an efficient way to understand those points. .. topic:: Go further: *After this 2D cartesian code, the next developemnt to consider is general quadrangle cells : then the solutions of more general 2D flows (like nozzle flows) can be obained... Going towards 3D is the obvious next step (be aware that the time spent to go towards 3D is much longer that the 1D-2D developments time).* Prerequisites ------------- A fortran compiler is required. One can install the GNU fortran. The 1D results are visualized with gnuplot. 2D results can be seen with Paraview. The different links to get the packages are : GNU Fortan Visit the `GNU Fortran pages `_ Gnuplot Visit the `GNUPLOT pages `_ PARAVIEW Visit the `PARAVIEW site `_ Guidelines ============ Introduction ------------ A guidelines in 6 steps is proposed to obtain the 2D code. .. hint :: The initial code is coming from a 2D code that was downgraded toward 1D: so, some vectors, some indexes are already prepaired for 2D... The different steps =================== .. toctree:: step1 step2 step3 step4 step5 step6 step7 step8 step9