MAT360 Section Summary: 5.4

Runge-Kutta Methods

  1. Summary

    I want you to see and understand the idea behind Runge-Kutta methods, which will be used in place of the Taylor methods. But the Taylor methods provide the impetus for these methods - they're a critical place to start.

    The problem with the Taylor methods is that we have to compute all kinds of partial derivatives to make the methods work. Runge-Kutta methods will approximate those partial derivative terms by a succession of approximations computed using only the function f(t,y(t)).

    For the Taylor method of order 2, we start with

    displaymath327

    in which we estimate tex2html_wrap_inline353 as

    displaymath328

    This leads to the scheme

    displaymath329

    for which

      equation297

    But those partial derivatives sure are a pain: any way we can get there more easily?

    Yes, but we have to go through some more partial derivative pain: we consider Taylor's Theorem extended to functions of two variables:

    Theorem 5.13 Suppose that f(t,y) has continuous partial derivatives of order less than or equal to n+1 on tex2html_wrap_inline359 , and let tex2html_wrap_inline361 . For every tex2html_wrap_inline363 , there exists tex2html_wrap_inline365 between tex2html_wrap_inline367 and t and there exists tex2html_wrap_inline371 between tex2html_wrap_inline373 and y with

    displaymath330

    where

    eqnarray118

    and

    displaymath331

    Now we're ready for the trick: this is the use of the Taylor series that you might not have thought of, out there on your desert island, even if you'd sat there for a few years. We want to replace tex2html_wrap_inline377 in (1) with a value of f computed at an intermediate location, rather than on the endpoint, as Euler did. That is, consider tex2html_wrap_inline381 , expanded using the Taylor series:

    displaymath332

    while

    displaymath333

    The expansion certainly resembles tex2html_wrap_inline377 , and if we make a good choice of tex2html_wrap_inline385 and tex2html_wrap_inline387 , we can make them equal (up to the term tex2html_wrap_inline389 , which we're going to drop as our error):

    displaymath334

    displaymath335

    Given this choice, tex2html_wrap_inline389 is tex2html_wrap_inline393 , just like Taylor 2; we call this method Runge-Kutta-2, (aka RK-2, or the Midpoint method):

    displaymath336

    This sort of trick can be repeated for higher order Taylor methods, although it's usually only continued up to RK-4:

    displaymath337

    You might recognize the sum tex2html_wrap_inline395 in the formula for tex2html_wrap_inline397 as the composite trapezoidal scheme for approximating the integral

    displaymath338

    This scheme is tex2html_wrap_inline399 , just like Taylor-4, only we didn't need to compute a single partial derivative. It's wonderful! This method, therefore, will extend easily to systems of initial value problems.

    We can revisit our pendulum example, for example, to see if we see any improvement in the solution. Here it is in lisp:

    Compare RK-4 to Euler on the Pendulum problem: Here it is in lisp:




Wed Dec 7 01:49:41 EST 2005