The computational algorithm for the Forward Euler scheme
compute u0i=I(xi), i=0,…,Nx
for n=0,1,…,Nt:
compute un+1i from (8) for all the internal
spatial points i=1,…,Nx−1
set the boundary values
un+1i=0 for i=0 and i=Nx
Notice.
We visit one mesh point (xi,tn+1) at a time,
and we have an explicit formula
for computing the associated un+1i value.
The spatial points can be updated in any sequence, but the
time levels tn must be updated in cronological order: tn before
tn+1.