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