First-order Euler-forward scheme

INTERFACE:

    subroutine euler_forward(dt,numc,nlev,cc,right_hand_side)

DESCRIPTION:

Here, the first-order Euler-forward (E1) scheme is coded, with one evaluation of the right-hand sides per time step:

$$\begin{array}{rcl} c_i^{n+1} &=& \displaystyle c_i^n + \Delta... ...\right) - D_i\left(\underline{c}^n\right) \right\}. \end{array}$$ (248)

USES:

    IMPLICIT NONE

INPUT PARAMETERS:

    integer, intent(in)                 :: numc,nlev
    REALTYPE, intent(in)                :: dt
   !INPUT/OUTPUT PARAMETER:
    REALTYPE, intent(inout)             :: cc(1:numc,0:nlev)
 
    interface
       subroutine right_hand_side(first,numc,nlev,cc,rhs)
          logical, intent(in)                  :: first
          integer, intent(in)                  :: numc,nlev
          REALTYPE, intent(in)                 :: cc(1:numc,0:nlev)
          REALTYPE, intent(out)                :: rhs(1:numc,0:nlev)
       end
    end interface

REVISION HISTORY:

    Original author(s): Hans Burchard, Karsten Bolding

LOCAL VARIABLES:

   logical  :: first
   REALTYPE :: rhs(1:numc,0:nlev)
   integer  :: i,ci