Analysis of error growth for explicit difference schemes in conduction–convection problems

Abstract A detailed study is made of the error growth associated with explicit difference schemes for a conduction‐convection problem. It is shown that the error can become arbitrarily large after a finite number of time steps even though it ultimately decays to zero. Certain ambiguities reported in the literature can thereby be resolved.