next up previous

2.3 Multi-Step Methods

The Taylor Series and explicit Runge-Kutta methods that we have discussed so far have no memory: the value of for t before do not directly affect the values of for t after . Other methods take advantage of previously computed solution values and are referred to as multistep methods. The Adam's formulas for non-stiff problems and the Backward Differentiation Formulas for stiff problems furnish important and widely-used examples of multi-step methods.