Welcome to the tutorial of the Advection problem using the Advection-Diffusion-Reaction (ADR) Solver in the Nektar++ framework. This tutorial is aimed to show the main features of the ADR solver in a simple manner. If you have not already downloaded and installed Nektar++, please do so by visiting nektar.info, where you can also find the User-Guide with the instructions to install the library.
This tutorial requires:
After the completion of this tutorial, you will be familiar with:
/usr/bin. If you compile from source they will be in the sub-directory
builddirectory you created in the Nektar++ source tree. We will refer to the directory containing the executables as
$NEKfor the remainder of the tutorial.
tar -xzvf basics-advection-diffusion.tar.gzto produce a directory
basics-advection-diffusionwith subdirectories called
We will refer to the
tutorial directory as
The tutorial folder contains:
The ADR solver can solve various problems, including the unsteady advection, unsteady diffusion, unsteady advection diffusion equation, etc. For a more detailed description of this solver, please refer to the User-Guide.
In this tutorial we focus on the unsteady advection equation
where u is the independent variable and V = [Vx Vy Vz] is the advection velocity. The unsteady advection equation can be solved in one, two and three spatial dimensions. We will here consider a two-dimensional problem, so that V = [Vx Vy].
The problem we want to run consists of a given initial condition (which depends on x and y) travelling in the x-direction at a constant advection velocity. To model this problem we create a computational domain also referred to as mesh or grid (see section 2.1) on which we apply the following two-dimensional function as initial condition and periodic as well as time-dependent Dirichlet boundary conditions at the mesh boundaries
where xb and yb represent the boundaries of the computational domain (see section 2.2), Vx = 2,Vy = 0 and κ = 2π.
We successively setup the other parameters of the problem, such as the time-step, the time-integration scheme, the I/O configuration, etc. (see section 2.2). We finally run the solver (see section 3) and post-process the data in order to visualise the results (see section 4).