Processing math: 100%

« Previous
Next »

The computational algorithm for the Forward Euler scheme

  1. compute u0i=I(xi), i=0,,Nx
  2. for n=0,1,,Nt:
    1. compute un+1i from (8) for all the internal spatial points i=1,,Nx1
    2. 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.

« Previous
Next »