Processing math: 100%

« Previous
Next »

The Backward Euler scheme

Inserting the finite difference approximation in u(tn)=au(tn) yields the Backward Euler (BE) scheme: unun1tntn1=aun Solve with respect to the unknown un+1: un+1=11+a(tn+1tn)un

« Previous
Next »