ForwardEuler is currently implemented through the more general multi-stage Runge Kutta schemes. It might be clearer to implement it straight from the TimeDiscretisation base class.
We might still want a non-namespaced implementation of ForwardEuler for testing of generalised schemes.
ForwardEuleris currently implemented through the more general multi-stage Runge Kutta schemes. It might be clearer to implement it straight from theTimeDiscretisationbase class.We might still want a non-namespaced implementation of
ForwardEulerfor testing of generalised schemes.