Topic 14.4: Multiple-Step Methods

Contents Previous Chapter Start of Chapter Previous Topic Introduction Notes Theory HOWTO Examples Engineering Error Questions Matlab Maple Next Topic Next Chapter

Up to now, we have seen three techniques for reducing the error for solving an initial value problem of the form:

y(1)(t) = f( t, y(t) )
y(a) = y0

where we estimated for y(b) with a single step (or iteration). To get a better answer, use the same strategy as we did for the composite trapezoidal rule by breaking the interval up into smaller sub intervals and applying either Euler's, Heun's or the 4th-order Runge Kutta methods on each subinterval.

Background

Useful background for this topic includes:

References

See the corresponding references in the last three background topics.

Copyright ©2005 by Douglas Wilhelm Harder. All rights reserved.