Maths encyclopedia and lessons  
Search

Mathematics Encyclopedia and Lessons

 
     
 

Lessons

Popular
Subjects

algebra
arithmetic
calculus
equations
geometry
differential equations
trigonometry
number theory
probability theory
more
 

References

applied mathematics
mathematical games
mathematicians
more
 
 

Runge-Kutta methods

(Redirected from Runge-Kutta method)

In numerical analysis, the Runge-Kutta methods are a family of techniques for the approximation of solutions of ordinary differential equations. These techniques were developed around 1900 by the mathematicians C. Runge and M.W. Kutta. The fourth-order formulation ("RK4") is the most commonly used, since it provides substantial accuracy without excessive complexity.

Let an initial value problem be specified as follows.

y' = f(t, y), \quad y(t_0) = y_0

The RK4 method for this problem is given by the following equation:

y_{n+1} = y_n + {h \over 6} \left[ k_1 + 2k_2 + 2k_3 + k_4 \right]

where

k_1 = f \left( t_n, y_n \right)
k_2 = f \left( t_n + {h \over 2}, y_n + {h \over 2} k_1 \right)
k_3 = f \left( t_n + {h \over 2}, y_n + {h \over 2} k_2 \right)
k_4 = f \left( t_n + h, y_n + hk_3 \right)

Thus, the next value (yn+1) is determined by the present value (yn) plus the product of the size of the interval (h) and an estimated slope. The slope is a weighted average of slopes:

  • k1 is the slope at the beginning of the interval;
  • k2 is the slope at the midpoint of the interval, using slope k1 to determine the value of y at the point tn + h/2 using Euler's method;
  • k3 is again the slope at the midpoint, but now using the slope k2 to determine the y-value;
  • k4 is the slope at the end of the interval, with its y-value determined using k3.

When the four slopes are averaged, more weight is given to the slopes at the midpoint:

\mbox{slope} = \frac{k_1 + 2k_2 + 2k_3 + k_4}{6}

Iterative methods in general may be represented by the generic form yn+1 = c yn, where c is a coefficient that depends upon the method used and the equation being evaluated. The primary reason that the RK4 method is successful is that the coefficient c that it produces is almost always a very good approximation to the actual value. Indeed, the RK4 method has a total accumulated error on the order of h4.

See also

References

  • George E. Forsythe, Michael A. Malcolm, and Cleve B. Moler. Computer Methods for Mathematical Computations. Englewood Cliffs, NJ: Prentice-Hall, 1977. (See Chapter 6.)
  • William H. Press, Brian P. Flannery, Saul A. Teukolsky, William T. Vetterling. Numerical Recipes in C. Cambridge, UK: Cambridge University Press, 1988. (See Sections 15.1 and 15.2.)
01-04-2007 01:18:14
The contents of this article are licensed from Wikipedia.org
under the GNU Free Documentation License. How to see transparent copy